Abstract
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP) and a generic solver finds a solution without additional programming. However, in practice, the situation is more complicated because there usually exist several ways how to model the problem as a CSP, that is using variables, their domains, and constraints. In fact, different constraint models may lead to significantly different running times of the solver so constraint modeling is a crucial part of problem solving. This paper describes some known approaches to efficient modeling with constraints in a tutorial-like form. The primary audience is practitioners, especially in logic programming, that would like to use constraints in their projects but do not have yet deep knowledge of constraint satisfaction techniques.
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
Baptiste, P., Le Pape, C.: Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. In: Proceedings of the Fifteenth Workshop of the U.K. Planning Special Interest Group (1996)
Barták, R.: On-line Guide to Constraint Programming, Prague (1998), http://kti.mff.cuni.cz/~bartak/constraints/
Carlsson, M., Ottosson, G., Carlsson, B.: An Open-Ended Finite Domain Constraint Solver. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol. 1292. Springer, Heidelberg (1997)
Freuder, E.C.: In Pursuit of the Holy Grail. Constraints: An International Journal 2, 57–61 (1997)
Golomb rulers: some results (2003), http://www.research.ibm.com/people/s/shearer/grtab.html
Kumar, V.: Algorithms for Constraint Satisfaction Problems: A Survey. AI Magazine 13(1), 32–44 (1992)
Mariot, K., Stuckey, P.J.: Programming with Constraints: An Introduction. The MIT Press, Cambridge (1998)
Régin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of 12th National Conference on Artificial Intelligence (1994)
SICStus Prolog 3.11.2 User’s Manual
Smith, B.: Reducing Symmetry in a Combinatorial Design Problem. In: Proceedings of CP-AI-OR 2001, pp. 351–359. Wye College, UK (2001)
Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barták, R. (2005). Effective Modeling with Constraints. In: Seipel, D., Hanus, M., Geske, U., Bartenstein, O. (eds) Applications of Declarative Programming and Knowledge Management. INAP WLP 2004 2004. Lecture Notes in Computer Science(), vol 3392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11415763_10
Download citation
DOI: https://doi.org/10.1007/11415763_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25560-4
Online ISBN: 978-3-540-32124-8
eBook Packages: Computer ScienceComputer Science (R0)