Exact algorithms for MAX-SAT

Electronic Notes in Theoretical Computer Science

Volumn 86, Issue 1, 2003, Pages 190-203

  Zhang, Hantao ^a   Shen, Haiou ^a   Manyà, Felip ^b  

^a University of Iowa   (United States)

^b UNIVERSITY OF LLEIDA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

DAVIS-PUTNAM-LOGEMANN-LOVELAND (DPLL); DECISION VERSION; MAXIMUM SATISFIABILITY PROBLEM (MAX-SAT); TIME COMPLEXITY;

ALGORITHMS;

EID: 18944374582     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80663-7     Document Type: Conference Paper

References (24)

1. J. Alber, J. Gramm, R. Niedermeier, Faster exact algorithms for hard problems: A parameterized point of view. Preprint, submitted to Elsevier, August, 2000
2. F.A. Aloul, A. Ramani, I.L. Markov, K.A. Sakallah, Generic ILP versus specialized 0-1 ILP: An update. Technical Report CSE-TR-461-02, University of Michigan, Ann Arbor, Michigan, Aug., 2002.
3. T. Alsinet, F. Manyà, J. Planes, Improved branch and bound algorithms for Max-SAT. Proc. of 6th International Conference on the Theory and Applications of Satisfiability Testing, SAT2003, pages 408-415.
4. T. Alsinet, F. Manyà, J. Planes, Improved branch and bound algorithms for Max-2-SAT and weighted Max-2-SAT. Catalonian Conference on Artificial Intelligence, 2003.
5. Arora S., Lund C. Hardness of approximation. Hochbaum D. Approximation algorithms for NP-hard problems, Chapter 10. 1997;399-446 PWS Publishing Company, Boston
6. N. Bansal, V. Raman, Upper bounds for MaxSat: Further improved. In Aggarwal and Rangan (eds.): Proceedings of 10th Annual conference on Algorithms and Computation, ISSAC'99, volume 1741 of Lecture Notes in Computer Science, pages 247-258, Springer-Verlag, 1999.
7. Borchers B., Furman J. A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. Journal of Combinatorial Optimization. 2:(4):1999;299-306
8. Cheriyan J., Cunningnham W.H., Tuncel L., Wang Y. A linear programming and rounding approach to Max 2-Sat. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 26:1996;395-414
9. n algorithm for k-SAT based on local search. Theoretical Computer Science. 2002
10. Davis M., Putnam H. A computing procedure for quantification theory. Journal of the Association for Computing Machinery 7. 3:July 1960;201-215
11. Davis M., Logemann G., Loveland D. A machine program for theorem-proving. Communications of the Association for Computing Machinery. 7:July 1962;394-397
12. J.W. Freeman, Improvements to propositional satisfiability search algorithms. Ph.D. Dissertation, Dept. of Computer Science, University of Pennsylvania, 1995.
13. J. Gramm, E.A. Hirsch, R. Niedermeier, P. Rossmanith: New worst-case upper bounds for MAX-2-SAT with application to MAX-CUT. Preprint, submitted to Elsevier, May, 2001
14. Hansen P., Jaumard B. Algorithms for the maximum satisfiability problem. Computing. 44:1990;279-303
15. E.A. Hirsch. A new algorithm for MAX-2-SAT. In Proceedings of 17th International Symposium on Theoretical Aspects of Computer Science, STACS 2000, vol. 1770, Lecture Notes in Computer Science, pages 65-73. Springer-Verlag.
16. Hirsch E.A. New worst-case upper bounds for SAT. Journal of Automated Reasoning. 24:(4):2000;397-420
17. Jeroslow R.G., Wang J. Solving propositional satisfiability problems. Annals of mathematics and Artificial Intelligence. 1:1990;167-187
18. Mahajan M., Raman V. Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms. 31:1999;335-354
19. R. Niedermeier, Some prospects for efficient fixed parameter algorithms. In Proc. of the 25th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'98), Springer, LNCS 1521, pages 168-185, November, 1998.
20. Niedermeier R., Rossmanith P. New upper bounds for maximum satisfiability. Journal of Algorithms. 36:2000;63-88
21. n) 3-satisfiability algorithm. In Franco et al (eds.) Proceedings of Workshop on the Satisfiability Problem, Report No. 96-230, Universität zu Köln, pages 127-136, Siena, April 1996.
22. H. Shen, H. Zhang, An empirical study of max-2-sat phase transitions, Proc. of LICS'03 Workshop on Typical Case Complexity and Phase Transitions, Ottawa, CA, June 2003.
23. Wallace R., Freuder E. Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems. Johnson D., Trick M. Cliques, Coloring and Satisfiability, volume 26. 1996;587-615
24. H. Xu, R.A. Rutenbar, K. Sakallah, sub-SAT: A formulation for related boolean satisfiability with applications in routing. ISPD'02, April, 2002, San Diego, CA.