Reasoning about minimal belief and negation as failure

Riccardo Rosati.
Journal of Artificial Intelligence Research, volume 11, pages 277-300, 1999.

 

Abstract:

We investigate the problem of reasoning in the propositional fragment of MBNF, the logic of minimal belief and negation as failure introduced by Lifschitz, which can be considered as a unifying framework for several nonmonotonic formalisms, including default logic, autoepistemic logic, circumscription, epistemic queries, and logic programming. We characterize the complexity and provide algorithms for reasoning in propositional MBNF. In particular, we show that the complexity of skeptical entailment in propositional MBNF lies at the third level of the polynomial hierarchy, hence it is harder than reasoning in all the above mentioned propositional formalisms for nonmonotonic reasoning. We also prove the exact correspondence between negation as failure in MBNF and negative introspection in Moore's autoepistemic logic.

Bibtex entry:

@String{JAIR = "Journal of Artificial Intelligence Research"}

@Article{Rosa99h,
author = "Rosati, Riccardo",
title = "Reasoning about minimal belief and negation as failure",
journal = JAIR,
volume = "11",
pages = "277--300",
year = "1999",
}