Modelling Max-CSP as partial Max-SAT

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

Volumn 4996 LNCS, Issue , 2008, Pages 1-14

  Argelich, Josep ^a   Cabiscol, Alba ^a   Lynce, Inês ^b   Manyà, Felip ^a  

^a UNIVERSITY OF LLEIDA   (Spain)

^b INESC ID   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; COMPUTATIONAL METHODS; DATA PROCESSING; RANDOM PROCESSES;

CSP; MAX-SAT; PERFORMANCE PROFILE;

ENCODING (SYMBOLS);

EID: 44649185121     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79719-7_1     Document Type: Conference Paper

References (23)

1. Alsinet, T., Manyà, F., Planes, J.: Improved exact solver for weighted Max-SAT. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 371-377. Springer, Heidelberg (2005)
2. Argelich, J., Manỳ, F.: Exact Max-SAT solvers for over-constrained problems. Journal of Heuristics 12(4-5), 375-392 (2006)
3. Argelich, J., Manyà, F.: Partial Max-SAT solvers with clause learning. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 28-40. Springer, Heidelberg (2007)
4. Bessiè re, C., Hebrard, E., Walsh, T.: Local consistencies in SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 299-314. Springer, Heidelberg (2004)
5. Bonet, M.L., Levy, J., Manyà, F.: A complete calculus for Max-SAT. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 240-251. Springer, Heidelberg (2006)
6. Bonet, M.L., Levy, J., Manyà, F.: Resolution for Max-SAT. Artificial Intelligence 171(8-9), 240-251 (2007)
7. Een, N., Sorensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
8. Fu, Z., Malik, S.: On solving the partial MAX-SAT problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 252-265. Springer, Heidelberg (2006)
9. Gavanelli, M.: The log-support encoding of CSP into SAT. In: Bessiè re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 815-822. Springer, Heidelberg (2007)
10. Gé nisson, R., Jé gou, P.: Davis and Putnam were already checking forward. In: Proceedings of the ECAI-1996, pp. 180-184 (1996)
11. Gent, I.P.: Arc consistency in SAT. In: Proceedings of ECAI-2002, pp. 121-125 (2002)
12. Heras, F., Larrosa, J., Oliveras, A.: MiniMaxSat: A new weighted Max-SAT solver. In: Proceedings of SAT-2007 (2007)
13. Kasif, S.: On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence 45, 275-286 (1990)
14. Larrosa, J., Heras, F.: Resolution in Max-SAT and its relation to local consistency in weighted CSPs. In: Proceedings of IJCAI-2005, Edinburgh, Scotland, pp. 193-198. Morgan Kaufmann, San Francisco (2005)
15. Larrosa, J., Heras, F., de Givry, S.: A logical approach to efficient max-sat solving. Artificial Intelligence 172(2-3), 204-233 (2008)
16. Li, C.M., Manyà, F., Planes, J.: Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 403-414. Springer, Heidelberg (2005)
17. Li, C.M., Manyà, F., Planes, J.: Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT. In: Proceedings of AAAI-2006, pp. 86-91 (2006)
18. Li, C.M., Manyà, F., Planes, J.: New inference rules for Max-SAT. Journal of Artificial Intelligence Research 30, 321-359 (2007)
19. Marques-Silva, J., Planes, J.: Algorithms for Maximum Satisfiability using Unsat-isfiable Cores. In: Proceedings of DATE-2008 (2008)
20. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: 39th Design Automation Conference (2001)
21. Pipatsrisawat, K., Darwiche, A.: Clone: Solving weighted max-sat in a reduced search space. In: 20th Australian Joint Conference on Artificial Intelligence, AI-2007, pp. 223-233 (2007)
22. Ramí rez, M., Geffner, H.: Structural relaxations by variable renaming and their compilation for solving MinCostSAT. In: Bessiè re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 605-619. Springer, Heidelberg (2007)
23. Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 441-456. Springer, Heidelberg (2000)