The complexity of minimal satisfiability problems

Information and Computation

Volumn 187, Issue 1, 2003, Pages 20-39

  Kirousis, Lefteris M ^a   Kolaitis, Phokion G ^b  

^a UNIVERSITY OF PATRAS   (Greece)

^b University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

CONSTRAINT SATISFACTION; FIXED SUBGRAPH HOMEOMORPHISM; GENERALIZED SATISFIABILITY PROBLEMS; MINIMAL SATISFIABILITY PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 0344550359     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00037-3     Document Type: Article

References (23)

1. M. Cadoli, The complexity of model checking for circumscriptive formulae, Information Processing Letters (1992) 113-118.
2. M. Cadoli, Two methods for tractable reasoning in artificial intelligence: language restriction and theory approximation, Ph.D. Thesis, Università Degli Studi Di Roma "La Sapienza", Rome, Italy, 1993.
3. N. Creignou, A dichotomy theorem for maximum generalized satisfiability problems, Journal of Computer and System Sciences 51 (1995) 511-522.
4. N. Creignou, J.-J. Hébrard, On generating all solutions of generalized satisfiability problems, Theoretical Informatics and Applications 31 (6) (1997) 499-511.
5. N. Creignou, M. Hermann, Complexity of generalized satisfiability counting problems, Information and Computation 125 (1) (1996) 1-12.
6. N. Creignou, S. Khanna, M. Sudan, Complexity classifications of Boolean constraint satisfaction problems, SIAM Monographs on Discrete Mathematics and Applications 7 (2001).
7. R. Dechter, J. Pearl, Structure identification in relational data, Artificial Intelligence 48 (1992) 237-270.
8. S. Fortune, J. Hopcroft, J. Wylie, The directed homeomorphism problem, Theoretical Computer Science 10 (1980) 111-121.
9. T. A. Feder, M.Y. Vardi, The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory, SIAM Journal on Computing 28 (1999) 57-104.
10. M.R. Garey, D.S. Johnson, Computers and Intractability - A Guide to the Theory of NP-Completenes, Freeman, New York, 1979.
11. P. Hell, J. Nešetřil, On the complexity of H-coloring, Journal of Combinatorial Theory Series B 48 (1990) 92-110.
12. P.G. Jeavons, D.A. Cohen, M. Gyssens, Closure properties of constraints, Journal of the Association for Computing Machinery 44 (1997) 527-548.
13. D. Kavvadias, M. Sideri, The inverse satisfiability problem, SIAM Journal on Computing 28 (1) (1998) 152-163.
14. S. Khanna, M. Sudan, L. Trevisan, D.P. Williamson, The approximability of constraint satisfaction problems, SIAM Journal on Computing 30 (6) (2001) 1863-1920.
15. L.M. Kirousis, Ph.G. Kolaitis, The complexity of minimal satisfiability problems, in: Proceedings of the 18th Symposium on Theoretical Aspects of Computer Science, Springer, Berlin, 2001, pp. 407-418. Full version in: Electronic Colloquium on Computational Complexity (www.eccc.uni-trier.de/eccc), No. 82, 2000.
16. Ph.G. Kolaitis, M.Y. Vardi, Conjunctive-query containment and constraint satisfaction, Journal of Computer and System Sciences 61 (2002) 302-332, Preliminary version in: Proceedings of the 17th ACM Symposium on Principles of Database Systems, 1998, pp. 205-213.
17. R. Ladner, On the structure of polynomial time reducibility, Journal of the Association for Computing Machinery 22 (1975) 155-171.
18. V. Lifschitz, Computing circumscription. In Proceedings of the 9th International Joint Conference on Artificial Intelligence - AAAI '85, pages 121-127, 1985.
19. J. McCarthy, Circumscription - a form of nonmonotonic reasoning, Artificial Intelligence 13 (1980) 27-39.
20. J. McCarthy, Applications of circumscription in formalizing common sense knowledge, Artificial Intelligence 28 (1985) 89-116.
21. S. Reith, H. Vollmer, Optimal satisfiability for propositional calculi and constraint satisfaction problems, in: Proceedings of the 25th Symposium on Mathematical Foundations of Computer Science, Springer, Berlin, 2000, pp. 640-649.
22. T.J. Schaefer, The complexity of satisfiability problems, in: Proceedings of the 10th ACM Symposium on Theory of Computing, 1978, pp. 216-226.
23. U. Zwick, Finding almost-satisfying assignments, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 551-560.