Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-19T08:05:22.181Z Has data issue: false hasContentIssue false
  • English
  • Français

Schedulers and redundancy for a class of constraint propagation rules

Published online by Cambridge University Press:  01 July 2005

SEBASTIAN BRAND  and
KRZYSZTOF R. APT
SEBASTIAN BRAND
Affiliation:
CWI, P.O. Box 94079, 1090 G-B Amsterdam, The Netherlands (e-mail: [email protected])
KRZYSZTOF R. APT
Affiliation:
National University of Singapore (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Keywords

constraint programmingrule-based programmingconstraint propagation
Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 5 , Issue 4-5 , July 2005 , pp. 441 - 465
Copyright
© 2005 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)