Logic Programs vs. First-Order Formulas in Textual Inference

In the problem of recognizing textual entailment, the goal is to decide, given a text and a hypothesis expressed in a natural language, whether a human reasoner would call the hypothesis a consequence of the text. One approach to this problem is to use a first-order reasoning tool to check whether the hypothesis can be derived from the text conjoined with relevant background knowledge, after expressing all of them by first-order formulas. Another possibility is to express the hypothesis, the text, and the background knowledge in a logic programming language, and use a logic programming system. We discuss the relation of these methods to each other and to the class of effectively propositional reasoning problems. This leads us to general conclusions regarding the relationship between classical logic and answer set programming as knowledge representation formalisms.

[1]  Roy Bar-Haim,et al.  The Second PASCAL Recognising Textual Entailment Challenge , 2006 .

[2]  Chitta Baral,et al.  Using AnsProlog with Link Grammar and WordNet for QA with deep reasoning , 2005, 9th International Conference on Information Technology (ICIT'06).

[3]  Victor W. Marek,et al.  The Logic Programming Paradigm: A 25-Year Perspective , 2011 .

[4]  Johan Bos,et al.  Recognising Textual Entailment with Logical Inference , 2005, HLT.

[5]  Elena Akhmatova,et al.  Textual Entailment Resolution via Atomic Propositions , 2005 .

[6]  Farid Nouioua,et al.  Using Answer Set Programming in an Inference-Based approach to Natural Language Semantics , 2006, ArXiv.

[7]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[8]  Peter Clark,et al.  The Seventh PASCAL Recognizing Textual Entailment Challenge , 2011, TAC.

[9]  Vladimir Lifschitz,et al.  Action Languages, Answer Sets, and Planning , 1999, The Logic Programming Paradigm.

[10]  Dan I. Moldovan,et al.  Applying COGEX to Recognize Textual Entailment , 2005, MLCW.

[11]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[12]  Chitta Baral,et al.  Textual inference by combining multiple Logic programming paradigms , 2005, AAAI 2005.

[13]  Stephan Schulz.  A Comparison of Different Techniques for Grounding Near-Propositional CNF Formulae , 2002, FLAIRS Conference.

[14]  Uwe Reyle,et al.  From discourse to logic , 1993 .

[15]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.