We study the computational properties of the propositional fragment of Levesque’s logic of only knowing. In particular, we show that the problem of reasoning with only knowing in the propositional 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.
CITATION STYLE
Rosati, R. (1997). Complexity of only knowing: The propositional case. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1265, pp. 76–91). Springer Verlag. https://doi.org/10.1007/3-540-63255-7_6
Mendeley helps you to discover research relevant for your work.