DeepAI AI Chat
Log In Sign Up

Some Remarks on Boolean Constraint Propagation

by   Krzysztof R. Apt, et al.

We study here the well-known propagation rules for Boolean constraints. First we propose a simple notion of completeness for sets of such rules and establish a completeness result. Then we show an equivalence in an appropriate sense between Boolean constraint propagation and unit propagation, a form of resolution for propositional logic. Subsequently we characterize one set of such rules by means of the notion of hyper-arc consistency introduced in (Mohr and Masini 1988). Also, we clarify the status of a similar, though different, set of rules introduced in (Simonis 1989a) and more fully in (Codognet and Diaz 1996).


page 1

page 2

page 3

page 4


Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains

We study here constraint satisfaction problems that are based on predefi...

Sequent calculi of finite dimension

In recent work, the authors introduced the notion of n-dimensional Boole...

From Constraints to Resolution Rules, Part I: Conceptual Framework

Many real world problems naturally appear as constraints satisfaction pr...

Propagation complete encodings of smooth DNNF theories

We investigate conjunctive normal form (CNF) encodings of a function rep...

An unexpected Boolean connective

We consider a 2-valued non-deterministic connective ∧-5.5pt ∨ defined by...

The Essence of Constraint Propagation

We show that several constraint propagation algorithms (also called (loc...

Half-checking propagators

Propagators are central to the success of constraint programming, that i...