Paper Info
Title
A Trichotomy in the Complexity of Propositional Circumscription.
Abstract
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 Pi(P)(2)-complete, coNP-complete, or in P.
Year
Venue
Field
2004
Lecture Notes in Artificial Intelligence
Discrete mathematics,Existential quantification,Inference,Algorithm,Propositional calculus,Circumscription,Non-monotonic logic,Propositional variable,Mathematics,Computational complexity theory,Trichotomy (philosophy)
DocType
Volume
ISSN
Conference
3452
0302-9743
Citations 
PageRank 
References 
10
0.54
12
Authors
1
Name
Order
Citations
PageRank
Gustav Nordh112110.40