Schedulers for rule-based constraint programming

Authors:
Krzysztof R. Apt;Sebastian Brand
Affiliations:
University of Amsterdam, the Netherlands;CWI, 1090 GB Amsterdam, The Netherlands
Venue:
Proceedings of the 2003 ACM symposium on Applied computing
Year:
2003

Citing 6
Cited 0

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

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 [4]. We apply this study to so-called membership rules of Apt and Monfroy [5]. This leads to an implementation that yields for these rules a considerably better performance than their execution as standard CHR rules.