The complexity of global constraints

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 112-117

  Bessiere, Christian ^a   Hebrard, Emmanuel ^b   Hnich, Brahim ^b   Walsh, Toby ^a,b  

^a LIRMM   (France)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; DECISION MAKING; LEARNING SYSTEMS; PROBLEM SOLVING; TURNING;

CONSTRAINT PROGRAMMING; CONSTRAINT SATISFACTION PROBLEM (CSP); GENERALIZED ARC CONSISTENT (GAC); META-CONSTRAINTS;

COMPUTATIONAL COMPLEXITY;

EID: 9444292386     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Beldiceanu, N., and Carlsson, M. 2001. Revisiting the cardinality operator and introducing cardinality-path constraint family. In Proceedings ICLP'01, 59-73.
2. Beldiceanu, N., and Contegean, E. 1994. Introducing global constraints in CHIP. Mathematical Computer Modelling 20(12):97-123.
3. Beldiceanu, N. 2000. Global constraints as graph properties on a structured network of elementary constraints of the same type. In Proceedings CP'00, 52-66.
4. Beldiceanu, N. 2001. Pruning for the minimum constraint family and for the number of distinct values constraint family. In Proceedings CP'01, 211-224.
5. Bessiere, C., and Régin, J. 1997. Arc consistency for general constraint networks: preliminary results. In Proceedings IJCAI'97, 398-404.
6. Bessiere, C., and Van Hentenryck, P. 2003. To be or not to be ... a global constraint. In Proceedings CP'03, 789-794. Short paper.
7. Carlsson, M., and Beldiceanu, N. 2002. Arc-consistency for a chain of lexicographic ordering constraints. Technical report T2002-18, Swedish Institute of Computer Science. ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-T-2002-18- SE.ps.Z.
8. Caseau, Y., and Laburthe, F. 1997. Solving various weighted matching problems with constraints. In Proceedings CP'97, 17-31.
9. Crawford, J.; Luks, G.; Ginsberg, M.; and Roy, A. 1996. Symmetry breaking predicates for search problems. In Proceedings KR '96, 148-159.
10. Dechter, R. 1986. Learning while searching in constraint-satisfaction- problems. In Proceedings AAAI'86, 178-183.
11. Flener, P.; Frisch, A.; Hnich, B.; Kiziltan, Z.; Miguel, I.; Pearson, J.; and Walsh, T. 2002. Breaking row and column symmetries in matrix models. In Proceedings CP'02, 462-476.
12. Focacci, F.; Lodi, A.; and Milano, M. 2002. Optimization-oriented global constraints. Constraints 7:351-365.
13. Frisch, A.; Hnich, B.; Kiziltan, Z.; Miguel, I.; and Walsh, T. 2002. Global constraints for lexicographic orderings. In Proceedings CP'02.
14. Garey, M., and Johnson, D. 1979. Computers and Intractability: A Guide to NP-Completeness. San Francisco CA: Freeman.
15. Hnich, B.; Kiziltan, Z.; and Walsh, T. 2004. Combining symmetry breaking with other constraints: lexicographic ordering with sums. In Proceedings of the 8th International Symposium on the Artificial Intelligence and Mathematics.
16. Knuth, D., and Raghunathan, A. 1992. The problem of compatible representatives. SIAM Journal of Discrete Mathematics 5(3):422-427.
17. Mohr, R., and Masini, G. 1988. Good old discrete relaxation. In Proceedings ECAI'88, 651-656.
18. Pachet, F., and Roy, P. 1999. Automatic generation of music programs. In Proceedings CP'99, 331-345.
19. Papadimitriou, C., and Yannakakis, M. 1984. The complexity of facets (and some facets of complexity). J. Comput. System Sci. 28:244-259.
20. Régin, J., and Rueher, M. 2000. A global constraint combining a sum constraint and difference constraint. In Proceedings CP'00, 384-395.
21. Régin, J. 1994. A filtering algorithm for constraints of difference in CSPs. In Proceedings AAAI'94, 362-367.
22. Régin, J. 1996. Generalized arc consistency for global cardinality constraint. In Proceedings AAAI'96, 209-215.
23. Régin, J. 2002. Cost-based arc consistency for global cardinality constraints. Constraints 7:387-405.
24. Sadler, A., and Gervet, C. 2001. Global reasoning on sets. In Proceedings of Workshop on Modelling and Problem Formulation (FORMUL'01). held alongside CP-01.
25. Sellmann, M. 2003a. Approximated consistency for knapsack constraints. In Proceedings CP'03, 679-693.
26. Sellmann, M. 2003b. Cost-based filtering for shorter path constraints. In Proceedings CP'03, 694-708.
27. Van Hentenryck, P., and Deville, Y. 1991. The cardinality operator: a new logical connective for constraint logic programming. In Proceedings ICLP'91, 745-759.
28. Walsh, T. 2003a. Consistency and propagation with multi-set constraints: a formal viewpoint. In Proceedings CP'03, 724-738.
29. Walsh, T. 2003b. Constraint patterns. In Proceedings CP'03.