Optimal satisfiability for propositional calculi and constraint satisfaction problems

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

Volumn 1893, Issue , 2000, Pages 640-649

  Reith, Steffen ^a   Vollmer, Heribert ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; POLYNOMIAL APPROXIMATION;

POLYNOMIAL-TIME; PROPOSITIONAL FORMULAS; SATISFIABILITY; SATISFYING ASSIGNMENTS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84959251475     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_59     Document Type: Conference Paper

References (16)

1. N. Creignou and M. Hermann. Complexity of generalized satisfiability counting problems. Information and Computation, 125:1-12, 1996.
2. N. Creignou and J.-J. Hebrard. On generating all solutions of generalized satisfiability problems. Informatique Theorique et Applications/Theoretical Informatics and Applications, 31(6):499-511, 1997.
3. N. Creignou, S. Khanna, and M. Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems. Monographs on Discrete Applied Mathematics. SIAM, 2000. To appear.
4. N. Creignou. A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences, 51:511-522, 1995.
5. S. W. Jablonski, G. P. Gawrilow, and W. B. Kudrajawzew. Boolesche Funk-tionen und Postsche Klassen. Akademie-Verlag, 1970.
6. L. Kirousis and P. G. Kolaitis. Dichotomy theorems for minimal satisfiability. manuscript, 1999.
7. M. W. Krentel. The complexity of optimization functions. Journal of Computer and System Sciences, 36:490-509, 1988.
8. M. W. Krentel. Generalizations of OptP to the polynomial hierarchy. Theoretical Computer Science, 97:183-198, 1992.
9. S. Khanna, M. Sudan, and L. Trevisan. Constraint satisfaction: The ap-proximability of minimization problems. In Proceedings 12th Computational Complexity Conference, pages 282-296. IEEE Computer Society Press, 1997.
10. S. Khanna, M. Sudan, and D. Williamson. A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction. In Proceedings 29th Symposium on Theory of Computing, pages 11-20. ACM Press, 1997.
11. R. Ladner. On the structure of polynomial-time reducibility. Journal of the ACM, 22:155-171, 1975.
12. Harry R. Lewis. Satisfiability problems for propositional calculi. Mathematical Systems Theory, 13:45-53, 1979.
13. E. L. Post. The Two-Valued Iterative Systems ofMathematical Logic. Annals of Mathematics Studies 5. Princeton University Press, London, 1941.
14. Steffen Reith and Klaus W. Wagner. The complexity of problems defined by boolean circuits. Technical Report 255, Institut fuar Informatik, Univer-sitaat Wuarzburg, 2000. To appear in Proceedings International Conference Mathematical Foundation of Informatics, Hanoi, October 25-28, 1999.
15. T. J. Schaefer. The complexity of satisfiability problems. In Proccedings 10th Symposium on Theory of Computing, pages 216-226. ACM Press, 1978.
16. K. W. Wagner. More complicated questions about maxima and minima, and some closures of NP. Theoretical Computer Science, 51:53-80, 1987.