Abstract
Propagation based finite domain solvers provide a general mechanism for solving combinatorial problems. Different propagation methods can be used in conjunction by communicating through the domains of shared variables. The flexibility that this entails has been an important factor in the success of propagation based solving for solving hard combinatorial problems. In this paper we investigate how linear integer constraints should be represented in order that propagation can determine strong domain information. We identify two kinds of substitution which can improve propagation solvers, and can never weaken the domain information. This leads us to an alternate approach to propagation based solving where the form of constraints is modified by substitution as computation progresses. We compare and contrast a solver using substitution against an indexical based solver, the current method of choice for implementing propagation based constraint solvers, identifying the the relative advantages and disadvantages of the two approaches.
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
Philippe Codognet and Daniel Diaz. Compiling constraints in clp(FD). The Journal of Logic Programming, 27(3):185–226, 1996.
P. Cousot and R. Cousot. Automatic synthesis of optimal invariant assertions: Mathematical foundations. In ACM Symposium on Artificial Intelligence and Programming Languages, 1977.
Daniel Diaz and Phillipe Codognet. A minimal extension of the WAM for clp(FD). In David S. Warren, editor, Proceedings of the 10th International Conference on Logic Programming, pages 774–790. MIT Press, 1993.
Warwick Harvey and Peter J. Stuckey. Constraint representation for propagation. Computer Science Technical Report 98/10, The University of Melbourne, 1998. Available at http://www.cs.mu.oz.au/~pjs/papers/papers.html.
Joxan Jaffar, Spiro Michaylov, Peter Stuckey, and Roland Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339–395, July 1992.
J. H. M. Lee, H. F. Leung, and H. W. Won. Extending GENET for non-binary CSP’s. In Proceedings of the Seventh IEEE International Conference on Tools with Artificial Intelligence, pages 338–343. IEEE Computer Society Press, 1995.
Jonathan S. Ostroff. Temporal Logic for Real-Time Systems. Wiley, 1989.
Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. Logic Programming Series. MIT Press, Cambridge, MA, 1989.
Pascal Van Hentenryck, Vijay Saraswat, and Yves Deville. Constraint processing in cc(FD). manuscript, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Harvey, W., Stuckey, P.J. (1998). Constraint Representation for Propagation. In: Maher, M., Puget, JF. (eds) Principles and Practice of Constraint Programming — CP98. CP 1998. Lecture Notes in Computer Science, vol 1520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49481-2_18
Download citation
DOI: https://doi.org/10.1007/3-540-49481-2_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65224-3
Online ISBN: 978-3-540-49481-2
eBook Packages: Springer Book Archive