Natural language understanding for logical games
Not on the map. Why?
Abstract (arXiv)
We developed a system able to automatically solve logical puzzles in natural language. Our solution is composed by a parser and an inference module. The parser translates the text into first order logic (FOL), while the MACE4 model finder is used to compute the models of the given FOL theory. We also empower our software agent with the capability to provide Yes/No answers to natural language questions related to each puzzle. Moreover, in line with Explainalbe Artificial Intelligence (XAI), the agent can back its answer, providing a graphical representation of the proof. The advantage of using reasoning for Natural Language Understanding (NLU) instead of Machine learning is that the user can obtain an explanation of the reasoning chain. We illustrate how the system performs on various types of natural language puzzles, including 382 knights and knaves puzzles. These features together with the overall performance rate of 80.89% makes the proposed solution an improvement upon similar solvers for natural language understanding in the puzzles domain.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 2 of its 18 references that are in the map. First posted on arXiv 1 Oct 2021.
Builds on
2 of 18 references.
References · 2
Built on by
Citing papers per year: 2021: 1.
1 paper.
- 2021A Puzzle-Based Dataset for Natural Language Inferencecited by 4
- 2021A Puzzle-Based Dataset for Natural Language Inference10 Dec 2021