Some Remarks on Boolean Constraint Propagation

03/28/2000
by   Krzysztof R. Apt, et al.
0

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).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/08/1999

Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains

We study here constraint satisfaction problems that are based on predefi...
research
04/01/2022

Sequent calculi of finite dimension

In recent work, the authors introduced the notion of n-dimensional Boole...
research
04/11/2013

From Constraints to Resolution Rules, Part I: Conceptual Framework

Many real world problems naturally appear as constraints satisfaction pr...
research
09/14/2019

Propagation complete encodings of smooth DNNF theories

We investigate conjunctive normal form (CNF) encodings of a function rep...
research
02/10/2021

An unexpected Boolean connective

We consider a 2-valued non-deterministic connective ∧-5.5pt ∨ defined by...
research
11/13/1998

The Essence of Constraint Propagation

We show that several constraint propagation algorithms (also called (loc...
research
07/10/2020

Half-checking propagators

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

Please sign up or login with your details

Forgot password? Click here to reset