Schedulers and redundancy for a class of constraint propagation rules

Authors:
Sebastian Brand;Krzysztof R. Apt
Affiliations:
CWI, P.O. Box 94079, 1090 G-B Amsterdam, The Netherlands (e-mail: sebastian.brand@cwi.nl);National University of Singapore (e-mail: apt@comp.nus.edu.sg)
Venue:
Theory and Practice of Logic Programming
Year:
2005

Citing 6
Cited 1

The essence of constraint propagation

Theoretical Computer Science
The role of commutativity in constraint propagation algorithms

ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimizing Compilation of Constraint Handling Rules

Proceedings of the 17th International Conference on Logic Programming
Reasoning about Binary Topological Relations

SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
Using confluence to generate rule-based constraint solvers

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Constraint programming viewed as rule-based programming

Theory and Practice of Logic Programming

Explaining constraint programming

Processes, Terms and Cycles

Quantified Score

Hi-index	0.00

Visualization

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.