The log-support encoding of CSP into SAT

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

Volumn 4741 LNCS, Issue , 2007, Pages 815-822

  Gavanelli, Marco ^a  

^a UNIVERSITY OF FERRARA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; CODES (SYMBOLS); PROBLEM SOLVING; SUPPORT VECTOR MACHINES;

LOG-ENCODING; SUPPORT ENCODINGS;

CONSTRAINT THEORY;

EID: 38149035262     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74970-7_59     Document Type: Conference Paper

References (23)

1. Ansótegui, C., Manyà, F.: Mapping problems with finite-domain variables to problems with boolean variables. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542. Springer, Heidelberg (2005)
2. Le Berre, D., Simon, L.: SAT competition (2005), www.satcompetition.org/ 2005/
3. Bessière, C., Herbrard, E., Walsh, T.: Local consistencies in SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919. Springer, Heidelberg (2004)
4. Cadoli, M., Mancini, T., Patrizi, F.: SAT as an effective solving technology for constraint problems. In: Esposito, F., Raś, Z.W., Malerba, D., Semeraro, G. (eds.) ISMIS 2006. LNCS (LNAI), vol. 4203, pp. 540-549. Springer, Heidelberg (2006)
5. Cadoli, M., Schaerf, A.: Compiling problem specifications into SAT. Artificial Intelligence 162(1-2), 89-120 (2005)
6. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM 5, 394-397 (1962)
7. Dimopoulos, Y., Stergiou, K.: Propagation in CSP and SAT. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 137-151. Springer, Heidelberg (2006)
8. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
9. Frisch, A., Peugniez, T.: Solving non-boolean satisfiability problems with stochastic local search. In: Nebel, B. (ed.) IJCAI 2001, pp. 282-290 (2001)
10. Van Gelder, A.: Another look at graph coloring via propositional satisfiability. In: Computational Symposium on Graph Coloring and its Generalizations (2002)
11. Genisson, R., Jegou, P.: Davis and Putnam were already forward checking. In: Proc. of the 12th ECAI, pp. 180-184. Wiley, Chichester (1996)
12. Gent, I.P.: Arc consistency in SAT. In: van Harmelen, F. (ed.) ECAI'2002 (2002)
13. Gray, F.: Pulse code communication, U. S. Patent 2 632 058 (March 1953)
14. Hoos, H.: SAT-encodings, search space structure, and local search performance. In: Dean, T. (ed.) IJCAI 99, pp. 296-303. Morgan Kaufmann, San Francisco (1999)
15. Iwama, K., Miyazaki, S.: SAT-variable complexity of hard combinatorial problems. In: IFIP World Computer Congress, North-Holland, pp. 253-258 (1994)
16. Kasif, S.: On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence 45, 275-286 (1990)
17. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc. of DAC 2001, pp. 530-535. ACM Press, New York (2001)
18. Prestwich, S.: Local search on SAT-encoded colouring problems. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919. Springer, Heidelberg (2004)
19. Sadeh, N.M., Fox, M.S.: Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem. Artificial Intelligence 86(1), 1-41 (1996)
20. Sinz, C.: The SAT race (2006), http://fmv.jku.at/sat-race-2006/
21. Smith, B.M., Dyer, M.E.: Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence 81(1-2), 155-181 (1996)
22. van Dongen, M., Lecoutre, C., Roussel, O.: Second international competition of CSP and Max-CSP solvers (2006), http://www.cril.univ-artois.fr/ CPAI06/
23. Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 441-456. Springer, Heidelberg (2000)