Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Efficient mining of association rules using closed itemset lattices
Information Systems
Maintaining knowledge about temporal intervals
Communications of the ACM
Generating Propagation Rules for Finite Domains: A Mixed Approach
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Operational Equivalence of CHR Programs and Constraints
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Constraint-Based Rule Mining in Large, Dense Databases
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Towards Inductive Constraint Solving
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Indexical-Based Solver Learning
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Generation of Rule-Based Constraint Solvers: Combined Approach
Logic-Based Program Synthesis and Transformation
| Hi-index | 0.00 |
A general approach to specify the propagation and simplification process of constraints consists of applying rules over these constraints. In this paper, we propose a method for generating propagation rules for constraints over finite domains defined extensionally by e.g. a truth table or their tuples. Using our algorithm, the user has the possibility to specify the admissible syntactic forms of the rules. The generated rules will be implemented as rules of the language Constraint Handling Rules (CHR). Furthermore, we show that our approach performs well on various examples, including Boolean constraints, three valued logic, Allen's qualitative approach to temporal logic and qualitative spatial reasoning with the Region Connection Calculus.