Clone: Solving weighted max-SAT in a reduced search space

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

Volumn 4830 LNAI, Issue , 2007, Pages 223-233

  Pipatsrisawat, Knot ^a   Darwiche, Adnan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING SYSTEMS;

LOWER BOUNDS; MAX-SAT SOLVER;

COMPUTATIONAL METHODS;

EID: 38349060078     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76928-6_24     Document Type: Conference Paper

References (26)

1. Fu, Z., Malik, S.: On solving the partial max-sat problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, Springer, Heidelberg (2006)
2. Le Berre, D.: Sat4j project homepage, http://www.sat4j.org/
3. Argelich, J., Li, C.M., Manya, F., Planes, J.: First evaluation of max-sat solvers, http://www.iiia.csic.es/~maxsat06/
4. Argelich, J., Li, C.M., Manya, F., Planes, J.: Second evaluation of max-sat solvers, http://www.maxsat07.udl.es/
5. Larrosa, J., Heras, F., de Givry, S.: A Logical Approach to Efficient Max-SAT solving. ArXiv Computer Science e-prints (November 2006)
6. de Givry, S., Heras, F., Zytnicki, M., Larrosa, J.: Existential arc consistency: Getting closer to full arc consistency in weighted csps. In: IJCAI, pp. 84-89 (2005)
7. Alsinet, T., Manya, F., Planes, J.: A max-sat solver with lazy data structures. In: Proc. of 9th Ibero-American Conf. on Artificial Intelligence (2004)
8. Li, C.M., Manya, F., Planes, J.: New inference rules for max-sat. JAIR (2007)
9. Viaga, F.H., Larrosa, J., Oliveras, A.: Minimaxsat: a new weighted max-sat solver. In: Proceedings of SAT 2007 (2007)
10. Li, C.M., Manya, F., Planes, J.: Exploiting unit propagation to compute lower bounds in branch anb bound max-sat solvers. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, Springer, Heidelberg (2005)
11. Ramirez, M., Geffner, H.: Structural relaxations by variable renaming and their compilation for solving mincostsat. In: Proceedings of CP 2007. LNCS, vol. 4741, Springer, Heidelberg (to appear, 2007)
12. Darwiche, A., Marquis, P.: A knowlege compilation map. Journal of Artificial Intelligence Research 17, 229-264 (2002)
13. Darwiche, A.: New advances in compiling CNF to decomposable negational normal form. In: Proceedings of European Conference on Artificial Intelligence (2004)
14. Darwiche, A., Marquis, P.: Compiling propositional weighted bases. Artificial Intelligence 157(1-2), 81-113 (2004)
15. Choi, A., Chavira, M., Darwiche, A.: Node splitting: A scheme for generating upper bounds in bayesian networks. In: Proceedings of UAI'07 (2007)
16. Darwiche, A.: The c2d compiler. Available at http://reasoning.cs.ucla. edu/c2d/
17. Stallman, R., Sussman, G.: Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intel. 9 (1977)
18. Marques-Silva, J., Sakallah, K.: Grasp: A search algorithm for propositional satisfiability. IEEE Trans. Computers 5, 506-521 (1999)
19. Bayardo, R.J.J., Schrag, R.C.: Using CSP look-back techniques to solve real-world SAT instances. In: Proceedings of AAAI'97, pp. 203-208 (1997)
20. Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient conflict driven learning in boolean satisfiability solver. In: ICCAD, pp. 279-285 (2001)
21. Ryan, L.: Efficient Algorithms for Clause-Learning SAT Solvers. Master's thesis, Simon Fraser University (2004)
22. Argelich, J., Manya, F.: Partial max-sat solvers with clause learning. In: Proceedings of SAT'07, pp. 28-40 (2007)
23. Larrosa, J., Heras, F.: Resolution in max-sat and its relation to local consistency in weighted csps. In: Proc. of the Intnl. Jnt. Conf. on Artfcl. Intel., pp. 193-198 (2005)
24. Selman, B., Kautz, H.: Walksat home page, http://www.cs.rochester.edu/u/
25. Wang, J.: A branching heuristic for testing propositional satisfiability. In: Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century, IEEE International Conference, pp. 4236-4238 (1995)
26. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient sat solver. In: 39th Design Automation Conference (DAC) (2001)