Propagation algorithms for lexicographic ordering constraints

Artificial Intelligence

Volumn 170, Issue 10, 2006, Pages 803-834

  Frisch, Alan M ^a   Hnich, Brahim ^b   Kiziltan, Zeynep ^c   Miguel, Ian ^d   Walsh, Toby ^e  

^a UNIVERSITY OF YORK   (United Kingdom)

^b IZMIR UNIVERSITY OF ECONOMICS   (Turkey)

^c UNIVERSITY OF BOLOGNA   (Italy)

^d UNIVERSITY OF ST ANDREWS   (United Kingdom)

^e CSIRO   (Australia)

Author keywords

Artificial intelligence; Constraint programming; Constraint propagation; Constraints; Generalized arc consistency; Lexicographic ordering; Matrix models; Symmetry; Symmetry breaking

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; DECISION THEORY; VECTORS;

CONSTRAINT PROGRAMMING; CONSTRAINT PROPAGATION; CONSTRAINTS; GENERALIZED ARC CONSISTENCY; LEXICOGRAPHIC ORDERING; MATRIX MODELS; SYMMETRY; SYMMETRY BREAKING;

CONSTRAINT THEORY;

EID: 33646812923     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2006.03.002     Document Type: Article

References (29)

1. M. Carlsson, N. Beldiceanu, Arc-consistency for a chain of lexicographic ordering constraints, Technical Report T2002-18, Swedish Institute of Computer Science, 2002
2. M. Carlsson, N. Beldiceanu, Revisiting the lexicographic ordering constraint, Technical Report T2002-17, Swedish Institute of Computer Science, 2002
3. Cheng B.M.W., Choi K.M.F., Lee J.H.M., and Wu J.C.K. Increasing constraint propagation by redundant modeling: An experience report. Constraints 4 (1999) 167-192
4. Colbourn C.H., and Dinitz J.H. The CRC Handbook of Combinatorial Designs (1996), CRC Press
5. J. Crawford, G. Luks, M. Ginsberg, A. Roy, Symmetry breaking predicates for search problems, in: Proceedings of the 5th International Conference on Knowledge Representation and Reasoning (KR '96), 1996, pp. 148-159
6. P. Brisset, H. El Sakkout, T. Frühwirth, C. Gervet, W. Harvey, M. Meier, S. Novello, T. Le Provost, J. Schimpf, K. Shen, M.G. Wallace, ECLiPSe Constraint Library Manual Release 5.6, 2003
7. Ehrgott M., and Gandibleux X. A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spektrum 22 (2000) 425-460
8. Flener P., Frisch A.M., Hnich B., Kiziltan Z., Miguel I., Pearson J., and Walsh T. Breaking row and column symmetry in matrix models. In: van Hentenryck P. (Ed). Proceedings of the 8th International Conference on Principles and Practice of Constraint programming (CP-02). Lecture Notes in Computer Science vol. 2470 (2002), Springer 462-476
9. P. Flener, A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, T. Walsh, Matrix modelling: Exploiting common patterns in constraint programming, in: Proceedings of the International Workshop on Reformulating Constraint Satisfaction Problems, 2002, pp. 27-41
10. Frisch A.M., Hnich B., Kiziltan Z., Miguel I., and Walsh T. Global constraints for lexicographic orderings. In: van Hentenryck P. (Ed). Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming (CP-02). Lecture Notes in Computer Science vol. 2470 (2002), Springer 93-108
11. Gent I.P., Irving R.W., Manlove D., Prosser P., and Smith B.M. A constraint programming approach to the stable marriage problem. In: Walsh T. (Ed). Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming (CP-01). Lecture Notes in Computer Science vol. 2239 (2001), Springer 462-476
12. I.P. Gent, P. Prosser, B.M. Smith, A 0/1 encoding of the gaclex constraint for pairs of vectors, in: Notes of the ECAI-02 Workshop W9 Modelling and Solving Problems with Constraints, 2002
13. I.P. Gent, T. Walsh, CSPLib: A benchmark library for constraints, Technical Report APES-09-1999, 1999
14. W. Harvey, Personal e-mail communication, 2002
15. B. Hnich, Function variables for constraint programming, PhD thesis, Department of Information Science, Uppsala University, 2003
16. ILOG S.A., ILOG Solver 5.3 Reference and User Manual, 2002
17. Z. Kiziltan, Symmetry breaking ordering constraints, PhD thesis, Uppsala University, 2004
18. Mackworth A.K. Consistency in networks of relations. Artificial Intelligence 8 (1977) 99-118
19. A.K. Mackworth. On reading sketch maps, in: Proceedings of the 5th International Joint Conference on Artificial Intelligence, 1977, pp. 598-606
20. Meseguer P., and Torras C. Solving strategies for highly symmetric CSPs. In: Dean T. (Ed). Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99) (1999), Morgan Kaufmann 400-405
21. Proll L., and Smith B.M. Integer linear programming and constraint programming approaches to a template design problem. INFORMS Journal on Computing 10 3 (1998) 265-275
22. Puget J.F. On the satisfiability of symmetrical constrained satisfaction problems. In: Komorowski H.J., and Ras Z.W. (Eds). Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems (ISMIS-93). Lecture Notes in Computer Science vol. 689 (1993), Springer 350-361
23. Schrijver A. Theory of Linear Integer Programming (1986), John Wiley and Sons
24. Smith B.M., Brailsford S.C., Hubbard P.M., and Williams H.P. The progressive party problem: Integer linear programming and constraint programming compared. Constraints 1 (1996) 119-138
25. Shlyakhter I. Generating effective symmetry-breaking predicates for search problems. Electronic Notes in Discrete Mathematics 9 (2001)
26. Swedish Institute of Computer Science, SICStus Prolog User's Manual, Release 3.10.1, April 2003
27. Wallace M. Practical applications of constraint programming. Constraints 1 1/2 (1996) 139-168
28. Walser J.P. Integer Optimization by Local Search-A Domain-Independent Approach. Lecture Notes in Artificial Intelligence vol. 1637 (1999), Springer
29. Wallace M.G., Novello S., and Schimpf J. ECLiPSe: A platform for constraint logic programming. ICL Systems Journal 12 1 (1997) 159-200