Value Constraints in the CLP Scheme

Authors:
M. H. van Emden
Affiliations:
Department of Computer Science, University of Victoria, P.O. Box 3055, Victoria, B.C., V8W 3P6, Canada http://www-csc.uvic.ca/home/vanemden/vanemden.html
Venue:
Constraints
Year:
1997

Citing 9
Cited 3

Constraint propagation with interval labels

Artificial Intelligence
Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Unification revisited

Foundations of deductive databases and logic programming
Constraint relaxation may be perfect

Artificial Intelligence
Constraint arithmetic on real intervals

Constraint logic programming
The design and evolution of C++

The design and evolution of C++
Towards practical interval constraint solving in logic programming

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
CLP(intervals) revisited

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Subdefinite Models as a Variety of Constraint Programming

ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence

Algorithmic Power from Declarative Use of Redundant Constraints

Constraints
A Unified Framework for Interval Constraints and Interval Arithmetic

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
A Proof Theoretic View of Constraint Programming

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define value constraints, a method for incorporatingconstraint propagation into logic programming. It is a subschemeof the CLP scheme and is applicable wherever one has an efficientmethod for representing sets of possible values. As exampleswe present: small finite sets, sets of ground instances of aterm, and intervals of reals with floating-point numbers as bounds.Value constraints are defined by distinguishing two storage managementstrategies in the CLP scheme. In value constraints the inferstep of the CLP scheme is implemented by Waltz filtering. Wegive a semantics for value constraints in terms of set algebrathat gives algebraic characterizations of local and global consistency.The existing extremal fixpoint characterization of chaotic iterationis shown to be applicable to prove convergence of Waltz filtering.