On constraint-based Lambek calculi
Jochen Dörre, Suresh Manandhar · 1997
. We explore the consequences of layering a Lambek proof system over an arbitrary (constraint) logic. A simple model-theoretic semantics for our hybrid language is provided for which a particularly simple combination of Lambek's and the proof system of the base logic is complete. Furthermore the proof system for the underlying base logic can be assumed to be a black box. The essential reasoning needed to be performed by the black box is that of entailment checking. Assuming feature logic as the base logic entailment checking amounts to a subsumption test which is a well-known quasi-linear time decidable problem. Key words: (Lambek) Categorial Grammar, constraint-based grammar, combination of logics, HPSG 1 Background In recent years there has been a growing awareness of a need to design grammar logics that incorporate both the resource-mindedness of categorial grammars and the typed constraint-based approach of HPSG [15] [16]. We believe that the long-term goal of this enterprise is...