Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers

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

Volumn 3709 LNCS, Issue , 2005, Pages 403-414

  Li, Chu Min ^a   Manyà, Felip ^b   Planes, Jordi ^c  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

^b ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

^c UNIVERSITY OF LLEIDA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; HEURISTIC METHODS; LOGIC PROGRAMMING; PROBLEM SOLVING; TREES (MATHEMATICS);

JEROSLOW-WANG VARIABLE; MAX-SAT SOLVERS; PREPROCESSING TECHNIQUES; UNIT PROPAGATION;

COMPUTATION THEORY;

EID: 33646200916     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_31     Document Type: Conference Paper

References (21)

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 Proceedings of the 6th International Conference on the Theory and Applications of Satisfiability Testing, 2003.
3. T. Alsinet, F. Manyà, and J. Planes. A Max-SAT solver with lazy data structures. In Proceedings of the 9th Ibero-American Conference on Artificial Intelligence, IBERAMIA 2004, Puebla, México, pages 334-342. Springer LNCS 3315, 2004.
4. T. Alsinet, F. Manyà, and J. Planes. Improved exact solvers for weighted Max-SAT. In Proceedings of the 8th International Conference on the Theory and Applications of Satisfiability Testing, SAT-8005, St. Andrews, Scotland, UK, pages 371-367. Springer LNCS 3569, 2005.
5. 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.
6. S. de Givry, J. Larrosa, P. Meseguer, and T. Schiex. Solving Max-SAT as weighted CSP. In 9th International Conference on Principles and Practice, of Constraint Programming, CP-2003, Kinsale, Ireland, pages 363-376. Springer LNCS 2833, 2003.
7. E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT solver. In Proceedings of Design, Automation and Test in Europe, DATE-2002, Paris, Prance, pages 142-149. IEEE Computer Society, 2001.
8. J. N. Hooker and V. Vinay. Branching rules for satisfiability. Journal of Automated Reasoning, 15:359-383, 1995.
9. R. G. Jeroslow and J. Wang. Solving propositional satisfiability problems. Annals of Mathematics and Artificial Intelligence, 1:167-187, 1990.
10. C. M. Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI'97, Nagoya, Japan, pages 366-371. Morgan Kaufmann, 1997.
11. C. M. Li and Anbulagan. Look-ahead versus look-back for satisfiability problems. In Proceedings of the 3rd International Conference on Principles of Constraint Programming, CP'97, Linz, Austria, pages 341-355. Springer LNCS 1330, 1997.
12. J. P. Marques-Silva and K. A. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers, 48(5):506-521, 1999.
13. P. Meseguer, N. Bouhmala, T. Bouzoubaa, M. Irgens, and M. Sánchez. Current approaches for solving over-constrained problems. Constraints, 8(1):9-39, 2003.
14. R. Niedermeier and P. Rossmanith. New upper bounds for maximum satisfiability. Journal of Algorithms, 36:63-88, 2000.
15. 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.
16. H. Shen and H. Zhang. Study of lower bound functions for max-2-sat. In Proceedings of AAAI-2004, pages 185-190, 2004.
17. 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. 1996.
18. Z. Xing and W. Zhang. Efficient strategies for (weighted) maximum satisfiability. In Proceedings of CP-2004, pages 690-705, 2004.
19. H. Zhang. SATO: An efficient prepositional prover. In Conference on Automated Deduction (CADE-97), pages 272-275, 1997.
20. H. Zhang, H. Shen, and F. Manya. Exact algorithms for MAX-SAT. In 4th Int. Workshop on First order Theorem Proving, June 2003.
21. L. Zhang, C. Madigan, M. Moskewicz, and S. Malik. Efficient conflict driven learning in a Boolean satisfiability solver. In International Conference on Computer Aided Design, ICCAD-S001, San Jose/CA, USA, pages 279-285, 2001.