Abstract
When writing a constraint program, we have to decide what to make the decision variable, and how to represent the constraints on these variables. In many cases, there is considerable choice for the decision variables. For example, with permutation problems, we can choose between a primal and a dual representation. In the dual representation, dual variables stand for the primal values, whilst dual values stand for the primal variables. By means of channelling constraints, a combined model can have both primal and dual variables. In this paper, we perform an extensive theoretical and empirical study of these different models. Our results will aid constraint programmers to choose a model for a permutation problem. They also illustrate a general methodology for comparing different constraint models.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dimitris Achlioptas, Carla P. Gomes, Henry A. Kautz, and Bart Selman. Generating satisfiable problems instances. In Proc. of 17th National Conference on Artificial Intelligence, pages 256–261. 2000.
R. Bejar and F. Manya. Solving the round robin problem using propositional logic. In Proc. of 17th National Conference on Artificial Intelligence, pages 262–266. 2000.
C. Bessière, P. Meseguer, E.C. Freuder, and J. Larrosa. On forward checking for nonbinary constraint satisfaction. In Proc. of 5th Int. Conf. on Principles and Practice of Constraint Programming (CP99), pages 88–102. 1999.
B.M.W. Cheng, K.M.F. Choi, J.H.M. Lee, and J.C.K. Wu. Increasing constraint propagation by redundant modeling: an experience report. Constraints, 4:167–192,1999.
Xinguang Chen. A Theoretical Comparison of Selected CSP Solving and ModellingTechniques. PhD thesis, Dept. of Computing Science, University of Alberta, 2000.
R. Debruyne and C. Bessiére. Some practicable filtering techniques for the constraint satisfaction problem. In Proc. of the 15th IJCAI, pages 412–417. 1997.
I.P. Gent, K. Stergiou, and T. Walsh. Decomposable constraints. Artificial Intelligence,123(1–2):133–156, 2000.
P. Van Hentenryck, Y. Deville, and C. Teng. A Generic Arc Consistency Algorithm and its Specializations. Artificial Intelligence, 57:291–321, 1992.
P. Prosser, K. Stergiou, and T. Walsh. Singelton consistencies. In Proc of 6th Int.Conf. on Principles and Practices of Constraint Programming (CP-2000), pages 353–368. 2000.
J.C. Régin. A filtering algorithm for constraints of difference in CSPs. In Proc. of the 12th National Conference on AI, pages 362–367. 1994.
J.C. Régin and M. Rueher. A global constraint combining a sum constraint and difference constraints. In Proc. of 6th Int. Conf. on Principles and Practice of Constraint Programming (CP2000), pages 384–395. 2000.
B.M. Smith. Modelling a Permutation Problem. In Proc. of ECAI’2000 Workshop on Modelling and Solving Problems with Constraints, 2000.
K. Stergiou and T. Walsh. The difference all-difference makes. In Proceedings of 16th IJCAI. 1999.
T. Walsh. SAT v CSP. In Proc. of 6th Int. Conf. on Principles and Practices of Constraint Programming (CP-2000), pages 441–456. 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Walsh, T. (2001). Permutation Problems and Channelling Constraints. In: Nieuwenhuis, R., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2001. Lecture Notes in Computer Science(), vol 2250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45653-8_26
Download citation
DOI: https://doi.org/10.1007/3-540-45653-8_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42957-9
Online ISBN: 978-3-540-45653-7
eBook Packages: Springer Book Archive