Well-nested context unification

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

Volumn 3632 LNAI, Issue , 2005, Pages 149-163

  Levy, Jordi ^a   Niehren, Joachim ^b   Villaret, Mateu ^c  

^a ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

^b INRIA   (France)

^c UNIVERSITY OF GIRONA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONTEXT SENSITIVE LANGUAGES; POLYNOMIALS; TREES (MATHEMATICS);

CONTEXT EQUATIONS; NATURAL LANGUAGE;

PROBLEM SOLVING;

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

References (20)

1. [Ang80] D. Angluin. Finding patterns common to a set of strings. Journal of Computer and Systems Sciences, 21:46-62, 1980.
2. [BDMN04] M. Bodirsky, D. Duchier, S. Miele, and J. Niehren. A new algorithm for normal dominance constraints. In ACM-SIAM Symposium on Discrete Algorithms, pages 54-78, 2004.
3. [Com92] H. Comon. Completion of rewrite systems with membership constraints. In Int. Coll. on Automata Languages and Progr., vol. 623 of LNCS, 1992.
4. [DSP91] M. Dalrymple, S. Shieber, and F. Pereira. Ellipsis and higher-order unification. Linguistics & Philosophy, 14:399-452, 1991.
5. [EKN01] M. Egg, A. Koller, and J. Niehren. The constraint language for lambda structures. Journal of Logic, Language, and Information, 10:457-485, 2001.
6. [EN03] K. E. Erk and J. Niehren. Well-nested parallelism constraints for ellipsis resolution. In 11th Conf. of the European Chapter of the Ass. of Comp. Ling., pages 115-122, 2003.
7. [GK96] C. Cardent and M. Kohlhasc. Higher-order coloured unification and natural language semantics. In 34th Meet, of the Ass. for Comput. Ling., 1996.
8. [Lev96] J. Levy. Linear second-order unification. In 7th Int. Conf. on Rewriting Techniques and Applications, vol. 1103 of LNCS, pages 332-346, 1996.
9. [LV00] J. Levy and M. Villaret. Linear second-order unification and context unification with tree-regular constraints. In 11th Int. Conf. on Rewriting Techniques and Applications, vol. 1833 of LNCS, pages 156-171, 2000.
10. [Mak77] G. S. Makanin. The problem of solvability of equations in a free semigroup. Math. USSR Sbornik, 32(2):129-198, 1977.
11. [Mon73] R. Montague. The proper treatment of quantification in ordinary English. In Approaches to Natural Language. Dordrecht, 1973.
12. [NK01] J. Niehren and A. Koller. Dominance constraints in context unification. In Logical Aspects of Computational Linguistics, vol. 2014 of LNAI, pages 199-218, 2001.
13. [NPR97] J. Niehren, M. Pinkal, and P. Ruhrberg. A uniform approach to underspecification and parallelism. In 35th Meeting of the Association of Computational Linguistics, pages 410-417, 1997.
14. [Pla94] W. Plandowski. Testing equivalence of morphisms in context-free languages. In J. van Leeuwen, editor, Proc. of the 2nd Annual European Symposium on Algorithms, vol. 855 of LNCS, pages 460-470, 1994.
15. [Pla95] W. Plandowski. The Complexity of the Morphism Equivalence Problem for Context-Free Languages. PhD thesis, Department of Mathematics, Informatics and Mechanics, Warsaw University, 1995.
16. [Pla99] W. Plandowski. Satisfiability of word equations with constants is in PSPACE. In 40th IEEE Found. of Comp. Science, pages 495-500, 1999.
17. [PR.98] W. Plandowski and W. Rytter. Application of lempel-ziv encodings to the solution of words equations. In 25th ICALP, vol. 1443 of LNCS, pages 731-742, 1998.
18. [Sag76] I. Sag. Deletion and logical form. PhD thesis, MIT, Cambridge, 1976.
19. [SS02] M. Schmidt-Schauß. A decision algorithm for stratified context unification. Journal of Logic and Computation, 12:929-953, 2002.
20. [SSS99] M. Schmidt-Schauß and K. U. Schulz. Solvability of context equations with two context variables is decidable. In 16th Int. Conf. on Automated Deduction, LNAI, pages 67-81, 1999.