The complexity of minimal satisfiability problems

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

Volumn 2010, Issue , 2001, Pages 407-418

  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

POLYNOMIAL APPROXIMATION;

DECISION PROBLEMS; DICHOTOMY THEOREM; MIN-SAT; NP COMPLETE; PARTIAL ORDER; POLYNOMIAL-TIME; SATISFIABILITY PROBLEMS; TRUTH ASSIGNMENT;

FORMAL LOGIC;

EID: 26444524434     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_36     Document Type: Conference Paper

References (23)

1. M. Cadoli. The complexity of model checking for circumscriptive formulae. Information Processing Letters, pages 113–118, 1992.
2. M. Cadoli. Two Methods for Tractable Reasoning in Artificial Intelligence: Language Restriction and Theory Approximation. PhD thesis, Univ. Di Roma, 1993.
3. N. Creignou and M. Hermann. Complexity of generalized satisfiability counting problems. Information and Computation, 125(1):1–12, 1996.
4. N. Creignou. A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences, 51:511–522, 1995.
5. R. Dechter and J. Pearl. Structure identification in relational data. Artificial Intelligence, 48:237–270, 1992.
6. S. Fortune, J. Hopcroft, and J. Wyllie. The directed homeomorphism problem. Theoretical Computer Science, 10:111–121, 1980.
7. T.A. Feder and M.Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM J. on Computing, 28:57–104, 1999.
8. M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., 1979.
9. P. Hell and J. Nešetřil. On the complexity of H-coloring. Journal of Combinatorial Theory, Series B, 48:92–110, 1990.
10. G. Istrate. Looking for a version of Schaefer’s dichotomy theorem when each variable occurs at most twice. T.R. 652, Computer Science Department, The University of Rochester, 1997.
11. P.G. Jeavons, D.A. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the Association for Computing Machinery, 44:527–548, 1997.
12. D. Kavvadias and M. Sideri. The inverse satisfiability problem. SIAM Journal of Computing, 28(1):152–163, 1998.
13. S. Khanna, M. Sudan, and L. Trevisan. Constraint satisfaction: the approximability of minimization problems. Proc. 12th IEEE Conf. on Computational Complexity, 282–296, 1997.
14. S. Khanna, M. Sudan, and D.P. Williamson. A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction. Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 11–20, 1997.
15. L.M. Kirousis and Ph.G. Kolaitis. The complexity of minimal satisfiability problems. Electronic Coll. Computational Complexity (http://www.eccc.uni-trier.de/eccc), No. 82, 2000.
16. Ph.G. Kolaitis and M.Y. Vardi. Conjunctive-query containment and constraint satisfaction. In Proc. 17th ACM Symp. on Principles of Database Systems, pages 205–213, 1998.
17. R. Ladner. On the structure of polynomial time reducibility. Journal of the Association for Computing Machinery, 22:155–171, 1975.
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:27–39, 1980.
20. J. McCarthy. Applications of circumscription in formalizing common sense knowledge. Artificial Intelligence, 28:89–116, 1985.
21. S. Reith and H. Vollmer. Optimal satisfiability for propositional calculi and constraint satisfaction problems. In Proc. 25th Symposium on Mathematical Foundations of Computer Science - MFCS 2000, pages 640–649, Lecture Notes in Computer Science, Springer, 2000.
22. T.J. Schaefer. The complexity of satisfiability problems. In Proc. 10th ACMSymp. on Theory of Computing, pages 216–226, 1978.
23. U. Zwick. Finding almost-satisfying assignments. Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 551–560, 1998.