On Constraint-Based Lambek Calculi

Details On Constraint-Based Lambek Calculi On Constraint-Based Lambek Calculi

1995-08-15

arxiv.org/abs/cmp-lg/9508008v1

Computer Science

Computation and Language

uuencoded gzipped ps file, 97k, 18 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Constraint-Based Lambek Calculi does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Constraint-Based Lambek Calculi, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Constraint-Based Lambek Calculi will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-24098