Abstract
We present a simple generic framework to solve constraints on any domain (finite or infinite) which has a lattice structure. The approach is based on the use of a single constraint similar to the indexicals used by CLP over finite domains and on a particular definition of an interval lattice built from the computation domain. We provide the theoretical foundations for this framework, a schematic procedure for the operational semantics, and numerous examples illustrating how it can be used both over classical and new domains. We also show how lattice combinators can be used to generate new domains and hence new constraint solvers for these domains from existing domains.
This work was partly supported by EPSRC grants GR/L19515 and GR/M05645 and by CICYT grant TIC98-0445-C03-03.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Apt, K.R.: From Chaotic Iteration to Constraint Propagation. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 36–55. Springer, Heidelberg (1997)
Ait-kaci, H.: Warren’s Abstract Machine: A Tutorial Reconstruction. The MIT Press, Cambridge (1991)
Bistarelli, S., Montanari, U., Rossi, F.: Semiring-Based Constraint Satisfaction and Optimization. Journal of the ACM 44(2), 201–236 (1997)
Codognet, P., Diaz, D.: Compiling Constraints in clp(FD). The Journal of Logic Programming 27, 185–226 (1996)
Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, England (1990)
Diaz, D., Codognet, P.: A minimal extension of the WAM for clp(FD). In: Proc. of the 10th International Conference on Logic Programming (ICLP 1993), pp. 774–790 (1993)
Frühwirth, T.: Theory and practice of constraint handling rules. The Journal of Logic Programming 37, 95–138 (1998)
Fernández, A.J., Hill, P.M.: A Design for a Generic Constraint Solver for Ordered Domains. In: Proc. of TCLP 1998:Types for Constraint Logic Programming, a JICSLP’98 Post Conference Workshop, Manchester (1998)
Sidebottom, G., Havens, W.S.: Hierarchical Arc Consistency for Disjoint Real Intervals in Constraint logic programming. Computational Intelligence 8(4) (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernández, A.J., Hill, P.M. (1999). An Interval Lattice-Based Constraint Solving Framework for Lattices. In: Middeldorp, A., Sato, T. (eds) Functional and Logic Programming. FLOPS 1999. Lecture Notes in Computer Science, vol 1722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10705424_13
Download citation
DOI: https://doi.org/10.1007/10705424_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66677-6
Online ISBN: 978-3-540-47950-5
eBook Packages: Springer Book Archive