Semantical considerations on nonmonotonic logic
Artificial Intelligence
Logic programs with classical negation
Logic programming
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Journal of Logic Programming
Extended logic programs as autoepistemic theories
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Reasoning with parsimonious and moderately grounded expansions
Fundamenta Informaticae - Special issue on modal logics in knowledge representation
Minimal knowledge problem: a new approach
Artificial Intelligence
Minimal belief and negation as failure
Artificial Intelligence
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Autoepistemic description logics
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Nonmonotonic databases and epistemic queries
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
On bimodal nonmonotonic logics and their unimodal and nonmodal equivalents
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Reducing query answering to satisfiability in nonmonotonic logics
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Reasoning about Minimal Knowledge in Nonmonotonic Modal Logics
Journal of Logic, Language and Information
Generalized Default Logic: Minimal Knowledge, Autoepistemic and Default Reasoning Reconciled
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Towards First-Order Nonmonotonic Reasoning
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Autoepistemic description logics
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Model checking for nonmonotonic logics: algorithms and complexity
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Hi-index | 0.00 |
We study the computational properties of 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 skeptical entailment in propositional MBNF is Π3p-complete, 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.