Parallelism Constraints

Abstract : Parallelism constraints are logical desciptions 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.
Type de document :
Communication dans un congrès
International Conference on Rewriting Techniques and Applications, 2000, Norwich, United Kingdom. Springer, 1833, pp.110--126, 2000, Lecture Notes on Computer Science
Liste complète des métadonnées

Littérature citée [22 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00536808
Contributeur : Joachim Niehren <>
Soumis le : samedi 20 novembre 2010 - 14:41:23
Dernière modification le : mardi 31 octobre 2017 - 14:22:18
Document(s) archivé(s) le : lundi 21 février 2011 - 02:16:13

Fichiers

parallelism.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00536808, version 1

Citation

Katrin Erk, Joachim Niehren. Parallelism Constraints. International Conference on Rewriting Techniques and Applications, 2000, Norwich, United Kingdom. Springer, 1833, pp.110--126, 2000, Lecture Notes on Computer Science. 〈inria-00536808〉

Partager

Métriques

Consultations de la notice

48

Téléchargements de fichiers

137