A Max-SAT solver with lazy data structures

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3315, Issue , 2004, Pages 334-342

  Alsinet, Teresa ^a   Manyà, Felip ^a   Planes, Jordi ^a  

^a UNIVERSITY OF LLEIDA   (Spain)

Author keywords

Branch and bound; Data structures; Heuristics; Lower bound; Max SAT

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY; ARTIFICIAL INTELLIGENCE; BRANCH AND BOUND METHOD; DATA STRUCTURES;

BRANCH AND BOUND; LOWER BOUND; MAX-SAT; TRUTH ASSIGNMENT; EXPERIMENTAL EVIDENCE; HEURISTICS; LOWER BOUNDS; NEW BRANCHES; VARIABLE SELECTION;

DATA STRUCTURES; PROBLEM SOLVING;

EID: 22944449665     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30498-2_34     Document Type: Conference Paper

References (16)

1. J. Alber, J. Gramm, and R. Niedermeier. Faster exact algorithms for hard problems: A parameterized point of view. In 25th Conf. on Current Trends in Theory and Practice of Informatics, LNCS, pages 168-185. Springer-Verlag, November 1998.
2. T. Alsinet, F. Manyà, and J. Planes. Improved Branch and Bound Algorithms for Max-SAT. In Proc. of Sixth Int. Conf. on the Theory and Applications of Satisfiability Testing, May 2003.
3. B. Borchers and J. Furman. A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. Journal of Combinatorial Optimization, 2:299-306, 1999.
4. J. Cheriyan, W. Cunningham, L. Tunçel, and Y. Wang. A linear programming and rounding approach to MAX-2-SAT. In D. Johnson and M. Trick, editors, Cliques, Coloring and Satisfiability, volume 26, pages 395-414. DIMACS, 1996.
5. M. Davis, G. Logemann, and D. Loveland. A machine program for theoremproving. Communications of the ACM, 5:394-397, 1962.
6. E. de Klerk and J. P. Warners. Semidefinite programming approaches for MAX-2-SAT and MAX-3-SAT: computational perspectives. Technical report, Delft, The Netherlands, 1998.
7. R. G. Jeroslow and J. Wang. Solving prepositional satisfiability problems. Annals of Mathematics and Artificial Intelligence, 1:167-187, 1990.
8. S. Joy, J. Mitchell, and B. Borchers. A branch and cut algorithm for MAX-SAT and Weighted MAX-SAT. In DIMACS Workshop on Satisfiability: Theory and Applications, 1996.
9. D. W. Loveland. Automated Theorem Proving. A Logical Basis, volume 6 of Fundamental Studies in Computer Science. North-Holland, 1978.
10. D. Mitchell, B. Selman, and H. Levesque. Hard and easy distributions of SAT problems. In Proceedings of the 10th National Conference on Artificial Intelligence, AAAI'92, San Jose/CA, USA, pages 459-465. AAAI Press, 1992.
11. R. Niedermeier and P. Rossmanith. New upper bounds for maximum satisfiability. Journal of Algorithms, 36:63-88, 2000.
12. D. Pretolani. Efficiency and stability of hypergraph SAT algorithms. In Proceedings of the DIMACS Challenge II Workshop, 1993.
13. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of the 10th National Conference on Artificial Intelligence, AAAI'92, San Jose/CA, USA, pages 440-446. AAAI Press, 1992.
14. H. Shen and H. Zhang. Improving exact algorithms for MAX-2-SAT. In Proceedings of the 8th International Symposium on Artificial Intelligence and Mathematics, 2004.
15. R. Wallace and E. Freuder. Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems. In D. Johnson and M. Trick, editors, Cliques, Coloring and Satisfiability, volume 26, pages 587-615. DIMACS, 1996.
16. H. Zhang, H. Shen, and F. Manya. Exact algorithms for MAX-SAT. In 4th Int. Workshop on First order Theorem Proving, June 2003.