Lefteris M. Kirousis and Phokion G. Kolaitis. A Dichotomy in the Complexity of Propositional Circumscription. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science -- LICS 2001, pages 71--80, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On the Complexity of Model Checking and Inference in.. - Kirousis, Kolaitis (2001) (Correct)
....[Cad92,Cad93] proposed that the model checking problem for propositional circumscription be investigated in Schaefer s framework and raised the question of whether it is possible to obtain a complete classi cation of its complexity. This question was settled armatively in [KK01a] moreover, in [KK01b] the complexity of the inference problem for propositional circumscription was investigated in the context of Schaefer s framework and a characterization of the P 2 complete cases was obtained. The balance of this extended abstract is organized as follows. In Section 2, we present Schaefer s ....
....fact, it is coNP complete) In [KK01a] the following dichotomy theorem was established for the family MC Circ(S) of model checking problems for propositional circumscription: if S is a nite set of logical relations, then either MC Circ(S) is coNP complete or MC Circ(S) is in P. Furthermore, in [KK01b], the following dichotomy theorem was established for the family Inf Circ(S) of inference problems for propositional circumscription: if S is a nite set of logical relations, then either Inf Circ(S) is P 2 complete or Inf Circ(S) is in coNP. It was also shown that the boundaries in these two ....
[Article contains additional citation context not shown here]
L.M. Kirousis and Ph.G. Kolaitis. A dichotomy in the complexity of propositional circumscription. In Proc. of the 16th Annual IEEE Symposium on Logic in Computer Science { LICS
Inverse Circumscription - Chen (Correct)
No context found.
Lefteris M. Kirousis and Phokion G. Kolaitis. A Dichotomy in the Complexity of Propositional Circumscription. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science -- LICS 2001, pages 71--80, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC