A computationally grounded logic of knowledge, belief and certainty

This paper presents a logic of knowledge, belief and certainty, which allows us to explicitly express the knowledge, belief and certainty of an agent. A computationally grounded model, called interpreted KBC systems, is given for interpreting this logic. The relationships between knowledge, belief and certainty are explored. In particular, certainty entails belief; and to the agent what it is certain of appears to be the knowledge. To formalize those agents that are able to introspect their own belief and certainty, we identify a subclass of interpreted KBC systems, called introspective KBC systems. We provide sound and complete axiomatizations for the logics. We show that the validity problem for the interpreted KBC systems is PSPACE-complete, and the same problem for introspective KBC systems is co-NP complete, thus no harder than that of the propositional logic.

[1]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[2]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[3]  Wolfgang Lenzen,et al.  Recent work in epistemic logic , 1978 .

[4]  W. van der Hoek,et al.  Epistemic logic for AI and computer science , 1995, Cambridge tracts in theoretical computer science.

[5]  E. Beth.  The foundations of mathematics : a study in the philosophy of science , 1959 .

[6]  Joseph Y. Halpern,et al.  A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols , 1992, JACM.

[7]  Max J. Cresswell,et al.  A New Introduction to Modal Logic , 1998 .

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

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

[10]  Anand S. Rao,et al.  Decision Procedures for BDI Logics , 1998, J. Log. Comput..

[11]  Michael Wooldridge,et al.  A Computationally Grounded Logic of Visibility, Perception, and Knowledge , 2001, Log. J. IGPL.

[12]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[13]  Hector J. Levesque,et al.  Intention is Choice with Commitment , 1990, Artif. Intell..

[14]  Frans Voorbraak,et al.  The Logic of Objective Knowledge and Rational Belief , 1990, JELIA.

[15]  Richard E. Ladner,et al.  The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[16]  Alessio Lomuscio,et al.  Deontic Interpreted Systems , 2003, Stud Logica.

[17]  R. Labrecque.  The Correspondence Theory , 1978 .

[18]  Joseph Y. Halpern,et al.  The complexity of reasoning about knowledge and time , 1986, STOC '86.

[19]  Michael Wooldridge,et al.  Computationally grounded theories of agency , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[20]  Saul A. Kripke,et al.  Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi , 1963 .

[21]  Yoav Shoham,et al.  Knowledge, Certainty, Belief, and Conditionalisation (Abbreviated Version) , 1994, KR.

[22]  Stéphane Demri,et al.  A Class of Decidable Information Logics , 1998, Theor. Comput. Sci..