Schedulers for Rule-based Constraint Programming

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

8 pages. To appear in Proc. ACM Symposium on Applied Computing (SAC) 2003

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 for these rules a considerably better performance than their execution as standard CHR rules.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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

Rate now

     

Profile ID: LFWR-SCP-O-629810

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.