The Essence of Constraint Propagation

11/13/1998
by   Krzysztof R. Apt, et al.
0

We show that several constraint propagation algorithms (also called (local) consistency, consistency enforcing, Waltz, filtering or narrowing algorithms) are instances of algorithms that deal with chaotic iteration. To this end we propose a simple abstract framework that allows us to classify and compare these algorithms and to establish in a uniform way their basic properties.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/08/1999

The Rough Guide to Constraint Propagation

We provide here a simple, yet very general framework that allows us to e...
research
06/18/2014

The Propagation Depth of Local Consistency

We establish optimal bounds on the number of nested propagation steps in...
research
06/03/2011

Domain Filtering Consistencies

Enforcing local consistencies is one of the main features of constraint ...
research
03/28/2000

Some Remarks on Boolean Constraint Propagation

We study here the well-known propagation rules for Boolean constraints. ...
research
08/18/2017

Exploring Directional Path-Consistency for Solving Constraint Networks

Among the local consistency techniques used for solving constraint netwo...
research
03/27/2013

A Constraint Propagation Approach to Probabilistic Reasoning

The paper demonstrates that strict adherence to probability theory does ...
research
10/10/2011

Consistency and Random Constraint Satisfaction Models

In this paper, we study the possibility of designing non-trivial random ...

Please sign up or login with your details

Forgot password? Click here to reset