Some Remarks on Boolean Constraint Propagation

Details Some Remarks on Boolean Constraint Propagation Some Remarks on Boolean Constraint Propagation

2000-03-28

arxiv.org/abs/cs/0003080v1

Computer Science

Artificial Intelligence

14 pages. To appear in: New Trends in Constraints, Papers from the Joint ERCIM/Compulog-Net Workshop Cyprus, October 25-27, 19

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Some Remarks on Boolean Constraint Propagation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some Remarks on Boolean Constraint Propagation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some Remarks on Boolean Constraint Propagation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-198954