Equational and Membership Constraints for Infinite Trees

Abstract : We present a new constraint system with equational and membership constraints over infinite trees. It provides for complete and correct satisfiability and entailment tests and is therefore suitable for the use in concurrent constraint programming systems which are based on cyclic data structures.Our set defining devices are greatest fixpoint solutions of iregular systems of equations with a deterministic form of union. As the main technical particularity of the algorithms we present a novel memorization technique. We believe that both satisfiability and entailment tests can be implemented in an efficient and incremental manner.
Type de document :
Communication dans un congrès
Claude Kirchner. 5th International Conference on Rewriting Techniques and Applications, 1993, Montreal, Canada. Springer, 690, pp.106-120, 1993, Lecture Notes on Computer Science
Liste complète des métadonnées

https://hal.inria.fr/inria-00536824
Contributeur : Joachim Niehren <>
Soumis le : samedi 20 novembre 2010 - 14:53:03
Dernière modification le : jeudi 5 avril 2018 - 12:30:08
Document(s) archivé(s) le : lundi 21 février 2011 - 02:23:17

Fichier

equational.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00536824, version 1

Collections

Citation

Joachim Niehren, Andreas Podelski, Ralf Treinen. Equational and Membership Constraints for Infinite Trees. Claude Kirchner. 5th International Conference on Rewriting Techniques and Applications, 1993, Montreal, Canada. Springer, 690, pp.106-120, 1993, Lecture Notes on Computer Science. 〈inria-00536824〉

Partager

Métriques

Consultations de la notice

225

Téléchargements de fichiers

48