On the Complexity of Model Checking and Inference in Minimal Models

• Authors: Lefteris M. Kirousis;Phokion G. Kolaitis
• Venue: LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
• Year: 2001

Every logical formalism gives rise to two fundamental algorithmic problems: model checking and inference. In propositional logic, the model checking problem is polynomial-time solvable, while the inference problem is coNP-complete. In propositional circumscription, however, these problems have higher computational complexity, namely the model checking problem is coNP-complete, while the inference problem is II2P-complete. In this paper, we survey recent results on the computational complexity of restricted cases of these problems in the context of Schaefer's framework of generalized satisfiability problems. These results establish dichotomies in the complexity of the model checking problem and the inference problem for propositional circumscription. Specifically, in each restricted case the model checking problem for propositional circumscription either is coNP-complete or is polynomial-time solvable. Furthermore, in each restricted case the inference problem for propositional circumscription either is II2p-complete or is in coNP. These dichotomy theorems yield a complete classification of the "hard" and the "easier" cases of the model checking problem and the inference problem for propositional circumscription. Moreover, they provide efficiently checkable criteria that tell apart the "hard" cases from the "easier" ones.