Abstract
Parallelism constraints are logical descriptions of trees. They are as expressive as context unification, i.e. second-order linear unification. We present a semi-decision procedure enumerating all “most general unifiers” of a parallelism constraint and prove it sound and complete. In contrast to all known procedures for context unification, the presented procedure terminates for the important fragment of dominance constraints and performs reasonably well in a recent application to underspecified natural language semantics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Backofen, R., Rogers, J., Vijay-Shanker, K.: A first-order axiomatization of the theory of finite trees. J. Logic, Language, and Information 4, 5–39 (1995)
Bos, J.: Predicate logic unplugged. In: 10th Amsterdam Colloquium, pp. 133–143 (1996)
The CHORUS demo system (1999), http://www.coli.uni-sb.de/cl/projects/chorus/demo.html
Comon, H.: Completion of rewrite systems with membership constraints. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, Springer, Heidelberg (1992)
Duchier, D., Gardent, C.: A constraint-based treatment of descriptions. In: Proc. of the Third International Workshop on Computational Semantics (1999)
Duchier, D., Niehren, J.: Dominance constraints with set operators (2000) (submitted)
Egg, M., Niehren, J., Ruhrberg, P., Xu, F.: Constraints over Lambda-Structures in Semantic Underspecification. In: Proc. COLING/ACL 1998, Montreal (1998)
Erk, K., Niehren, J.: Parallelism constraints. Technical report, Universität des Saarlandes, Programming Systems Lab (2000), Extended version of RTA 2000 paper http://www.ps.uni-sb.de/Papers/abstracts/parallelism.html
Gardent, C., Webber, B.: Describing discourse semantics. In: Proc. 4th TAG+ Workshop, Philadelphia, University of Pennsylvania, Philadelphia (1998)
Koller, A.: Evaluating context unification for semantic underspecification. In: Proc. Third ESSLLI Student Session, pp. 188–199 (1998)
Koller, A., Niehren, J., Striegnitz, K.: Relaxing underspecified semantic representations for reinterpretation. In: Proc. Sixth Meeting on Mathematics of Language (1999)
Koller, A., Niehren, J., Treinen, R.: Dominance constraints: Algorithms and complexity. In: Proc. Third Conf. on Logical Aspects of Computational Linguistics, Grenoble (1998)
Lévy, J.: Linear second order unification. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol. 1103, pp. 332–346. Springer, Heidelberg (1996)
Makanin, G.: The problem of solvability of equations in a free semigroup. Soviet Akad. Nauk SSSR 223(2) (1977)
Marcus, M.P., Hindle, D., Fleck, M.M.: D-theory: Talking about talking about trees. In: Proc. 21st ACL, pp. 129–136 (1983)
Niehren, J., Koller, A.: Dominance Constraints in Context Unification. In: Proc. Third Conf. on Logical Aspects of Computational Linguistics, Grenoble (1998) (to appear in LNCS)
Niehren, J., Pinkal, M., Ruhrberg, P.: A uniform approach to underspecification and parallelism. In: Proc. ACL 1997, Madrid, pp. 410–417 (1997)
Pinkal, M.: Radical underspecification. In: Proc. 10th Amsterdam Colloquium, pp. 587–606 (1996)
Reyle, U.: Dealing with ambiguities by underspecification: construction, representation, and deduction. Journal of Semantics 10, 123–179 (1993)
Decidability of context unification. The RTA list of open problems, number 90 (1998) http://www.lri.fr/~rtaloop/
Schmidt-Schauß, M.: Unification of stratified second-order terms. Technical Report 12/99, J. W. Goethe-Universität Frankfurt, Fachbereich Informatik (1999)
Schmidt-Schauß, M., Schulz, K.: On the exponent of periodicity of minimal solutions of context equations. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol. 1379, p. 61. Springer, Heidelberg (1998)
Venkatamaran, K.N.: Decidability of the purely existential fragment of the theory of term algebra. J. ACM 34(2), 492–510 (1987)
Vijay-Shanker, K.: Using descriptions of trees in a tree adjoining grammar. Computational Linguistics 18, 481–518 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Erk, K., Niehren, J. (2000). Parallelism Constraints. In: Bachmair, L. (eds) Rewriting Techniques and Applications. RTA 2000. Lecture Notes in Computer Science, vol 1833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10721975_8
Download citation
DOI: https://doi.org/10.1007/10721975_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67778-9
Online ISBN: 978-3-540-44980-5
eBook Packages: Springer Book Archive