On the counting complexity of propositional circumscription

Information Processing Letters

Volumn 106, Issue 4, 2008, Pages 164-170

  Durand, Arnaud ^a   Hermann, Miki ^b  

^a INSTITUT DE MATHÉMATIQUES DE JUSSIEU   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Computational complexity; Counting complexity; Horn, dual Horn, bijunctive, and affine formulas; Hypergraph transversal; Propositional circumscription

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; DATA MINING; GRAPH THEORY; MATHEMATICAL MODELS; MODEL CHECKING;

BOOLEAN FORMULA; CODING THEORY; COUNTING COMPLEXITY; HYPERGRAPH TRANSVERSAL; PROPOSITIONAL CIRCUMSCRIPTION;

PROBLEM SOLVING;

EID: 40849139538     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.11.006     Document Type: Article

References (18)

1. Ashikhmin A., and Barg A. Minimal vectors in linear codes. IEEE Transactions on Information Theory IT-44 5 (1998) 2010-2018
2. Cadoli M. The complexity of model checking for circumscriptive formulae. Information Processing Letters 44 3 (1992) 113-118
3. Durand A., Hermann M., and Kolaitis P.G. Subtractive reductions and complete problems for counting complexity classes. Theoretical Computer Science 340 3 (2005) 496-513
4. Eiter T., and Gottlob G. Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing 24 6 (1995) 1278-1304
5. Fredman M.L., and Khachiyan L. On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms 21 3 (1996) 618-628
6. Gunopulos D., Khardon R., Mannila H., and Toivonen H. Data mining, hypergraph transversals, and machine learning. Proceedings 16th Symposium on Principles of Database Systems (PODS'97). Tucson (Arizona, USA) (1997), ACM Press
7. Hemaspaandra L.A., and Vollmer H. The satanic notations: Counting classes beyond #P and other definitional adventures. SIGACT News, Complexity Theory Column 8 26 1 (1995) 2-13
8. Kavvadias D.J., Sideri M., and Stavropoulos E.C. Generating all maximal models of a boolean expression. Information Processing Letters 74 3-4 (2000) 157-162
9. Kirousis L.M., and Kolaitis P.G. The complexity of minimal satisfiability problems. Information and Computation 187 1 (2003) 20-39
10. Kozen D.C. The Design and Analysis of Algorithms (1992), Springer-Verlag 138-143 (Chap. 26: Counting problems and #P)
11. McCarthy J. Circumscription-A form of non-monotonic reasoning. Artificial Intelligence 13 1-2 (1980) 27-39
12. Papadimitriou C.H. Computational Complexity (1994), Addison-Wesley
13. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning (2001), Elsevier Science
14. T.J. Schaefer, The complexity of satisfiability problems, in: Proceedings 10th Symposium on Theory of Computing (STOC'78), San Diego (California, USA), 1978
15. Stockmeyer L.J. The polynomial-time hierarchy. Theoretical Computer Science 3 1 (1976) 1-22
16. Valiant L.G. The complexity of computing the permanent. Theoretical Computer Science 8 2 (1979) 189-201
17. Valiant L.G. The complexity of enumeration and reliability problems. SIAM Journal on Computing 8 3 (1979) 410-421
18. Wrathall C. Complete sets and the polynomial-time hierarchy. Theoretical Computer Science 3 1 (1976) 23-33