A trichotomy in the complexity of propositional circumscription
2005 (English)In: Logic for Programming, Artificial Intelligence, and Reasoning: 11th International Conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005. Proceedings / [ed] Franz Baader and Andrei Voronkov, Springer Berlin/Heidelberg, 2005, Vol. 3452, 257-269 p.Chapter in book (Refereed)
Circumscription is one of the most important and well studied formalisms in the realm of nonmonotonic reasoning. The inference problem for propositional 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 propositional variable circumscription. More specifically we prove that every restricted case of the problem is either &UPi,(P)(2)-complete, coNP-complete, or in P.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2005. Vol. 3452, 257-269 p.
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 3452
, Lecture Notes in Computer Science,, ISSN 0302-9743 ; 3452
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-48214DOI: 10.1007/978-3-540-32275-7_18ISBN: 3-540-25236-3ISBN: 978-3-540-25236-8ISBN: e-978-3-540-32275-7OAI: oai:DiVA.org:liu-48214DiVA: diva2:269110