by Christophe Rigotti
In Principles and Practice of Constraint Programming (CP 2000
http://www.pms.informatik.uni-muenchen.de/mitarbeiter/abdennad/Publikationen/paperCP00.ps
Add To MetaCart
Abstract:
Abstract. A general approach to specify the propagation and simpli-cation process of constraints consists of applying rules over these constraints. In this paper, we propose a method for generating propagation rules for constraints over nite domains dened 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. 1
Citations
|
1705
|
Maintaining knowledge about temporal intervals
– Allen
- 1983
|
|
1449
|
Mining association rules between sets of items in large databases
– Agrawal, Imielinski, et al.
- 1993
|
|
496
|
An Introduction to Metamathematics
– Kleene
- 1950
|
|
371
|
A further note on inductive generalization
– Plotkin
- 1971
|
|
368
|
A spatial logic based on regions and connection
– Randell, Cui, et al.
- 1992
|
|
345
|
Inductive logic programming : Theory and methods
– Muggleton, Raedt
- 1994
|
|
238
|
Theory and practice of constraint handling rules
– Frühwirth
- 1998
|
|
105
|
Constraint-based rule mining in large, dense databases
– Bayardo, Agrawal, et al.
|
|
54
|
Pruning and grouping discovered association rules
– Toivonen, Klemettinen, et al.
- 1995
|
|
43
|
P.: Constraint logic programming
– Hentenryck
- 1991
|
|
27
|
Automatic generation of constraint propagation algorithms for small finite domains
– Apt, Monfroy
- 1999
|
|
27
|
Ecient mining of association rules using closed itemset lattices
– Pasquier, Bastide, et al.
- 1999
|
|
15
|
Implementing computational systems with constraints
– Kirchner, Kirchner, et al.
- 1993
|
|
13
|
Operational semantics and con of constraint propagation rules
– Abdennadher
- 1997
|
|
5
|
Operational equivalence of CHR programs and constraints
– Abdennadher, Fruhwirth
- 1999
|
|
5
|
Generating propagation rules for domains via uni in algebra
– Ringeissen, Monfroy
- 2000
|
|
3
|
A constraint solver in algebras and its combination with uni algorithms
– Kirchner, Ringeissen
- 1992
|
|
2
|
Etude et implantation d'un algorithme d'uni dans les algebres Rapport de DEA, Universite de Nancy I
– Ringeissen
- 1990
|
