Schedulers and Redundancy for a Class of Constraint Propagation Rules

Details Schedulers and Redundancy for a Class of Constraint Propagation Rules Schedulers and Redundancy for a Class of Constraint Propagation Rules

2004-03-23

arxiv.org/abs/cs/0403037v3

Computer Science

Data Structures and Algorithms

25 pages, to appear in the journal "Theory and Practice of Logic Programming"

Scientific paper

We study here schedulers for a class of rules that naturally arise in the context of rule-based constraint programming. We systematically derive a scheduler for them from a generic iteration algorithm of [Apt 2000]. We apply this study to so-called membership rules of [Apt and Monfroy 2001]. This leads to an implementation that yields a considerably better performance for these rules than their execution as standard CHR rules. Finally, we show how redundant rules can be identified and how appropriately reduced sets of rules can be computed.

Affiliated with

Also associated with

No associations

Rating

Schedulers and Redundancy for a Class of Constraint Propagation Rules 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 Schedulers and Redundancy for a Class of Constraint Propagation Rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Schedulers and Redundancy for a Class of Constraint Propagation Rules will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-678571