Handling Relations over Finite Domains in the Rule-Based System ELAN

Christophe Ringeissen 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present a methodology for handling efficiently relations over small finite domains in the rule-based programming language ELAN. Usually, a relation is specified as a first-order formula (a constraint) interpreted in a given algebraic structure. The concept of rewriting allows us to implement an algebraic structure in a very elegant way, by using rules for defining operators and predicates. Hence, we can directly obtain a rule-based executable specification computing all tuples of a relation, but in most cases, the related computation is completely inefficient. Indeed, the specification of a relation involves conditional rules, and a lot of rewriting steps fail after being tried. In this paper, we use a constraint solver in finite algebras to transform a naive rule-based ELAN specification of a relation into an efficient rule-based ELAN program with only unconditional rules. Thus, the constraint solver enables us to improve the rule-based computation of a relation.
Type de document :
Communication dans un congrès
Third International Workshop on Rewriting Logic & Applications - WRLA'2000, 2000, Kanazawa, Japon, 17 p, 2000
Liste complète des métadonnées

https://hal.inria.fr/inria-00099386
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:53:38
Dernière modification le : jeudi 11 janvier 2018 - 06:19:58

Identifiants

  • HAL Id : inria-00099386, version 1

Collections

Citation

Christophe Ringeissen. Handling Relations over Finite Domains in the Rule-Based System ELAN. Third International Workshop on Rewriting Logic & Applications - WRLA'2000, 2000, Kanazawa, Japon, 17 p, 2000. 〈inria-00099386〉

Partager

Métriques

Consultations de la notice

143