Foundations of a functional approach to knowledge representation.
Artificial Intelligence
Semantical considerations on nonmonotonic logic
Artificial Intelligence
All I know: a study in autoepistemic logic
Artificial Intelligence
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Journal of Logic Programming
A logic of knowledge and justified assumptions
Artificial Intelligence
Minimal knowledge problem: a new approach
Artificial Intelligence
Minimal belief and negation as failure
Artificial Intelligence
Nonmonotonic Logic II: Nonmonotonic Modal Theories
Journal of the ACM (JACM)
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Embedding Minimal Knowledge into Autoepistemic Logic
AI*IA '97 Proceedings of the 5th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Decision Procedure for Autoepistemic Logic
Proceedings of the 9th International Conference on Automated Deduction
Nonmonotonic logics: meaning and utility
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
Nonmonotonic databases and epistemic queries
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Reasoning with minimal belief and negation as failure: algorithms and complexity
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Description logics of minimal knowledge and negation as failure
ACM Transactions on Computational Logic (TOCL)
Towards First-Order Nonmonotonic Reasoning
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
| Hi-index | 0.00 |
We propose a unifying view of negation as failure, integrity constraints, and epistemic queries in nonmonotonic reasoning. Specifically, we study the relationship between satisfiability and logical implication in nonmonotonic logics, showing that, in many nonmonotonic formalisms, it is possible and easy to reduce logical implication to satisfiability. This result not only allows for establishing new complexity results for the satisfiability problem in nonmonotonic logics, but also establishes a clear relationship between the studies on epistemic queries and integrity constraints in monotonic knowledge bases with the work on negation by default in nonmonotonic reasoning and logic programming. From the perspective of the design of knowledge representation systems, such a reduction allows for defining both a simple method for answering epistemic queries in knowledge bases with nonmonotonic abilities, and a procedure for identifying integrity constraints in the knowledge base, which can be employed for optimizing reasoning in such systems.