Higher-Order Coloured Unification and natural language semantics

Authors:
Claire Gardent;Michael Kohlhase
Affiliations:
Universität des Saarlandes, D-Saarbrücken;Universität des Saarlandes, D-Saarbrücken
Venue:
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Year:
1996

Citing 3
Cited 10

Higher-order unification via combinators

Theoretical Computer Science
Decidable Higher-Order Unification Problems

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Focus and Higher-Order Unification

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1

Managing Structural Information by Higher-Order Colored Unification

Journal of Automated Reasoning
Deaccenting and Higher-Order Unification

Journal of Logic, Language and Information
Higher Order Unification 30 Years Later

TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Bidirectional contextual resolution

Computational Linguistics
An empirical assessment of semantic interpretation

NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Focus and Higher-Order Unification

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Unifying parallels

ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Computing parallelism in discourse

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
The Use of Embeddings to Provide a Clean Separation of Term and Annotation for Higher Order Rippling

Journal of Automated Reasoning
Well-nested context unification

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we show that Higher-Order Coloured Unification - a form of unification developed for automated theorem proving - provides a general theory for modeling the interface between the interpretation process and other sources of linguistic, non semantic information. In particular, it provides the general theory for the Primary Occurrence Restriction which (Dalrymple et al., 1991)'s analysis called for.