Fibred semantics for feature-based grammar logic

DOI10.1007/BF00159345MaRDI QIDQ1923842zbMATH OpenOpenAlexFDO

Authors Jochen Dörre, Esther König, Dov Gabbay

Publication date 17 March 1997

Published in Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00159345

zbMATH Keywords

combined logiccomputational linguisticsfeature-based unification grammarsfibred semanticsKasper/Rounds-style feature logicLambek categorial grammarlayered logicsmodel-theoretic semanticsproof systemunification

Mathematics Subject Classification ID

Logic of natural languages (03B65) Natural language processing (68T50)

Review text

This paper gives a simple method for providing categorial brands of feature-based unification grammars with a model-theoretic semantics. The key idea is to apply the paradigm of fibred semantics (or layered logics) in order to combine the two components of a feature-based grammar logic. We demonstrate the method for the augmentation of Lambek categorial grammar with Kasper/Rounds-style feature logic. These are combined by replacing (or annotating) atomic formulas of the first logic, i.e. the basic syntactic types, by formulas of the second. Modelling such a combined logic is less trivial than one might expect. The direct application of the fibred semantics method where a combined atomic formula like \texttt{np(num:sg \& pers:3rd)} denotes those strings which have the indicated property and the categorial operators denote the usual left- and right-residuals of these string sets, does not match the intuitive, unification-based proof theory. Unification implements a global bookkeeping with respect to a proof whereas the direct fibring method restricts its view to the atoms of the grammar logic. The solution is to interpret the (embedded) feature terms as global feature constraints while maintaining the same kind of fibred structures. For this adjusted semantics, the anticipated proof system is sound and complete.

Recommendations

• scientific article; zbMATH DE number 1341541
• Fibring of logics as a categorial construction
• Feature-constraint logics for unification grammars
• scientific article; zbMATH DE number 1140670

Cites work

• A BRIEF SURVEY OF FRAMES FOR THE LAMBEK CALCULUS
• A Completeness Theorem for the Lambek Calculus of Syntactic Categories
• A modal perspective on the computational complexity of attribute value grammar
• Adding a temporal dimension to a logic system
• Compatibility of a Categorial Grammar With an Associated Category System
• Completeness Results for Lambek Syntactic Calculus
• Definite clause grammars for language analysis - A survey of the formalism and a comparison with augmented transition networks
• Feature-constraint logics for unification grammars
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 757637 (Why is no real title available?)
• scientific article; zbMATH DE number 842687 (Why is no real title available?)
• scientific article; zbMATH DE number 3275554 (Why is no real title available?)
• Linear logic
• Linguistics, Logic and Finite Trees
• On subsumption and semiunification in feature algebras
• Quantales and (noncommutative) linear logic
• The conjoinability relation in Lambek calculus and linear logic
• The Mathematics of Sentence Structure

Cited in

(5)

• Optionality, scope, and licensing: An application of partially ordered categories
• Feature-constraint logics for unification grammars
• scientific article; zbMATH DE number 1341541 (Why is no real title available?)
• scientific article; zbMATH DE number 1552271 (Why is no real title available?)
• Fibred tableaux for multi-implication logics

This page was built for publication: Fibred semantics for feature-based grammar logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923842)