The Logic of Typed Feature Structures
From MaRDI portal
Publication:4023581
DOI10.1017/CBO9780511530098zbMath0765.68006MaRDI QIDQ4023581
Publication date: 23 January 1993
inheritanceunificationconstraintsdenotational semanticsdata typesfeature structuresphrase structure grammarsattribute-value logic
Logic in artificial intelligence (68T27) Abstract data types; algebraic specification (68Q65) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42) Logic programming (68N17) Other applications of logic (03B80)
Related Items (18)
Feature automata and recognizable sets of feature trees ⋮ On Type Coercion in Compositional and Lexical Semantics ⋮ Parsing schemata and correctness of parsing algorithms ⋮ Computing abstract decorations of parse forests using dynamic programming and algebraic power series ⋮ Unnamed Item ⋮ How to Frame a Mathematician ⋮ Similarity measures over refinement graphs ⋮ A complete and recursive feature theory ⋮ A Set-Theoretical Approach for the Induction of Inheritance Hierarchies ⋮ Unification grammars and off-line parsability ⋮ A formal approach to subgrammar extraction for NLP ⋮ Speeding up operations on feature terms using constraint programming and variable symmetry ⋮ Ordering constraints over feature trees expressed in second-order monadic logic. ⋮ Fuzzy types: A framework for handling uncertainty about types of objects ⋮ A modal perspective on the computational complexity of attribute value grammar ⋮ A feature constraint system for logic programming with entailment ⋮ Order-sorted logic programming with predicate hierarchy ⋮ Finite-tree analysis for constraint logic-based languages
Uses Software
This page was built for publication: The Logic of Typed Feature Structures
