Semantical considerations on nonmonotonic logic
Artificial Intelligence
Making believers out of computers
Artificial Intelligence
Towards a theory of knowledge and ignorance: preliminary report
Logics and models of concurrent systems
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
The complexity of model checking for circumscriptive formulae
Information Processing Letters
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Planning via Model Checking: A Decision Procedure for AR
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
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
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
| Hi-index | 0.00 |
We study the complexity of model checking in proposit ional nonmonotonic logics. Specifically, we first define the problem of model checking in such formalisms, based on the fact that several nonmonotonic logics make use of interpretation structures (i.e. default extensions, stable expansions, universal Kripke models) which are more complex than standard interpretations of propositional logic. Then, we analyze the complexity of checking whether a given interpretation structure satisfies a nonmonotonic theory. In particular, we characterize the complexity of model checking for Reiter's default logie and its restrictions, Moore's autoepistemie logic, and several nonmonotonic modal logics. The results obtained show that, in all such formalisms, model checking is computationally easier than logical inference.