STR2: Optimized simple tabular reduction for table constraints

Constraints

Volumn 16, Issue 4, 2011, Pages 341-371

  Lecoutre, Christophe ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

Extensional constraints; Generalized arc consistency (GAC); Table constraints

Indexed keywords

CONSTRAINT PROGRAMMING; EXTENSIONAL CONSTRAINTS; GENERALIZED ARC CONSISTENCIES; HIDDEN VARIABLE; MULTI-VALUED DECISION DIAGRAMS; TABLE CONSTRAINTS;

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

OPTIMIZATION;

EID: 80052968556     PISSN: 13837133     EISSN: 15729354     Source Type: Journal    
DOI: 10.1007/s10601-011-9107-6     Document Type: Article

References (45)

1. Beacham, A., Chen, X., Sillito, J., & van Beek, P. (2001). Constraint programming lessons learned from crossword puzzles. In Proceedings of Canadian conference on AI (pp. 78-87). (Pubitemid 33276089)
2. Bessiere, C. (2006). Constraint propagation. In Handbook of constraint programming (chapter 3). Elsevier.
3. Bessiere, C., & Debruyne, R. (2005). Optimal and suboptimal singleton arc consistency algorithms. In Proceedings of IJCAI'05 (pp. 54-59).
4. C Bessiere E Hebrard B Hnich T Walsh 2007 The complexity of reasoning with global constraints Constraints 12 2 239 259 2321287 1124.68103 10.1007/s10601-006-9007-3 (Pubitemid 46752061)
5. Bessiere, C., & Régin, J. (1996). MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In Proceedings of CP'96 (pp. 61-75). (Pubitemid 126117694)
6. Bessiere, C., & Régin, J. (1997). Arc consistency for general constraint networks: Preliminary results. In Proceedings of IJCAI'97 (pp. 398-404).
7. C Bessiere JC Régin R Yap Y Zhang 2005 An optimal coarse-grained arc consistency algorithm Artificial Intelligence 165 2 165 185 2150212 1132.68691 10.1016/j.artint.2005.02.004 (Pubitemid 40701743)
8. Boussemart, F., Hemery, F., Lecoutre, C., & Sais, L. (2004). Boosting systematic search by weighting constraints. In Proceedings of ECAI'04 (pp. 146-150).
9. P Briggs L Torczon 1993 An efficient representation for sparse sets ACM Letters on Programming Languages and Systems 2 1-4 59 69 10.1145/176454.176484
10. Carlsson, M. (2006). Filtering for the case constraint. Talk given at the advanced school on global constraints.
11. Cheng, K., & Yap, R. (2006). Maintaining generalized arc consistency on ad-hoc n-ary Boolean constraints. In Proceedings of ECAI'06 (pp. 78-82).
12. Cheng, K., & Yap, R. (2008). Maintaining generalized arc consistency on ad-hoc r-ary constraints. In Proceedings of CP'08 (pp. 509-523).
13. K Cheng R Yap 2010 An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints Constraints 15 2 265 304 2601999 1204.68188 10.1007/s10601-009-9087-y
14. Dechter, R. (2003). Constraint processing. Morgan Kaufmann.
15. R Dechter J Pearl 1989 Tree clustering for constraint networks Artificial Intelligence 38 3 353 366 988482 0665.68084 10.1016/0004-3702(89)90037-4
16. E Fredkin 1960 Trie memory Communications of the ACM 3 9 490 499 10.1145/367390.367400
17. Gent, I. P., Jefferson, C., Miguel, I., & Nightingale, P. (2007). Data structures for generalised arc consistency for extensional constraints. In Proceedings of AAAI'07 (pp. 191-197). (Pubitemid 350149573)
18. ML Ginsberg 1993 Dynamic backtracking Journal of Artificial Intelligence Research 1 25 46 0900.68179
19. Ginsberg, M. L., Frank, M., Halpin, M. P., & Torrance, M. C. (1990). Search lessons learned from crossword puzzles. In Proceedings of AAAI'90 (pp. 210-215).
20. M Gyssens P Jeavons DA Cohen 1994 Decomposing constraint satisfaction problems using database techniques Artificial Intelligence 66 1 57 89 1267805 0803.68090 10.1016/0004-3702(94)90003-5
21. RM Haralick GL Elliott 1980 Increasing tree search efficiency for constraint satisfaction problems Artificial Intelligence 14 263 313 10.1016/0004-3702(80)90051-X (Pubitemid 12514962)
22. J Jaffar S Michaylov P Stuckey R Yap 1992 The CLP(R) language and system ACM Transactions on Programming Languages and Systems 14 3 339 395 10.1145/129393.129398 (Pubitemid 23610414)
23. Katsirelos, G., & Walsh, T. (2007). A compression algorithm for large arity extensional constraints. In Proceedings of CP'07 (pp. 379-393).
24. Lecoutre, C. (2008). Optimization of simple tabular reduction for table constraints. In Proceedings of CP'08 (pp. 128-143).
25. Lecoutre, C., & Cardon, S. (2005). A greedy approach to establish singleton arc consistency. In Proceedings of IJCAI'05 (pp. 199-204).
26. Lecoutre, C., Cardon, S., & Vion, J. (2007). Conservative dual consistency. In Proceedings of AAAI'07 (pp. 237-242). (Pubitemid 350149580)
27. Lecoutre, C., & Hemery, F. (2007). A study of residual supports in arc consistency. In Proceedings of IJCAI'07 (pp. 125-130).
28. Lecoutre, C., & Szymanek, R. (2006). Generalized arc consistency for positive table constraints. In Proceedings of CP'06 (pp. 284-298). (Pubitemid 44618746)
29. C Lecoutre J Vion 2008 Enforcing arc consistency using bitwise operations Constraint Programming Letters 2 21 35
30. Lhomme, O., & Régin, J. C. (2005). A fast arc consistency algorithm for n-ary constraints. In Proceedings of AAAI'05 (pp. 405-410). (Pubitemid 43006809)
31. Likitvivatanavong, C., Zhang, Y., Bowen, J., & Freuder, E. C. (2004). Arc consistency in MAC: A new perspective. In Proceedings of CPAI'04 workshop held with CP'04 (pp. 93-107).
32. AK Mackworth 1977 Consistency in networks of relations Artificial Intelligence 8 1 99 118 1192394 0341.68061 10.1016/0004-3702(77)90007-8
33. Mackworth, A. K. (1977). On reading sketch maps. In Proceedings of IJCAI'77 (pp. 598-606).
34. Mohr, R., & Masini, G. (1988). Good old discrete relaxation. In Proceedings of ECAI'88 (pp. 651-656).
35. Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. In Proceedings of CP'04 (pp. 482-495).
36. Rossi, F., Petrie, C., & Dhar, V. (1990). On the equivalence of constraint satisfaction problems. In Proceedings of ECAI'90 (pp. 550-556).
37. Sabin, D., & Freuder, E. C. (1994). Contradicting conventional wisdom in constraint satisfaction. In Proceedings of CP'94 (pp. 10-20).
38. N Samaras K Stergiou 2005 Binary encodings of non-binary constraint satisfaction problems: Algorithms and experimental results Journal of Artificial Intelligence Research 24 641 684 2200527 1080.68673 (Pubitemid 43130947)
39. Stergiou, K., & Walsh, T. (1999). Encodings of non-binary constraint satisfaction problems. In Proceedings of AAAI'99 (pp. 163-168).
40. JR Ullmann 1977 A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words Computer Journal 20 2 141 147 0359.68121 10.1093/comjnl/20.2.141
41. JR Ullmann 2007 Partition search for non-binary constraint satisfaction Information Science 177 3639 3678 2337212 1119.68446 10.1016/j.ins.2007.03.030 (Pubitemid 46961983)
42. van Dongen, M. R. C. (2006). Beyond singleton arc consistency. In Proceedings of ECAI'06 (pp. 163-167).
43. P van Hentenryck V Ramachandran 1995 Backtracking without trailing in CLP(R-lin) ACM Transactions on Programming Languages and Systems 17 4 635 671 10.1145/210184.210192
44. Xu, K., Boussemart, F., Hemery, F., & Lecoutre, C. (2005). A simple model to generate hard satisfiable instances. In Proceedings of IJCAI'05 (pp. 337-342).
45. K Xu F Boussemart F Hemery C Lecoutre 2007 Random constraint satisfaction: Easy generation of hard (satisfiable) instances Artificial Intelligence 171 8-9 514 534 2333552 1168.68554 10.1016/j.artint.2007.04.001 (Pubitemid 46828981)