Context unification and traversal equations

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

Volumn 2051 LNCS, Issue , 2001, Pages 169-184

  Levy, Jordi ^a   Villaret, Mateu ^b  

^a CSIC   (Spain)

^b IMA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CONTEXT UNIFICATIONS; CONTEXT VARIABLES; FIRST ORDER; LINEAR TERMS; SECOND ORDERS; WORD EQUATIONS;

ARTIFICIAL INTELLIGENCE;

EID: 33745150214     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45127-7_14     Document Type: Conference Paper

References (23)

1. Hubert Comon. Completion of rewrite systems with membership constraints. In Int. Coll. on Automata, Languages and Programming, ICALP'92, volume 623 of LNCS, Vienna, Austria, 1992.
2. Hubert Comon. Completion of rewrite systems with membership constraints. Journal of Symbolic Computation, 25(4):397-453, 1998.
3. Volker Diekert, Yuri Matiyasevich, and Anca Muscholl. Solving trace equations using lexicographical normal forms. In Int. Colloquium on Automata, Languages and Programming, ICALP'97, pages 336-346, Bologna, Italy, 1997.
4. Markus Egg, Joachim Niehren, Peter Ruhrberg, and Feiyu Xu. Constraints over lambda-structures in semantic underspecification. In Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and the 17th International Conference on Computational Linguistics (ACL'98), pages 353-359, Montreal, Quebec, Canada, 1998.
5. Alexander Koller, Joachim Niehren, and Ralf Treinen. Dominance constraints: Algorithms and complexity. In Proceedings of the Third Conf. on Logical Aspects of Computational Linguistics, Grenoble, France, 1998.
6. Jordi Levy and Jaume Agusti. Bi-rewrite systems. Journal of Symbolic Computation, 22(3):279-314, 1996.
7. Jordi Levy. Linear second-order unification. In Proceedings of the 7th Int. Conf. on Rewriting Techniques and Applications (RTA'96), volume 1103 of LNCS, pages 332-346, New Brunswick, New Jersey, 1996.
8. Jordi Levy. Decidable and undecidable second-order unification problems. In Proceedings of the 9th Int. Conf. on Rewriting Techniques and Applications (RTA'98), volume 1379 of LNCS, pages 47-60, Tsukuba, Japan, 1998.
9. Jordi Levy and Margus Veanes. On unification problems in restricted second-order languages. In Annual Conf. ofthe European Ass. ofComputer Science Logic (CSL98), Brno, Czech Republic, 1998.
10. Jordi Levy and Margus Veanes. On the undecidability of second-order unification. Information and Computation, 159:125-150, 2000.
11. Jordi Levy and Mateu Villaret. Linear second-order uniication and context unification with tree-regular constraints. In Proceedings of the 11th Int. Conf. on Rewriting Techniques and Applications (RTA'00), volume 1833 of LNCS, pages 156-171, Norwich, UK, 2000.
12. G. S. Makanin. The problem of solvability of equations in a free semigroup. Math. USSR Sbornik, 32(2):129-198, 1977.
13. Joachim Niehren, Manfred Pinkal, and Peter Ruhrberg. On equality up-to constraints over inite trees, context uniication, and one-step rewriting. In Proceedings of the 14th Int. Conference on Automated Deduction (CADE-14), volume 1249 of LNCS, pages 34-48, Townsville, North Queensland, Australia, 1997.
14. Joachim Niehren, Manfred Pinkal, and Peter Ruhrberg. A uniform approach to underspecification and parallelism. In Proceedings of the 35th Annual Meeting ofthe Association for Computational Linguistics and the 8th Conference of the European Chapter of the Association for Computational Linguistics (ACL'97), pages 410-417, Madrid, Spain, 1997.
15. Joachim Niehren, Sophie Tison, and Ralf Treinen. On rewrite constraints and context uniication. Information Processing Letters, 74(1-2):35-40, 2000.
16. Tomasz Pietrzykowski. A complete mechanization of second-order logic. J. of the ACM, 20(2):333-364, 1973.
17. Klaus U. Schulz. Makanin's algorithm, two improvements and a generalization. Technical Report CIS-Bericht-91-39, Centrum fur Informations und Sprachverarbeitung, Universitat Munchen, 1991.
18. Manfred Schmidt-Schauß. An algorithm for distributive unification. In Proceedings ofthe 7th Int. Conf. on Rewriting Techniques and Applications (RTA'96), volume 1103 of LNCS, pages 287-301, New Jersey, USA, 1996.
19. Manfred Schmidt-Schauß. A decision algorithm for distributive uniication. Theoretical Computer Science, 208:111-148, 1998.
20. Manfred Schmidt-Schauß. Decidability of bounded second-order uniica-tion. Technical Report Frank-report-11, FB Informatik, J.W. Goethe Universitat Frankfurt, 1999.
21. Manfred Schmidt-Schauß. A decision algorithm for stratiied context uni-ication. Technical Report Frank-report-12, FB Informatik, J.W. Goethe Universitat Frankfurt, 1999.
22. Manfred Schmidt-Schauß and Klaus U. Schulz. On the exponent of periodicity of minimal solutions of context equations. In Proceedings of the 9th Int. Conf. on Rewriting Techniques and Applications (RTA 98), volume 1379 of LNCS, pages 61-75, Tsukuba, Japan, 1998.
23. Manfred Schmidt-Schauß and Klaus U. Schulz. Solvability of context equations with two context variables is decidable. In Proceedings of the 16th Int. Conf. on Automated Deduction (CADE-16), LNAI, pages 67-81, 1999.