Constraint Categorial Grammars

• Type: Article in International Conference Proceedings Book
• Date: 1995

Authors

Luís Damas (Author) FCUP; Nelma Moreira (Author) FCUP

Conference proceedings International

Title: Progress in Artificial Intelligence, 7th Portuguese Conference on Artificial Intelligence, EPIA '95, Funchal, Madeira Island, Portugal, October 3-6, 1995, Proceedings

Pages: 347-358

Indexing

ISI Web of Knowledge

Scopus - 1 Citation

Other information

Authenticus ID: P-008-KZT

DOI: 10.1007/3-540-60428-6_29

Abstract (EN): Although unification can be used to implement a weak form of ß-reduction, several linguistic phenomena are better handled by using some form of ¿-calculus. In this paper we present a higher order feature description calculus based on a typed, ¿-calculus. We show how the techniques used in CLG for resolving complex feature constraints can be efficiently extended. CCLG is a simple formalism, based on categorical grammars, designed to test the practical feasibility of such a calculus. © Springer-Verlag Berlin Heidelberg 1995.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 12