Optimization of simple tabular reduction for table constraints

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

Volumn 5202 LNCS, Issue , 2008, Pages 128-143

  Lecoutre, Christophe ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARC CONSISTENCIES; CONSTRAINT PROGRAMMINGS; OPTIMIZED ALGORITHMS; VALIDITY CHECKING;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPTIMIZATION; TIMING CIRCUITS;

CONSTRAINED OPTIMIZATION;

EID: 56449107529     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85958-1_9     Document Type: Conference Paper

References (20)

1. Beacham, A., Chen, X., Sillito, J., van Beek, P.: Constraint programming lessons learned from crossword puzzles. In: Proceedings of Canadian Conference on AI, pp. 78-87 (2001)
2. Bessiere, C.: Constraint propagation. In: Handbook of Constraint Programming (2006)
3. Bessiere, C., Debruyne, R.: Optimal and suboptimal singleton arc consistency algorithms. In: Proceedings of UCAI2005, pp. 54-59 (2005)
4. Bessiere. C., Hebrard, E., Hnich, B., Walsh. T.: The complexity of reasoning with global constraints. Constraints 12(2), 239-259 (2007)
5. Bessiere, C., Régin, J.: Arc consistency for general constraint networks: preliminary results. In: Proceedings of UCAI 1997, pp. 398-404 (1997)
6. Carlsson, M.: Filtering for the case constraint. Talk given at Advanced School on Global constraints. Samos, Greece (2006)
7. Cheng, K., Yap, R.: Maintaining generalized arc consistency on ad-hoc n-ary Boolean constraints. In: Proceedings of ECAI 2006. pp. 78-82 (2006)
8. Gent, I.P., Jefferson, C., Miguel, I., Nightingale, P.: Data structures for generalised arc consistency for extensional constraints. In: Proceedings of AAAI 2007, pp. 191-197 (2007)
9. Van Hentenryck, P., Deville, Y., Teng, C.M.: A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57, 291-321 (1992)
10. Katsirelos, G., Walsh, T.: A compression algorithm for large arity extensional constraints. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 379-393. Springer, Heidelberg (2007)
11. Lecoutre, C., Cardon, S.: A greedy approach to establish singleton arc consistency. In: Proceedings of UCAI 2005, pp. 199-204 (2005)
12. Lecoutre, C., Cardon, S., Vion, L: Conservative dual consistency. In: Proceedings of AAAI 2007, pp. 237-242 (2007)
13. Lecoutre, C., Szymanek, R.: Generalized arc consistency for positive table constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 284-298. Springer, Heidelberg (2006)
14. Lhomme, O.: Arc-consistency filtering algorithms for logical combinations of constraints. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 209-224. Springer, Heidelberg (2004)
15. Lhomme, O., Régin, J.C.: A fast arc consistency algorithm forn-ary constraints. In: Proceedings of AAAI 2005, pp. 405-410 (2005)
16. Samaras, N., Stergiou, K.: Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results. JAIR 24, 641-684 (2005)
17. Ullmann, J.R.: A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words. Computer Journal 20(2). 141-147 (1977)
18. Ullmann, J.R.: Partition search for non-binary constraint satisfaction. Information Science 177, 3639-3678 (2007)
19. van Dongen, M.R.C.: Beyond singleton arc consistency. In: ECAI2006, pp. 163-167 (2006)
20. Xu, K., Boussemart, F., Hemery, F., Lecoutre, C.: Random constraint satisfaction: easy generation of hard (satisfiable) instances. Artificial Intelligence 171(8-9), 514-534 (2007)