On rewrite constraints and context unification

Information Processing Letters

Volumn 74, Issue 1, 2000, Pages 35-40

  Nichren, Joachim ^a   Tison, Sophie ^b   Treinen, Ralf ^c  

^a SAARLAND UNIVERSITY   (Germany)

^b UNIV LILLE   (France)

^c UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL LINGUISTICS; THEOREM PROVING;

REWRITE CONSTRAINTS (RC); STRATIFIED CONTEXT UNIFICATION;

CONSTRAINT THEORY;

EID: 0033738058     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00036-3     Document Type: Article

References (21)

1. A.-C. Caron, J.-L. Coquidé, M. Dauchet, Encompassment properties and automata with constraints, in: Proc. 5th Internat. Conference on Rewriting Techniques and Applications, Lecture Notes in Comput. Sci., Vol. 690, Springer, Berlin, 1993, pp. 328-342.
2. A.-C. Caron, F. Seynhaeve, S. Tison, M. Tommasi, Deciding the satisfiability of quantifier free formulae on one-step rewriting, in: Proc. 10th Internat. Conference on Rewriting Techniques and Applications, Lecture Notes in Comput. Sci., Vol. 1631, Springer, Berlin, 1999, pp. 103-117.
3. H. Comon, Completion of rewrite systems with membership constraints, in: Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci., Vol. 623, Springer, Berlin, 1992.
4. M. Egg, J. Niehren, P. Ruhrberg, F. Xu, Constraints over lambda-structures in semantic underspecification, in: Proc. of COLING/ACL, 1998, pp. 253-359.
5. W.D. Goldfarb, The undecidability of the second-order unification problem, Theoret. Comput. Sci. 13 (1981) 225-230.
6. J. Levy, Linear second order unification, in: Proc. 7th Internat. Conference on Rewriting Techniques and Applications, Lecture Notes in Comput. Sci., Vol. 1103, Springer, Berlin, 1996, pp. 332-346.
7. J. Levy, J. Agust, Bi-rewriting systems, J. Symbolic Comput. 22 (3) (1996) 279-314.
8. S. Limet, P. Réty, A new result about the decidability of the existential one-step rewriting theory, in: Proc. 10th Internat. Conference on Rewriting Techniques and Applications, Lecture Notes in Comput. Sci., Vol. 1631, Springer, Berlin, 1999, pp. 118-132.
9. G. Makanin, The problem of solvability of equations in a free semigroup, Soviet Akad. Nauk SSSR 223 (2) (1977).
10. J. Marcinkowski, Undecidability of the first order theory of one-step right ground rewriting, in: Proc. 8th Internat. Conference on Rewriting Techniques and Applications, Lecture Notes in Comput. Sci., Vol. 1232, Springer, Berlin, 1997, pp. 241-253.
11. J. Niehren, A. Koller, Dominance constraints in context unification, in: Proc. 3rd Internat. Conference on Logical Aspects of Computational Linguistics, Grenoble, France, 1998.
12. J. Niehren, M. Pinkal, P. Ruhrberg, On equality up-to constraints over finite trees, context unification and one-step rewriting, in: Proc. 14th Internat. Conference on Automated Deduction, Lecture Notes in Artif. Intell., Vol. 1249, Springer, Berlin, 1997, pp. 34-48.
13. J. Niehren, M. Pinkal, P. Ruhrberg, A uniform approach to underspecification and parallelism, in: Proc. Annual Meeting of the Association of Computational Linguistics, 1997, pp. 410-417.
14. M. Schmidt-Schauß, Unification of stratified second-order terms, Technical Report 12/94, J.W. Goethe Universität, Frankfurt, 1994.
15. M. Schmidt-Schauß, A unification algorithm for distributivity and a multiplicative unit, J. Symbolic Comput. 22 (3) (1997) 315-344.
16. M. Schmidt-Schauß, Decidability of bounded second order unification, Internal Report Frank-11, Universität Frankfurt, Frankfurt, Germany, 1999. Available at http://www.ki.informatik.uni-frankfurt.de/papers/articles.html.
17. M. Schmidt-Schauß, K. Schulz, Solvability of context equations with two context variables is decidable, in: Proc. 16th Internat. Conference on Automated Deduction, Lecture Notes in Comput. Sci., Vol. 1632, Springer, Berlin, 1999.
18. F. Seynhaeve, M. Tommasi, R. Treinen, Grid structures and undecidable constraint theories, in: Theory and Practice of Software Development, Lecture Notes in Comput. Sci., Vol. 1214, Springer, Berlin, 1997, pp. 357-368; Extended version: Theoretical Computer Science, to appear.
19. R. Treinen, The first-order theory of one-step rewriting is undecidable, in: Proc. 7th Internat. Conference on Rewriting Techniques and Applications, Lecture Notes in Comput. Sci., Vol. 1103, Springer, Berlin, 1996, pp. 276-286;
20. Extended version: Theoretical Computer Science 208 (1998) 149-177.
21. S. Vorobyov, The first-order theory of one step rewriting in linear noetheran systems is undecidable, in: Proc. 8th Internat. Conference on Rewriting Techniques and Applications, Lecture Notes in Comput. Sci., Vol. 1232, Springer, Berlin, 1997, pp. 254-268.