Study of lower bound functions for MAX-2-SAT

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 185-190

  Shen, Haiou ^a   Zhang, Hantao ^a  

^a University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXACT ALGORITHMS; LOWER BOUND FUNCTIONS; MAX-2-SAT PROBLEM; PROPOSITIONAL CLAUSES;

ALGORITHMS; CONSTRAINT THEORY; FUNCTIONS; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

COMPUTER SCIENCE;

EID: 9444294967     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. 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.
2. 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.
3. B. Aspvall, M. F. Plass and R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Information Processing Letters, 1979, 8(3):121-123
4. 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.
5. B. Borchers, J. Furman, A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. Journal of Combinatorial Optimization, 2(4):299-306, 1999.
6. J. Cheriyan, W.H. Cunningnham, L. Tuncel, Y. Wang. A linear programming and rounding approach to Max 2-Sat. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 26:395-414, 1996.
7. n algorithm for k-SAT based on local search. Theoretical Computer Science, 2002.
8. M. Davis, G. Logemann, D. Loveland, A machine program for theorem-proving. Communications of the Association for Computing Machinery, 1 (July 1962), 394-397.
9. 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
10. P. Hansen, B. Jaumard. Algorithms for the maximum satisfiability problem. Computing, 44:279-303, 1990.
11. 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.
12. E.A. Hirsch. New worst-case upper bounds for SAT. Journal of Automated Reasoning, 24(4):397-420, 2000.
13. M. Mahajan, V. Raman. Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms, 31:335-354, 1999.
14. R. Niedermeier, P. Rossmanith. New upper bounds for maximum satisfiability. Journal of Algorithms, 36:63-88, 2000.
15. 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.
16. H. Shen, H. Zhang, Improving Exact Algorithms for MAX-2-SAT, Eighth International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, January 2004.
17. R. Wallace, E. Freuder. Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems. In D. Johnson and M. Trick (eds.) Cliques, Coloring and Satisfiability, volume 26, pages 587-615, 1996.
18. 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.
19. H. Zhang, H. Shen, F. Manyà: Exact algorithms for MAX-SAT. In Proc. of International Workshop on First-order Theorem Proving (FTP 2003).
20. X. Zhao, W. Zhang. An efficient algorithm for maximum boolean satisfiability based on unit propagation, linear programming, and dynamic weighting. Preprint, Department of Computer Science, Washington University. 2004.