Declarative Modelling of Constraint Propagation Strategies

Authors:
Laurent Granvilliers;Eric Monfroy
Affiliations:
-;-
Venue:
ADVIS '00 Proceedings of the First International Conference on Advances in Information Systems
Year:
2000

Citing 13
Cited 0

A bridging model for parallel computation

Communications of the ACM
CLP(intervals) revisited

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Solving Polynomial Systems Using a Branch and Prune Approach

SIAM Journal on Numerical Analysis
Chaotic iteration for distributed constraint propagation

Proceedings of the 1999 ACM symposium on Applied computing
Using “weaker” functions for constraint propagation over real numbers

Proceedings of the 1999 ACM symposium on Applied computing
The essence of constraint propagation

Theoretical Computer Science
A coordination-based chaotic iteration algorithm for constraint propagation

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Revising hull and box consistency

Proceedings of the 1999 international conference on Logic programming
A conservative scheme for parallel interval narrowing

Information Processing Letters
Towards Cooperative Interval Narrowing

FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
Heterogeneous Constraint Solving

ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Box Consistency through Weak Box Consistency

ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Consistency techniques for numeric CSPs

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1

Quantified Score

Hi-index	0.01

Visualization

Abstract

Constraint propagation is a generic method for combining monotone operators over lattices. In this paper, a family of constraint propagation strategies are designed as instances of a single algorithm shown to be correct, finite, and strategy-independent. The main idea is to separate complex reasoning processes (that exploit some knowledge of constraints and solvers in order to accelerate the convergence) from basic fixed-point algorithms. Some sequential interval narrowing strategies are expressed in this framework and parallel implementations in different execution models are discussed.