Partial Max-SAT solvers with clause learning

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

Volumn 4501 LNCS, Issue , 2007, Pages 28-40

  Argelich, Josep ^a   Manyà, Felip ^a  

^a UNIVERSITY OF LLEIDA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; HEURISTIC METHODS; PROBLEM SOLVING;

CLAUSE LEARNING; PARTIAL MAX-SAT SOLVERS; PMS-LEARNING;

LEARNING SYSTEMS;

EID: 38049181433     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72788-0_7     Document Type: Conference Paper

References (22)

1. T. Alsinet, F. Manyà, and J. Planes. Improved exact solver for weighted Max-SAT. In Proceedings of the 8th International Conference on Theory and Applications of Satisfiability Testing, SAT-2005, St. Andrews, Scotland, pages 371-377. Springer LNCS 3569, 2005.
2. J. Argelich and F. Manyà. Solving over-constrained problems with SAT technology. In Proceedings of the 8th International Conference on Theory and Applications of Satisfiability Testing, SAT-2005, St. Andrews, Scotland, pages 1-15. Springer LNCS 3569, 2005.
3. J. Argelich and F. Manyà. Exact Max-SAT solvers for over-constrained problems. Journal of Heuristics, 12(4-5):375-392, 2006.
4. J. Argelich and F. Manyà. Learning hard constraints in Max-SAT. In Proceedings of the Workshop on Constraint Solving and Constraint Logic Porgramming, CSCLP-2006, Lisbon, Portugal, pages 1-12, 2006.
5. N. Bansal and V. Raman. Upper bounds for MaxSat: Further improved. In Proc 10th International Symposium on Algorithms and Computation, ISAAC'99, Chennai, India, pages 247-260. Springer, LNCS 1741, 1999.
6. M. Bonet, J. Levy, and F. Manyà. A complete calculus for Max-SAT. In Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing, SAT-2006, Seattle, USA, pages 240-251. Springer LNCS 4121, 2006.
7. M. Bonet, J. Levy, and F. Manyà. Resolution for Max-SAT. Artificial Intelligence, 2007. doi:10.1016/j.artint.2007.03.001.
8. 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.
9. Z. Fu and S. Malik. On solving the partial MAX-SAT problem. In Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing, SAT-2006, Seattle, USA, pages 252-265. Springer LNCS 4121, 2006.
10. V. Heinink, M. Seckington, and F. van der Werf. Experiments on Random 2-SoftSAT. Technical report, Delft University of Technology, 2006.
11. F. Heras and J. Larrosa. New inference rules for efficient Max-SAT solving. In Proceedings of the National Conference on Artificial Intelligence, AAAI-2006, Boston/MA, USA, pages 68-73, 2006.
12. F. Heras, J. Larrosa, and A. Oliveras. Minimaxsat: A new weighted Max-SAT solver. In Proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing, SAT-2007, Lisbon, Portugal, 2007.
13. R. G. Jeroslow and J. Wang. Solving propositional satisfiability problems. Annals of Mathematics and Artificial Intelligence, 1:167-187, 1990.
14. 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.
15. J. Larrosa and F. Heras. Resolution in Max-SAT and its relation to local consistency in weighted CSPs. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI-2005, Edinburgh, Scotland, pages 193-198. Morgan Kaufmann, 2005.
16. C. M. Li, F. Manyà, and J. Planes. Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers. In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, CP-2005, Sitges, Spain, pages 403-414. Springer LNCS 3709, 2005.
17. C. M. Li, F. Manyà, and J. Planes. Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT. In Proceedings of the 21st National Conference on Artificial Intelligence, AAAI-2006, Boston/MA, USA, pages 86-91, 2006.
18. D. W. Loveland. Automated Theorem Proving. A Logical Basis, volume 6 of Fundamental Studies in Computer Science. North-Holland, 1978.
19. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient sat solver. In 39th Design Automation Conference, 2001.
20. H. Shen and H. Zhang. Study of lower bound functions for max-2-sat. In Proceedings of AAAI-2004, pages 185-190, 2004.
21. Z. Xing and W. Zhang. An efficient exact algorithm for (weighted) maximum satisfiability. Artificial Intelligence, 164(2):47-80, 2005.
22. 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-2001, San Jose/CA, USA, pages 279-285, 2001.