A Tractable, Expressive, and Eventually Complete First-Order Logic of Limited Belief

In knowledge representation, obtaining a notion of belief which is tractable, expressive, and eventually complete has been a somewhat elusive goal. Expressivity here means that an agent should be able to hold arbitrary beliefs in a very expressive language like that of first-order logic, but without being required to perform full logical reasoning on those beliefs. Eventual completeness means that any logical consequence of what is believed will eventually come to be believed, given enough reasoning effort. Tractability in a first-order setting has been a research topic for many years, but in most cases limitations were needed on the form of what was believed, and eventual completeness was so far restricted to the propositional case. In this paper, we propose a novel logic of limited belief, which has all three desired properties.

[1]  James P. Delgrande,et al.  A FRAMEWORK FOR LOGICS OF EXPLICIT BELIEF , 1995, Comput. Intell..

[2]  Gerhard Lakemeyer,et al.  A Logic of Limited Belief for Reasoning with Disjunctive Information , 2004, KR.

[3]  Saul Kripke,et al.  A completeness theorem in modal logic , 1959, Journal of Symbolic Logic.

[4]  Hector J. Levesque,et al.  Tractable Reasoning in First-Order Knowledge Bases with Disjunctive Information , 2005, AAAI.

[5]  Vito F. Sinisi,et al.  Entailment: The Logic of Relevance and Necessity , 1996 .

[6]  Brian F. Chellas.  Modal Logic: Normal systems of modal logic , 1980 .

[7]  Christoph Schwering,et al.  A Reasoning System for a First-Order Logic of Limited Belief , 2017, IJCAI.

[8]  James M. Crawford,et al.  A Non-Deterministic Semantics for Tractable Inference , 1998, AAAI/IAAI.

[9]  Gerhard Lakemeyer,et al.  Decidable Reasoning in a Fragment of the Epistemic Situation Calculus , 2014, KR.

[10]  Hector J. Levesque,et al.  A Logic of Implicit and Explicit Belief , 1984, AAAI.

[11]  Marco Schaerf,et al.  On the complexity of entailment in propositional multivalued logics , 1996, Annals of Mathematics and Artificial Intelligence.

[12]  Gerhard Lakemeyer,et al.  The logic of knowledge bases , 2000 .

[13]  Gerhard Lakemeyer,et al.  Decidable Reasoning in a Logic of Limited Belief with Introspection and Unknown Individuals , 2013, IJCAI.

[14]  Gerhard Lakemeyer,et al.  Decidable Reasoning in a Logic of Limited Belief with Function Symbols , 2016, KR.

[15]  Hector J. Levesque,et al.  Towards Tractable Inference for Resource-Bounded Agents , 2015, AAAI Spring Symposia.

[16]  John McCarthy,et al.  Programs with common sense , 1960 .

[17]  Jaakko Hintikka,et al.  Impossible possible worlds vindicated , 1975, J. Philos. Log..

[18]  Hector J. Levesque,et al.  All I Know: A Study in Autoepistemic Logic , 1990, Artif. Intell..

[19]  J. Armstrong.  Knowledge and Belief , 1953 .

[20]  Gerhard Lakemeyer,et al.  Limited Reasoning in First-Order Knowledge Bases with Full Introspection , 1996, Artif. Intell..

[21]  Mukesh Dalal,et al.  Semantics of an Anytime Family of Reasoners , 1996, ECAI.

[22]  Hector J. Levesque.  A Completeness Result for Reasoning with Incomplete First-Order Knowledge Bases , 1998, KR.

[23]  Peter F. Patel-Schneider,et al.  A decidable first-order logic for knowledge representation , 1985, Journal of Automated Reasoning.

[24]  P. Dangerfield.  Logic , 1996, Aristotle and the Stoics.

[25]  J. Dunn,et al.  Intuitive semantics for first-degree entailments and ‘coupled trees’ , 1976 .

[26]  Alan M. Frisch.  Inference without Chaining , 1987, IJCAI.

[27]  Ronald Fagin,et al.  A Nonstandard Approach to the Logical Omniscience Problem , 1990, Artif. Intell..

[28]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..