An Algebraic Approach to the Complexity of Propositional Circumscription
2004 (English)In: Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS-2004), Turku, Finland, 2004, 367-376 p.Conference paper (Other academic)
Every logical formalism gives rise to two fundamental problems: model checking and inference. Circumscription is one of the most important and well studied formalisms in the realm of nonmonotonic reasoning. The model checking and inference problem for propositional circumscription has been extensively studied from the viewpoint of computational complexity. We use a new approach based on algebraic techniques to study the complexity of the model checking and inference problems for propositional variable circumscription in a unified way. We prove that there exists a dichotomy theorem for the complexity of the inference problem in propositional variable circumscription. We also study the model checking and inference problem for propositional variable circumscription in many-valued logics using the same algebraic techniques. In particular we prove dichotomy theorems for the complexity of model checking and inference for propositional variable circumscription in the case of 3-valued logic.
Place, publisher, year, edition, pages
2004. 367-376 p.
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-14453DOI: 10.1109/LICS.2004.1319631ISBN: 0-7695-2192-4OAI: oai:DiVA.org:liu-14453DiVA: diva2:23525