Parallelism constraints

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

Volumn 1833, Issue , 2000, Pages 110-126

  Erk, Katrin ^a   Niehren, Joachim ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONTEXT UNIFICATIONS; NATURAL LANGUAGE SEMANTICS; SECOND ORDERS; SEMI-DECISION PROCEDURES; SOUND AND COMPLETE;

SEMANTICS;

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

References (24)

1. R. Backofen, J. Rogers, and K. Vijay-Shanker. A first-order axiomatization of the theory of finite trees. J. Logic, Language, and Information, 4:5–39, 1995.
2. J. Bos. Predicate logic unplugged. In 10th Amsterdam Colloquium, pages 133–143, 1996.
3. The CHORUS demo system. http://www.coli.uni-sb.de/cl/projects/chorus/demo.html, 1999.
4. H. Comon. Completion of rewrite systems with membership constraints. In Coll. on Automata, Languages and Programming, volume 623 of LNCS, 1992.
5. D. Duchier and C. Gardent. A constraint-based treatment of descriptions. In Proc. of the Third International Workshop on Computational Semantics, 1999.
6. D. Duchier and J. Niehren. Dominance constraints with set operators. Submitted, 2000.
7. M. Egg, J. Niehren, P. Ruhrberg, and F. Xu. Constraints over Lambda-Structures in Semantic Underspecification. In Proc. COLING/ACL’98, Montreal, 1998.
8. K. Erk and J. Niehren. Parallelism constraints. Technical report, Universita¨t des Saarlandes, Programming Systems Lab, 2000. Extended version of RTA 2000 paper. http://www.ps.uni-sb.de/Papers/abstracts/parallelism.html.
9. C. Gardent and B. Webber. Describing discourse semantics. In Proc. 4th TAG+ Workshop, Philadelphia, 1998. University of Pennsylvania.
10. A. Koller. Evaluating context unification for semantic underspecification. In Proc. Third ESSLLI Student Session, pages 188–199, 1998.
11. A. Koller, J. Niehren, and K. Striegnitz. Relaxing underspecified semantic representations for reinterpretation. In Proc. Sixth Meeting on Mathematics of Language, 1999.
12. A. Koller, J. Niehren, and R. Treinen. Dominance constraints: Algorithms and complexity. In Proc. Third Conf. on Logical Aspects of Computational Linguistics, Grenoble, 1998.
13. J. Lévy. Linear second order unification. In 7th Int. Conference on Rewriting Techniques and Applications, volume 1103 of LNCS, pages 332–346, 1996.
14. G. Makanin. The problem of solvability of equations in a free semigroup. Soviet Akad. Nauk SSSR, 223(2), 1977.
15. M. P. Marcus, D. Hindle, and M. M. Fleck. D-theory: Talking about talking about trees. In Proc. 21st ACL, pages 129–136, 1983.
16. J. Niehren and A. Koller. Dominance Constraints in Context Unification. In Proc. Third Conf. on Logical Aspects of Computational Linguistics, Grenoble, 1998. To appear in LNCS.
17. J. Niehren, M. Pinkal, and P. Ruhrberg. A uniform approach to underspecification and parallelism. In Proc. ACL’97, pages 410–417, Madrid, 1997.
18. M. Pinkal. Radical underspecification. In Proc. 10th Amsterdam Colloquium, pages 587–606, 1996.
19. U. Reyle. Dealing with ambiguities by underspecification: construction, representation, and deduction. Journal of Semantics, 10:123–179, 1993.
20. Decidability of context unification. The RTA list of open problems, number 90, http://www.lri.fr/~rtaloop/, 1998.
21. M. Schmidt-Schaub. Unification of stratified second-order terms. Technical Report 12/99, J. W. Goethe-Universit¨at Frankfurt, Fachbereich Informatik, 1999.
22. M. Schmidt-Schauß and K. Schulz. On the exponent of periodicity of minimal solutions of context equations. In RTA, volume 1379 of LNCS, 1998.
23. K. N. Venkatamaran. Decidability of the purely existential fragment of the theory of term algebra. J. ACM, 34(2):492–510, 1987.
24. K. Vijay-Shanker. Using descriptions of trees in a tree adjoining grammar. Computational Linguistics, 18:481–518, 1992.