Complexity of Only Knowing: The Propositional Case

We study the computational properties of the prepositional fragment of Levesque's logic of only knowing. In particular, we show that the problem of reasoning with only knowing in the prepositional case lies at the second level of the polynomial hierarchy. Thus, it is as hard as reasoning in the majority of propositional formalisms for nonmonotonic reasoning, like default logic, circumscription and autoepistemic logic, and it is easier than reasoning in propositional formalisms based on the minimal knowledge paradigm, which is strictly related to the notion of only knowing.

[1]  Riccardo Rosati,et al.  Minimal Knowledge States in Nonmonotonic Modal Logics , 1996, Advances in Modal Logic.

[2]  Ilkka Niemelä.  On the decidability and complexity of autoepistemic reasoning , 1992, Fundam. Informaticae.

[3]  Francesco M. Donini,et al.  Ground Nonmonotonic Modal Logics , 1997, J. Log. Comput..

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

[5]  Gerhard Lakemeyer,et al.  Limited Reasoning in First-Order Knowledge Bases , 1994, Artif. Intell..

[6]  Georg Gottlob,et al.  Complexity Results for Nonmonotonic Logics , 1992, J. Log. Comput..

[7]  Yoav Shoham,et al.  Nonmonotonic Logics: Meaning and Utility , 1987, IJCAI.

[8]  Vladimir Lifschitz,et al.  Nonmonotonic Databases and Epistemic Queries , 1991, IJCAI.

[9]  Victor W. Marek,et al.  Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.

[10]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[11]  Riccardo Rosati.  Reasoning with Minimal Belief and Negation as Failure: Algorithms and Complexity , 1997, AAAI/IAAI.

[12]  Miroslaw Truszczynski,et al.  Minimal Knowledge Problem: A New Approach , 1994, Artif. Intell..

[13]  Miroslaw Truszczynski,et al.  Modal nonmonotonic logic with restricted application of the negation as failure to prove rule , 1991, Fundamenta Informaticae.

[14]  Francesco M. Donini,et al.  A Uniform Tableaux Method for Nonmonotonic Modal Logics , 1996, JELIA.

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

[16]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[17]  Vladimir Lifschitz.  Minimal Belief and Negation as Failure , 1994, Artif. Intell..

[18]  Grigori Schwarz.  Bounding Introspection in Nonmonotonic Logic , 1992, KR.

[19]  Jianhua Chen.  The Logic of Only Knowing as a Unified Framework for Non-Monotonic Reasoning , 1994, Fundam. Informaticae.

[20]  Raymond Reiter,et al.  What should a database know? , 1988, PODS '88.

[21]  Gerhard Lakemeyer,et al.  A Tractable Knowledge Representation Service with Full Introspection , 1988, TARK.

[22]  Gerhard Lakemeyer,et al.  Only Knowing in the Situation Calculus , 1996, KR.

[23]  Leora Morgenstern,et al.  Motivated Action Theory: a Formal Theory of Causal Reasoning , 1994, Artif. Intell..

[24]  Georg Gottlob,et al.  Reasoning with parsimonious and moderately grounded expansions , 1992, Fundam. Informaticae.

[25]  Joseph Y. Halpern,et al.  Towards a Theory of Knowledge and Ignorance: Preliminary Report , 1989, NMR.

[26]  Michael Kaminski.  Embedding a default system into nonmonotonic logics , 1991, Fundam. Informaticae.

[27]  Kurt Konolige,et al.  On the Relation Between Default and Autoepistemic Logic , 1987, Artif. Intell..

[28]  Hector J. Levesque,et al.  Foundations of a Functional Approach to Knowledge Representation , 1984, Artif. Intell..