Abstract
Constraint solving techniques are frequently based on constraint propagation, a technique that can be seen as a specific form of deduction. Using constraint programming languages enhanced with constraint handling rules facilities, constraint propagation can be achieved just by applying deduction rules to constraints. The automatic generation of propagation rules has been recently investigated in the particular case of finite domains, when constraint satisfaction problems are based on predefined, explicitly given constraints. Due to its interest for practical applications, several solvers have been developed during the last decade for integrating finite domains into (constraint) logic programming. A possible way of integration is implemented using a unification algorithm to compute most general solutions of constraints. In this paper, we propose a mixed approach for designing finite domain constraints solvers: it consists in using a solver based on unification to improve the generation of propagation rules.
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
K. R. Apt. A Proof Theoretic View of Constraint Programming. Fundamenta Informaticae, 34(3):295–321, June 1998.
K. R. Apt. The Essence of Constraint Propagation. Theoretical Computer Science, 221(1–2):179–210, 1999.
K. R. Apt and E. Monfroy. Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains. In Proc. of the 5th International Conference on Principles and Practice of Constraint Programming (CP’99), volume 1713 of Lecture Notes in Computer Science, pages 58–72. Springer-Verlag, 1999.
P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, and Ch. Ringeissen. An Overview of ELAN. In C. Kirchner and H. Kirchner, editors, Proc. Second Intl. Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Pont-á-Mousson (France), September 1998. Elsevier.
W. Büttner. Implementing complex domains of application in an extended prolog system. International Journal of General Systems, 15:129–139, 1989.
W. Büttner, K. Estenfeld, R. Schmid, H.-A. Schneider, and E. Tiden. Symbolic constraint handling through unification in finite algebras. Applicable Algebra in Engineering, Communication and Computation, 1(2):97–118, 1990.
W. Büttner and H. Simonis. Embedding boolean expressions into logic programming. Journal of Symbolic Computation, 4(2):191–205, 1987.
Y. Caseau and F. Laburthe. CLAIRE: Combining Objects and Rules for Problem Solving. In Proceedings of the JICSLP’96 Workshop on Multi-Paradigm Logic Programming, TU Berlin, Germany, 1996.
C. Castro. Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and Strategies. Fundamenta Informaticae, 34(3):263–293, June 1998.
H. Comon, M. Dincbas, J.-P. Jouannaud, and C. Kirchner. A methodological view of constraint solving. Constraints, 4(4):337–361, December 1999.
T. Frühwirth. Constraint handling rules. In Andreas Podelski, editor, Constraint Programming: Basics and Trends, volume 910 of Lecture Notes in Computer Science. Springer-Verlag, March 1995.
T. Frühwirth. Theory and Practice of Constraint Handling Rules. Journal of Logic Programming, 37(1–3):95–138, October 1998. Special Issue on Constraint Logic Programming (P. Stuckey and K. Marriot, Eds.).
C. Kirchner and Ch. Ringeissen. Rule-Based Constraint Programming. Fundamenta Informaticae, 34(3):225–262, June 1998.
H. Kirchner and Ch. Ringeissen. A constraint solver in finite algebras and its combination with unification algorithms. In K. Apt, editor, Proc. Joint International Conference and Symposium on Logic Programming, pages 225–239. The MIT press, 1992.
B. Liu, J. Jaffar, and H.C. Yap. Constraint rule-based programming, 1999. Available via http://www.iscs.nus.edu.sg/~joxan/papers/crp.ps.
A. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8(1):99–118, 1977.
Ch. Ringeissen. Etude et implantation d’un algorithme d’unification dans les algébres finies. Rapport de DEA, Université Henri Poincaré-Nancy 1, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ringeissen, C., Monfroy, E. (2000). Generating Propagation Rules for Finite Domains: A Mixed Approach. In: Apt, K.R., Monfroy, E., Kakas, A.C., Rossi, F. (eds) New Trends in Constraints. WC 1999. Lecture Notes in Computer Science(), vol 1865. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44654-0_8
Download citation
DOI: https://doi.org/10.1007/3-540-44654-0_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67885-4
Online ISBN: 978-3-540-44654-5
eBook Packages: Springer Book Archive