E-unification by means of tree tuple synchronized grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1214, Issue , 1997, Pages 429-440

  Limet, Sébastien ^a   Réty, Pierre ^a  

^a LIFO   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

E-UNIFICATION; EQUATIONAL THEORY; REWRITE SYSTEMS; TREE TUPLE SYNCHRONIZED GRAMMARS;

SOFTWARE DESIGN;

EID: 84957002950     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030616     Document Type: Conference Paper

References (12)

1. J. Christian. Some Termination Criteria for Narrowing and E-Unification. In Saragota Springs, editor, CADE, Albany (NY, USA), volume 607 of LNAI, pages 582-588. Springer-Verlag, 1992.
2. H. Comon, M. Haberstrau, and J.-P. Jouannaud. Syntacticness, Cycle-Syntacticness and Shallow Theories. Information and Computation, 111(1):154-191, 1994.
3. N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. Van Leuven, editor, Handbook of Theoretical Computer Science. Elsevier Science Publishers, 1990.
4. H. Faflbender and S. Maneth. A strict border for the decidability of E-unification for recursive functions. In proceedings of the intern. Conf. on Algebraic and Logic Programming. To appear., 1996.
5. R. Gilleron, S. Tison, and Hi. Tommasi. Some new decidability results on positive and negative set constraints. In LNCS, volume 845, pages 336-351, 1994. First International Conference on Constraints in Computational Logics.
6. Y. Guan, G. Hotz, and A. Reichert. Tree Grammars with Multilinear Interpretation. Technical Report FB14-$2-01, Fachbereich 14, 1992.
7. J.-M. HuUot. Canonical Forms and Unification. In W. Bibel and R. Kowalski, editors, CADE, Les Arcs (France), volume 87 of LNCS, pages 318-334. Springer-Verlag, 1980.
8. Y. Kaji, T. Fujiwara, and T. Kasami. Solving a Unification Problem under Constrained Substitutions Using Tree Automata. In Proc. Fourteenth Conference on FST & TCS, Madras, India, volume 880 of LNCS, pages 276-287. Springer-Verlag, 1994.
9. D. Kapur and P. Narendran. Matching, unification and complexity. Sigsam Bulletin, 21(4):6-9, November 1987.
10. S. Limet and P. Réty. E-Unification by Means of Tree Tuple Synchronized Grammars. Technical Report 96-16, Laboratoire d'Informatique Fondamentaie d'Orl6ans, 1996. Available by anonymous ftp at ftp-lifo.univ-orleans.fr.
11. S. Mitra. Semantic Unification for Convergent Rewrite Systems. Phd thesis, Univ. Illinois at Urbana-Champaign, 1994.
12. R. Nieuwenhuis. Basic Paramodulation and Decidable Theories. In procedings of the 11th Annual IEEE Symposium on Logic in Computer Science, to appear, 1996.