Abstract
Constraint propagation can sometimes be described conveniently in a rule-based way. Propagation is then fixpoint computation with rules. In the typical case when no specific strategy guides the fixpoint computation, it is preferable to have a minimal set of rules. We propose a natural criterion for redundancy of a rule, and describe a test for a class of rules. Its relevance is demonstrated by applying it to several rule sets from two important approaches to automatic rule generation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Slim Abdennadher and Thom Frühwirth. Using program analysis for integration and optimization of rule-based constraint solvers. In Onzièmes Journées Francophones de Programmation Logique et Programmation par Contraintes (JF-PLC’2002), May 2002.
Slim Abdennadher and Christophe Rigotti. Automatic generation of propagation rules for finite domains. In Principles and Practice of Constraint Programming (CP 2000), Singapore, 2000.
Slim Abdennadher and Christophe Rigotti. Towards inductive constraint solving. Lecture Notes in Computer Science, 2239, 2001.
Krzysztof R. Apt. The essence of constraint propagation. Theoretical Computer Science, 221(1–2):179–210, June 1999.
Krzysztof R. Apt and Eric Monfroy. Constraint programming viewed as rule-based programming. Theory and Practice of Logic Programming, 2001.
Björn Carlson, Mats Carlsson, and Sverker Janson. The implementation of AKL(FD). In International Symposium on Logic Programming, 1995.
Philippe Codognet and Daniel Diaz. Compiling constraints in clp(FD). Journal of Logic Programming, 27(3):185–226, June 1996.
IC-Parc. ECLiPSe. http://www.icparc.ic.ac.uk/eclipse/.
Th. Frühwirth. Theory and practice of constraint handling rules. Journal of Logic Programming, pages 95–138, October 1998.
Claude Kirchner and Christophe Ringeissen. Rule-based constraint programming. Fundamenta Informaticae, 34(3):225–262, 1998.
C. Ringeissen and E. Monfroy. Generating propagation rules for finite domains via unification in finite algebras. In New Trends in Constraints, 2000.
Vijay Anand Saraswat. Concurrent Constraint Programming. MIT Press, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brand, S. (2003). A Note on Redundant Rules in Rule-Based Constraint Programming. In: O’Sullivan, B. (eds) Recent Advances in Constraints. CologNet 2002. Lecture Notes in Computer Science, vol 2627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36607-5_8
Download citation
DOI: https://doi.org/10.1007/3-540-36607-5_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00986-3
Online ISBN: 978-3-540-36607-2
eBook Packages: Springer Book Archive