Dominance constraints in context unification

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

Volumn 2014, Issue , 2001, Pages 199-218

  Niehren, Joachim ^a   Koller, Alexander ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

Computational linguistics; Computational logics; Tree descriptions; Underspecification; Unification theory

Indexed keywords

FORESTRY; LOGIC PROGRAMMING; SEMANTICS;

COMPUTATIONAL LOGIC; CONTEXT UNIFICATIONS; DESCRIPTION LANGUAGES; EXPRESSIVE POWER; REWRITING THEORY; TREE DESCRIPTIONS; UNDERSPECIFICATION; UNIFICATION THEORY;

COMPUTATIONAL LINGUISTICS;

EID: 26944465128     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45738-0_12     Document Type: Conference Paper

References (39)

1. Aiken, A., and E. L. Wimmers. Solving Systems of Set Constraints. In International Conference on Logic in Computer Science, pages 329-340, June 1992.
2. Baader, F., and J. Siekmann. Unification theory. In D.M. Gabbay, C.J. Hogger, and J.A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford University Press, 1993.
3. Backofen, R., and G. Smolka. A complete and recursive feature theory. Journal of Theoretical Computer Science, 146(1-2):243-268, July 1995.
4. Blackburn, P., C. Gardent, and W. Meyer-Viol. Talking about trees. In European Chapter of the Association of Comp. Linguistics, 1993.
5. Bos, J. Predicate logic unplugged. In Proc. of the 10th Amsterdam Colloquium, pages 133-143, 1996.
6. Colmerauer, A. Equations and inequations on finite and infinite trees. In Proceedings of the 2nd International Conference on Fifth Generation Computer Systems, pages 85-99, 1984.
7. Comon, H. Completion of rewrite systems with membership constraints. In Coll. on Automata, Languages and Programming, volume 623 of LNCS, 1992.
8. Deemter, K. van, and S. Peters. Semantic Ambiguity and Under specification. CSLI, Stanford, 1996.
9. Duchier, D. and C. Gardent. A constraint-based treatment of descriptions. In Proceedings of IWCS-3, Tilburg, 1999.
10. Egg, M., J. Niehren, P. Ruhrberg, and F. Xu. Constraints over lambda-structures in semantic under specification. In Proc. of COLING/ACL, pages 253-359, 1998.
11. Gardent, C., and B. Webber. Describing discourse semantics. In Proc. of the TAG+ Workshop, Philadelphia, 1998.
12. Heintze, N., and J. Jaffar. A decision procedure for a class of set constraints. In International Conference on Logic in Computer Science, pages 42-51, 1990.
13. Kasper, R. T., and W. C. Rounds. A logical semantics for feature structures. In Annual Meeting of the Association of Comp. Linguistics, pages 257-265, 1986.
14. Koller, A. Constraint languages for semantic under specification. Master’s thesis, Universität des Saarlandes, Saarbrücken, 1999. http://www.coli.uni-sb.de/~koller/papers/da.html.
15. Koller, A., J. Niehren, and R. Treinen. Dominance constraints: Algorithms and complexity. In Proceedings of the Third Conference on Logical Aspects of Computational Linguistics, Grenoble, 1998.
16. Lévy, J. Linear second order unification. In International Conference on Rewriting Techniques and Applications, volume 1103 of LNCS, pages 332-346, 1996.
17. Makanin, G. S. The problem of solvability of equations in a free semigroup. Soviet Akad. Nauk SSSR, 223(2), 1977.
18. Marcus, M. P., D. Hindle, and M. M. Fleck. D-theory: Talking about talking about trees. In Proc. of the Annual Meeting of the ACL, 1983.
19. Martelli, A. and U. Montanari. An Efficient unification algorithm. ACM TOPLAS, 4(2):258-282, 1982.
20. Meyer-Viol, W., and R. Kempson. Sequential construction of logical forms. In Proceedings of the Third Conference on Logical Aspects of Computational Linguistics, Grenoble, France, 1998.
21. Müller, M., and J. Niehren. Ordering constraints over feature trees expressed in second-order monadic logic. Information and Computation, 2000. Special Issue on RTA, Tsukuba, Japan, March 1998. To appear.
22. Mozart Consortium: Universität des Saarlandes, DFKI, SFB 378, SICS, Université de Louvain. The Mozart System of Oz. Freely available at www.mozart-oz.org, January 1999.
23. Muskens, R. Underspecified semantics. CLAUS Report 95, Univ. des Saarlandes, Saarbrücken, 1998.
24. Niehren, J., M. Pinkal, and P. Ruhrberg. On equality up-to constraints over finite trees, context unification and one-step rewriting. In Proc. of the CADE, volume 1249 of LNCS, pages 34-48, 1997.
25. Niehren, J., M. Pinkal, and P. Ruhrberg. A uniform approach to under specification and parallelism. In Annual Meeting of the Association of Comp. Linguistics, pages 410-417, 1997.
26. Niehren, J., R. Treinen, and S. Tison. On rewrite constraints and context unification. Technical report, Universität des Saarlandes, Programming Systems Lab, 1999. Submitted. Available at http://www.ps.uni-sb.de/Papers/abstracts/rewrite-context.
27. Rabin, M. O. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1-35, 1969.
28. Reyle, U. Dealing with ambiguities by under specification: construction, representation, and deduction. Journal of Semantics, 10:123-179, 1993.
29. Decidability of context unification. The RTA list of open problems, number 90, http://www.lri.fr/~rtaloop/, 1998.
30. Schmidt-Schauß, M. Unification of stratified second-order terms. Technical Report 12/94, J. W. Goethe Universität, Frankfurt, 1994.
31. Schmidt-Schauß, M. A unification algorithm for distributivity and a multiplicative unit. J. of Symbolic Computation, 22(3):315-344, 1997.
32. Schmidt-Schauß, M., and K. Schulz. On the exponent of periodicity of minimal solutions of context equations. In International Conference on Rewriting Techniques and Applications, volume 1379 of LNCS, 1998.
33. Schmidt-Schauß, M., and K. Schulz. Solvability of context equations with two context variables is decidable. In Proc. of the CADE, LNCS, 1999.
34. Schulz, K. U. Word unification and transformation of generalized equations. Information and Computation, 11:149-184, 1993.
35. Smolka, G. Feature constraint logics for unification grammars. Journal of Logic Programming, 12:51-87, 1992.
36. Smolka, G. The Oz programming model. In Jan van Leeuwen, editor, Computer Science Today, Lecture Notes in Computer Science, vol. 1000, pages 324-343. Springer-Verlag, 1995.
37. Talbot, J.-M., Ph Devienne, and S. Tison. Generalized definite set constraints. Constraints, an International Journal, Special Issue on CP’97, January 2000.
38. Venkataraman, K. N. Decidability of the purely existential fragment of the theory of term algebra. Journal of the ACM, 34(2):492-510, 1987.
39. Vijay-Shanker, K. Using descriptions of trees in a tree adjoining grammar. Computational Linguistics, 18(4):481-517, 1992.