The inference problem for propositional circumscription of affine formulas is coNP-complete

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2607, Issue , 2003, Pages 451-462

  Durand, Arnaud ^a   Hermann, Miki ^b  

^a CNRS   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

INFERENCE PROBLEM; NON-MONOTONIC REASONING; POLYNOMIAL-TIME;

POLYNOMIAL APPROXIMATION;

EID: 35248872557     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36494-3_40     Document Type: Article

References (10)

1. E. R. Berlekamp, R. J. McEliece, and H. C. A. van Tilborg. On the inherent intractability of certain coding problems. IEEE Trans. on Inf. Theory, IT-24(3):384-386, 1978.
2. M. Cadoli. The complexity of model checking for circumscriptive formulae. Inf. Proc. Letters, 44(3):113-118, 1992.
3. M. Cadoli and M. Lenzerini. The complexity of propositional closed world reasoning and circumscription. JCSS, 48(2):255-310, 1994.
4. S. Coste-Marquis and P. Marquis. Knowledge compilation for closed world reasoning and circumscription. J. Logic and Comp., 11(4):579-607, 2001.
5. p-complete. TCS, 114(2):231-245, 1993.
6. M. Gelfond, H. Przymusinska, and T. C. Przymusinski. On the relationship between circumscription and negation as failure. Artificial Intelligence, 38(1):75-94, 1989.
7. L. M. Kirousis and P. G. Kolaitis. The complexity of minimal satisfiability problems. In A. Ferreira and H. Reichel, (eds), Proc. 18th STACS, Dresden (Germany), LNCS 2010, pp 407-418. Springer, 2001.
8. L. M. Kirousis and P. G. Kolaitis. A dichotomy in the complexity of propositional circumscription. In Proc. 16th LICS, Boston (MA), pp 71-80. 2001.
9. D. J. Kavvadias, M. Sideri, and E. C. Stavropoulos. Generating all maximal models of a boolean expression. Inf. Proc. Letters, 74(3-4):157-162, 2000.
10. J. McCarthy. Circumscription -A form of non-monotonic reasoning. Artificial Intelligence, 13(1-2):27-39, 1980.