On Constraint-Based Lambek Calculi

Jochen Dörre; Suresh Manandhar

On Constraint-Based Lambek Calculi

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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 {\em entailment checking}. Assuming feature logic as the base logic entailment checking amounts to a {\em subsumption} test which is a well-known quasi-linear time decidable problem.

Original language	Undefined/Unknown
Journal	CoRR
Volume	abs/cmp-lg/9508008
Publication status	Published - 1995

Access to Document

http://arxiv.org/abs/cmp-lg/9508008

Cite this

@article{c05a6bf55a0f48c8811a62a8994cc466,

title = "On Constraint-Based Lambek Calculi",

abstract = "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 {\em entailment checking}. Assuming feature logic as the base logic entailment checking amounts to a {\em subsumption} test which is a well-known quasi-linear time decidable problem.",

author = "Jochen D{\"o}rre and Suresh Manandhar",

year = "1995",

language = "Undefined/Unknown",

volume = "abs/cmp-lg/9508008",

journal = "CoRR",

}

TY - JOUR

T1 - On Constraint-Based Lambek Calculi

AU - Dörre, Jochen

AU - Manandhar, Suresh

PY - 1995

Y1 - 1995

N2 - 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 {\em entailment checking}. Assuming feature logic as the base logic entailment checking amounts to a {\em subsumption} test which is a well-known quasi-linear time decidable problem.

AB - 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 {\em entailment checking}. Assuming feature logic as the base logic entailment checking amounts to a {\em subsumption} test which is a well-known quasi-linear time decidable problem.

M3 - Article

VL - abs/cmp-lg/9508008

JO - CoRR

JF - CoRR

ER -