Solving over-constrained problems with SAT technology

Lecture Notes in Computer Science

Volumn 3569, Issue , 2005, Pages 1-15

  Argelich, Josep ^a   Manyà, Felip ^b  

^a UNIVERSITY OF LLEIDA   (Spain)

^b ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; GRAPH THEORY;

BRANCH AND BOUND ALGORITHMS; SATISFIABILITY TECHNOLOGY; TRUTH ASSIGNMENT;

PROBLEM SOLVING;

EID: 26444437793     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11499107_1     Document Type: Conference Paper

References (18)

1. F. Aloul, A. Ramani, I. Markov, and K. Sakallah. PBS: A backtrack search pseudo-Boolean solver. In Symposium on the Theory and Applications of Satisfiability Testing, SAT-2002, 2002.
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. 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. B. Cha, K. Iwama, Y. Kambayashi, and S. Miyazaki. Local search algorithms for partial MAXSAT. In Proceedings of the 14th National Conference on Artificial Intelligence, AAAI'97, Providence/RI, USA, pages 263-268. AAAI Press, 1997.
5. J. Culberson. Graph coloring page: The flat graph generator. See http://web.cs.ualberta.ca/~joe/Coloring/Generators/flat.html, 1995.
6. M. Davis, G. Logemann, and D. Loveland. A machine program for theoremproving. Communications of the ACM, 5:394-397, 1962.
7. I. P. Gent. Arc consistency in SAT. In Proceedings of the 15th European Conference on Artificial Intelligence (ECAI), Lyon, France, pages 121-125, 2002.
8. Y. Jiang, H. Kautz, and B. Selman. Solving problems with hard and soft constraints using a stochastic algorithm for MAX-SAT. In Proceedings of the 1st International Workshop on Artificial Intelligence and Operations Research, 1995.
9. S. Kasif. On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence, 45:275-286, 1990.
10. J. Larrosa. Algorithms and Heuristics for Total and Partial Constraint Satisfaction. PhD thesis, FIB, Universitat Politècnica de Catalunya, Barcelona, 1998.
11. D. W. Loveland. Automated Theorem Proving. A Logical Basis, volume 6 of Fundamental Studies in Computer Science. North-Holland, 1978.
12. 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.
13. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient sat solver. In 39th Design Automation Conference, 2001.
14. 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.
15. H. Shen and H. Zhang. Study of lower bound functions for max-2-sat. In Proceedings of AAAI-2004, pages 185-190, 2004.
16. B. Smith and M. Dyer. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81:155-181, 1996.
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.