Abstract
We define value constraints, a method for incorporating constraint propagation into logic programming. It is a subscheme of the CLP scheme and is applicable wherever one has an efficient method for representing sets of possible values. As examples we present: small finite sets, sets of ground instances of a term, and intervals of reals with floating-point numbers as bounds. Value constraints are defined by distinguishing two storage management strategies in the CLP scheme. In value constraints the infer step of the CLP scheme is implemented by Waltz filtering. We give a semantics for value constraints in terms of set algebra that gives algebraic characterizations of local and global consistency. The existing extremal fixpoint characterization of chaotic iteration is shown to be applicable to prove convergence of Waltz filtering.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Benhamou, D. McAllester & P. Van Hentenryck. (1994). CLP(Intervals) revisited. In Logic Programming: Proc. 1994 International Symposium, pp. 124–138.
BNR. (1988). BNR Prolog user guide and reference manual.
F. Benhamou & W.J. Older. (1994). Applying interval arithmetic to real, integer, and Boolean constraints. Journal of Logic Programming. Technical report 1994; forthcoming 1997.
B. Botella & P. Taillibert. (1993). INTERLOG: constraint logic programming on numeric intervals. In Third International Workshop on Software Engineering, Artificial Intelligence, and Expert Systems, Oberammergau.
C.K. Chiu & J.H.M. Lee. (1994). Towards practical interval constraint solving in logic programming. In Logic Programming: Proceedings of the 1994 International Symposium, pp. 109–123, Ithaca, USA.
A. Colmerauer. (1996). Les bases de Prolog IV. Technical report, PrologIA, Marseilles, France, Chapter 2 of “Le Manuel de Prolog IV”.
H.M. Chen & M.H. van Emden. (In preparation). Interval constraints for unconstrained global optimization. In preparation.
E. Davis. (1987). Constraint propagation with labels. Artificial Intelligence, 32: 281–331.
M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf & F. Berthier. (1988). The constraint program-ming language CHIP. In Proc. Int. Conf. on Fifth Generation Computer Systems.
C.C. Green. (1969). The application of theorem-proving to question-answering systems. Technical Report 8, Artificial Intelligence Group, Stanford Research Institute.
E. Hansen. (1992). Global Optimization Using Interval Analysis. Marcel Dekker.
P.J. Hayes. (1973). Computation as deduction. In Proc. Second MFCS Symposium, pp. 105–118. Czechoslovak Academy of Sciences.
T.J. Hickey. (1994). CLP(F) and constrained ODE's. In Jean Jourdain, Pierre Lim, and Roland H.C. Yap, editors, Workshop on Constraint Languages and their Use in Problem Modelling, pp. 69–79, Ithaca, New York.
H. Hong. (1993). RISC-CLP(Real): Logic programming with non-linear constraints over the reals.
J. Jaffar & M.J. Maher. (1994). Constraint logic programming: A survey. Journal of Logic Programming, 19/20: 503–582.
O. Lhomme. (1993). Consistency techniques for numeric CSPs. In Proceedings of the 13th International Joint Conference on Artificial Intelligence.
J.H.M. Lee & T.W. Lee. (1994). A WAM-based abstract machine for interval constraint logic programming. In Proceedings of the Sixth IEEE International Conference on Tools with Artificial Intelligence, pp. 122–128, New Orleans, USA.
J-L. Lassez & M.J. Maher. (1984). Closures and fairness in the semantics of programming logic. Theoretical Computer Science, 29: 167–184.
J-L. Lassez, M.J. Maher & K. Marriott. (1988). Unification revisited. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, pp. 587–625. Morgan Kaufmann.
A.K. Mackworth. (1977). Consistency in networks of relations. Artificial Intelligence, 8: 99–118.
R.E. Moore. (1966). Interval Analysis. Prentice-Hall.
U. Montanari & F. Rossi. (1991). Constraint relaxation may be perfect. Artificial Intelligence, 48: 143–170.
W.J. Older. (1994). Application of relational interval arithmetic to ordinary differential equations. In Jean Jourdain, Pierre Lim, and Roland H.C. Yap, editors, Workshop on Constraint Languages and their Use in Problem Modelling, pp. 60–69, Ithaca, New York.
W.J. Older & A. Vellino. (1990). Extending Prolog with constraint arithmetics on real intervals. In Proceedings of the Canadian Conference on Computer & Electrical Engineering, Ottawa, Canada.
W.J. Older & A. Vellino. (1993). Constraint arithmetic on real intervals. In Fr´ed´eric Benhamou and Alain Colmerauer, editors, Constraint Logic Programming, pp. 175–195. MIT Press.
A.L. Semenov. (1996). Solving optimization problems with help of the Unicalc solver. In R. Baker Kearfott and Vladik Kreinovich, editors, Application of Interval Computations, pp. 211–224. Kluwer Academic Publishers.
B. Stroustrup. (1994). The Design and Evolution of C++. Addison-Wesley.
V. Telerman & D. Ushakov. (1996). Subdefinite models as a variety of constraint programming. In Proc. 8 th Int. Conf. on Tools for Artificial Intelligence, pp. 157–163. IEEE Computer Society.
J.D. Ullman. (1988). Principles of Database and Knowledge-Base Systems. Computer Science Press.
D. Waltz. (1975). Understanding line drawings in scenes with shadows. In Patrick Henry Winston, editor, The Psychology of Computer Vision, pp. 19–91. McGraw-Hill.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
van Emden, M. Value Constraints in the CLP Scheme. Constraints 2, 163–183 (1997). https://doi.org/10.1023/A:1009705709733
Issue Date:
DOI: https://doi.org/10.1023/A:1009705709733