Abstract
Circumscription is one of the most important and well studied formalisms in the realm of nonmonotonic reasoning. The inference problem for prepositional circumscription has been extensively studied from the viewpoint of computational complexity. We prove that there exists a trichotomy for the complexity of the inference problem in prepositional variable circumscription. More specifically we prove that every restricted case of the problem is either Π2P-complete, coNP-complete, or in P. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Nordh, G. (2005). A trichotomy in the complexity of propositional circumscription. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3452 LNAI, pp. 257–269). Springer Verlag. https://doi.org/10.1007/978-3-540-32275-7_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
