Linear second-order unification and context unification with tree-regular constraints*

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

Volumn 1833, Issue , 2000, Pages 156-171

  Levy, Jordi ^a   Villaret, Mateu ^b  

^a CSIC   (Spain)

^b UNIVERSITY OF GIRONA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY;

CONTEXT UNIFICATIONS; SECOND ORDERS;

FORESTRY;

COMPUTATION; PROBLEM SOLVING;

EID: 33745170521     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10721975_11     Document Type: Conference Paper

References (16)

1. H. Comon. Completion of rewrite systems with membership constraints. I. of Symbolic Computation, 25(4):397-453, 1998.
2. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.f r/tata, 1997.
3. J. Levy. Linear second-order unification. In 7th Int. Conf. on Rewriting Techniques and Applications, RTA'96, volume 1103 of LNCS, pages 332-346, New Jersey, USA, 1996.
4. J. Levy. Decidable and undecidable second-order unification problems. In 9th Int. Conf. on Rewriting Techniques and Applications, RTA '98, volume 1379 of INCS, pages 47-60, Tsukuba, Japan, 1998.
5. J. Levy and J. Agusti. Bi-rewrite systems. I. of Symbolic Computation, 22:279-314, 1996.
6. J. Levy and M. Veanes. On the undecidability of second-order unification. Information and Computation, 2000. (to appear).
7. J. Levy and M. Villaret. On the decidability of context unification. Technical report, IIIA, CSIC, 2000.
8. G. S. Makanin. The problem of solvability of equations in a free semigroup. Math. USSR Sbornik, 32(2):129-198, 1977.
9. J. Niehren, M. Pinkal, and P. Ruhrberg. On equality up-to constraints over finite trees, context unification, and one-step rewriting. In Utth International Conference on Automated Deduction, CADE-14, volume 1249 of LNCS, pages 34-48, Townsville, North Queensland, Australia, 1997.
10. M. Schmidt-Schaub. An algorithm for distributive unification. In 7th Int. Conf. on Rewriting Techniques and Applications, RTA'96, volume 1103 of INCS, pages 287-301, New Jersey, USA, 1996.
11. M. Schmidt-Schaub. A decision algorithm for distributive unification. Theoretical Computer Science, 208:111-148, 1998.
12. M. Schmidt-Schaub. Decidability of bounded second-order unification. Technical Report Frank-report-11, FB Informatik, J.W. Goethe Universitat Frankfurt, 1999.
13. M. Schmidt-Schaub. A decision algorithm for stratified context unification. Technical Report Frank-report-12, FB Informatik, J.W. Goethe Universitat Frankfurt, 1999.
14. M. Schmidt-Schaub and K.U. Schulz. On the exponent of periodicity of minimal solutions of context equations. In 9th Int. Conf. on Rewriting Techniques and Applications, RTA'98, volume 1379 of INCS, pages 61-75, Tsukuba, Japan, 1998.
15. M. Schmidt-SchauBand K.U. Schulz. Solvability of context equations with two context variables is decidable. In Conference on Automated Deduction, CADE'99, LNCS, pages 67-81, 1999.
16. K. U. Schulz. Makanin's algorithm, two improvements and a generalization. Technical Report CIS-Bericht-91-39, Centrum fur Informations und Sprachver-arbeitung, Universitat Miinchen, 1991.