A note on redundant rules in rule-based constraint programming

Authors:
Sebastian Brand
Affiliations:
CWI, Amsterdam, The Netherlands
Venue:
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Year:
2002

Citing 4
Cited 1

Rule-based constraint programming

Fundamenta Informaticae - Special issue on foundations of constraint programming
The essence of constraint propagation

Theoretical Computer Science
Towards Inductive Constraint Solving

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Constraint programming viewed as rule-based programming

Theory and Practice of Logic Programming

Removing propagation redundant constraints in redundant modeling

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

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 fix-point 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.