Schedulers and Redundancy for a Class of Constraint Propagation Rules

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
25 pages, to appear in the journal "Theory and Practice of Logic Programming"

Keywords

Data Structures and Algorithms, Programming Languages, I.2.2; I.2.3; D.1.2; D.3.3; D.3.4

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32051

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0403037
 http://arxiv.org/abs/cs/0403037

Collections

arXiv