GAC via unit propagation

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

Volumn 4741 LNCS, Issue , 2007, Pages 133-147

  Bacchus, Fahiem ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); LEARNING ALGORITHMS;

GENERALIZED ARC CONSISTENCY (GAC); UNIT PROPAGATION;

CONSTRAINT THEORY;

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

References (17)

1. Bailleux, O., Boufkhad, Y.: Efficient cnf encoding of boolean cardinality constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 108-122. Springer, Heidelberg (2003)
2. Bailleux, O., Boufkhad, Y.: Full cnf encoding: The counting constraints case. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, Springer, Heidelberg (2005)
3. Bennaceur, H.: A comparison between sat and csp techniques. Constraints 9, 123-138 (2004)
4. Bessière, C., Régin, J.C.: Arc consistency for general constraint networks: Preliminary results. In: Proc. UCAI, pp. 398-404 (1997)
5. Chavira, M., Darwiche, A.: Compiling bayesian networks with local structure. In: Proc. UCAI-2005, pp. 1306-1312 (2005)
6. Dimopoulos, Y., Stergiou, K.: Propagation in csp and sat. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 137-151. Springer, Heidelberg (2006)
7. Eén, N., Sörensson, N.: Minisat solver, http://www.cs. chalmers.se/Cs/Research/FormalMethods/MiniSat/MiniSat.html
8. Freeman, J.W.: Improvements to Propositional Satisfiability Search Algorithms. PhD thesis, University of Pennsylvania (1995)
9. Gent, I.: Arc consistency in sat. In: ECAI, pp. 121-125 (2002)
10. Gent, I., Nightingale, P.: A new encoding of all-different into SAT. In: Proc. 3rd International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, pp. 95-110 (2004)
11. Hebrard, E., Bessière, C., Walsh, T.: Local consistencies in sat. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 400-407. Springer, Heidelberg (2004)
12. Katsirelos, G., Bacchus, F.: Generalized nogoods in csps. In: Proc. of AAAI, pp. 390-396 (2005)
13. Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258. Springer, Heidelberg (2004)
14. Quimper, C.-G., Walsh, T.: Decomposing global grammar constraints. In: Proc. of CP2007 (2007)
15. Sinz, C.: Towards an optimal cnf encoding of boolean cardinality constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 827-831. Springer, Heidelberg (2005)
16. van Hoeve, W.J., Pesant, G., Rousseau, L.M., Sabharwal, A.: Revisiting the Sequence Constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204. Springer, Heidelberg (2006)
17. Walsh, T.: Sat v csp. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 441-456. Springer, Heidelberg (2000)