Enhancing Constraint Propagation with Composition Operators

Details Enhancing Constraint Propagation with Composition Operators Enhancing Constraint Propagation with Composition Operators

2001-07-02

arxiv.org/abs/cs/0107002v1

Computer Science

Artificial Intelligence

14 pages

Scientific paper

Constraint propagation is a general algorithmic approach for pruning the search space of a CSP. In a uniform way, K. R. Apt has defined a computation as an iteration of reduction functions over a domain. He has also demonstrated the need for integrating static properties of reduction functions (commutativity and semi-commutativity) to design specialized algorithms such as AC3 and DAC. We introduce here a set of operators for modeling compositions of reduction functions. Two of the major goals are to tackle parallel computations, and dynamic behaviours (such as slow convergence).

Affiliated with

Also associated with

No associations

Rating

Enhancing Constraint Propagation with Composition Operators 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 Enhancing Constraint Propagation with Composition Operators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enhancing Constraint Propagation with Composition Operators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-286496