The Rough Guide to Constraint Propagation

09/08/1999
by   Krzysztof R. Apt, et al.
0

We provide here a simple, yet very general framework that allows us to explain several constraint propagation algorithms in a systematic way. In particular, using the notions commutativity and semi-commutativity, we show how the well-known AC-3, PC-2, DAC and DPC algorithms are instances of a single generic algorithm. The work reported here extends and simplifies that of Apt, cs.AI/9811024.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/13/1998

The Essence of Constraint Propagation

We show that several constraint propagation algorithms (also called (loc...
research
09/24/2009

The Weighted CFG Constraint

We introduce the weighted CFG constraint and propose a propagation algor...
research
09/22/2011

Exhaustive and Efficient Constraint Propagation: A Semi-Supervised Learning Perspective and Its Applications

This paper presents a novel pairwise constraint propagation approach by ...
research
03/28/2013

On the speed of constraint propagation and the time complexity of arc consistency testing

Establishing arc consistency on two relational structures is one of the ...
research
12/07/2015

Thinking Required

There exists a theory of a single general-purpose learning algorithm whi...
research
02/19/2015

Pairwise Constraint Propagation: A Survey

As one of the most important types of (weaker) supervised information in...
research
03/27/2013

A Constraint Propagation Approach to Probabilistic Reasoning

The paper demonstrates that strict adherence to probability theory does ...

Please sign up or login with your details

Forgot password? Click here to reset