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 un-derspecified natural language semantics.
CITATION STYLE
Erk, K., & Niehren, J. (2000). Parallelism constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1833, pp. 110–126). Springer Verlag. https://doi.org/10.1007/10721975_8
Mendeley helps you to discover research relevant for your work.