Off-line parsability and the well-foundedness of subsumption
type: Item
instance of: scholarly article
title: Off-line parsability and the well-foundedness of subsumption
zbMATH Open document ID: 0926.68103
DOI: 10.1023/A:1008252619710
author: Shuly Wintner
author: Nissim Francez
published in: Journal of Logic, Language and Information
publication date: 1999-05-02T00:00:00Z
Mathematics Subject Classification ID: 68T50
zbMATH DE Number: 1282863
zbMATH Keywords: typed feature structures
zbMATH Keywords: linguistic information
MaRDI profile type: Publication
full work available at URL: a:1008252619710
OpenAlex ID: W1548736520
Recommended article: Substructural logic and partial correctness
Recommended article: Unification grammars and off-line parsability
Recommended article: Q3505074
Recommended article: Substructural Logics in Natural Deduction
Recommended article: Subsumption demodulation in first-order theorem proving
Recommended article: Substructural logics: a primer
Recommended article: On the problem of computing the well-founded semantics
Recommended article: Q2767095
Recommended article: Q5688901
Recommended article: Proof complexity of substructural logics
description: scientific article; zbMATH DE number 1282863