The expressive rate of constraints
Annals of Mathematics and Artificial Intelligence
Redundancy in logic III: Non-monotonic reasoning
Artificial Intelligence
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
The complexity of generalized satisfiability for linear temporal logic
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Minimization for generalized Boolean formulas
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
| Hi-index | 0.00 |
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.