Abstract
Capturing constraint structure is critical in Constraint Programming to support the configuration and adaptation of domain filtering algorithms. To this end, we propose a software model coupling a relational constraint language, a constraint type inference system, and an algorithm configuration system. The relational language allows for expressing constraints from primitive constraints; the type system infers the type of constraint expressions out of primitive constraint types; and the configuration system synthesises algorithms out of primitive routines using constraint types. In this paper, we focus on the issue of constraint type inferencing, and present a method to implement sound and extendible inference systems.
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
Bessière C, “Arc-consistency and arc-consistency again”, Artificial Intelligence, Vol. 65, pp. 179–190, 1994.
Bessière C, E.C. Freuder, and J.C. Regin, “Using inference to reduce arc consistency computation”, in Proc. of 14th Int. Joint Conf. on AI, Montreal, pp. 592–598, 1995.
Bessière C, E.C. Freuder, and J.C. Regin, “Using constraint metaknowledge to reduce arc-consistency computation”, Artificial Intelligence, Vol. 107, pp. 125–148, 1999.
Jeavons P.G., and M.C. Cooper, “Tractable constraints on ordered domains”, Artificial Intelligence, Vol. 79, No. 2, pp. 327–339, 1995.
Jonsson B., “The Theory of Binary Relations“, Colloq. Math. Soc. Janos Bolyai, Budapest, Hungary, Algebraic Logic (North Holland), Vol. 54, pp. 245–292, 1988.
Laburthe F., “Choco: implementing a CP kernel”, Workshop on Techniques for Implementing Constraint programming Systems (TRICS-2000), 6th Int. Conf. on Principles and Practice of Constraint Programming (CP-2000), Singapore, 2000.
Puget J.F., and M. Leconte, “Beyond the glass box: constraints as objects”, in Proc. of International Logic Programming Symposium (ILPS’95), Portland, pp. 513–527, 1995.
Savean P., “Constraint Reduction at the Type Level”, Workshop TRICS-2000, 6th Int. Conf. on Principles and Practice of Constraint Programming (CP-2000), Singapore, 2000.
Van Beek P., “On the minimality and decomposability of constraint networks”, in Proc. of 10th National Conference on Artificial Intelligence (AAAI-92), pp. 447–452, 1992.
Van Hentenryck P., Y. Deville, and C. Teng, “A generic arc-consistency algorithm and its specializations”, Artificial Intelligence, Vol. 57, pp. 291–321, 1992.
Voudouris C, R. Dome, D. Lesaint, and A. Liret, “iOpt: a software toolkit for Heuristic Search methods”, in Proc. of 7th Int. Conf. on Principles and Practice of Constraint Programming (CP-2001), Paphos, Cyprus, pp. 716–719, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lesaint, D. (2002). Inferring Constraint Types in Constraint Programming. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_33
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive