Value Constraints in the CLP Scheme |
| |
Authors: | M.H. van Emden |
| |
Affiliation: | (1) Department of Computer Science, University of Victoria, P.O. Box 3055, Victoria, B.C., V8W 3P6, Canada |
| |
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. |
| |
Keywords: | constraint logic programming CLP Waltz filtering constraint propagation arc consistency interval constraints chaotic iterations fixpoints |
本文献已被 SpringerLink 等数据库收录! |
|