The Logic of Typed Feature Structures
``Feature structures provide a record-like data structure for representing partial information that can be expressed in terms of features or attributes and their values. [...] Under our approach, feature structures are ideally suited for use in unification-based formalisms, in which unification, at its most basic level, is simply an operation that simultaneously determines the consistency of two pieces of partial information and, if they are consistent, combines them into a single result. The standard application of unification is to efficient hierarchical pattern matching, a basic operation which has applications to a broad range of knowledge representation and automated reasoning tasks. Our notion of feature structures, as well as its implications for processing, should be of interest to anyone interested in the behaviour of systems that employ features, roles, attributes, or slots with structured fillers or values.[...] Feature structures, as presented here, have immediate applications to linguistic formalisms based on unification [...] Because our feature structures provide a natural generalization of first-order terms, they also have applications to the more traditional logic grammar formalisms [...] Another obvious application is to logic programming languages themselves, in which feature structures can replace first-order terms as the data structure out of which definite clauses are constructed [...] Finally we believe that our feature structures also have applications to the so-called \textit{terminological} knowledge representation systems such as KL-ONE [...] and its descendants [...] After completing our study of feature structures, we provide three applications to phrase structure grammars, definite clause programs and general constraint resolution systems. [...] (from author's Introduction).
- The Logic of Typed Feature Structures
- Feature-constraint logics for unification grammars
- scientific article; zbMATH DE number 1692903
- scientific article; zbMATH DE number 1488208
- scientific article; zbMATH DE number 1862466
- Logical foundations for hybrid type-logical grammars
- scientific article; zbMATH DE number 65754
- Grammar induction by unification of type-logical lexicons
- A two-level logic approach to reasoning about typed specification languages
- Type dependencies for logic programs using ACI-unification
- A formal approach to subgrammar extraction for NLP
- Inheritance hierarchies: Semantics and unifications
- Parsing schemata and correctness of parsing algorithms
- Computing abstract decorations of parse forests using dynamic programming and algebraic power series
- On subsumption and semiunification in feature algebras
- A modal perspective on the computational complexity of attribute value grammar
- A feature constraint system for logic programming with entailment
- Fuzzy types: A framework for handling uncertainty about types of objects
- Unification grammars and off-line parsability
- Ordering constraints over feature trees expressed in second-order monadic logic.
- A rational reconstruction of the domain of feature structures
- Speeding up operations on feature terms using constraint programming and variable symmetry
- On type coercion in compositional and lexical semantics
- Comparing the use of feature structures in nativism and in database semantics
- scientific article; zbMATH DE number 4092797 (Why is no real title available?)
- Feature-constraint logics for unification grammars
- scientific article; zbMATH DE number 43017 (Why is no real title available?)
- scientific article; zbMATH DE number 67967 (Why is no real title available?)
- Similarity measures over refinement graphs
- scientific article; zbMATH DE number 1330429 (Why is no real title available?)
- scientific article; zbMATH DE number 1948985 (Why is no real title available?)
- scientific article; zbMATH DE number 1979744 (Why is no real title available?)
- scientific article; zbMATH DE number 1822276 (Why is no real title available?)
- scientific article; zbMATH DE number 784364 (Why is no real title available?)
- A Set-Theoretical Approach for the Induction of Inheritance Hierarchies
- Feature automata and recognizable sets of feature trees
- Phrase generation in lexical functional grammars and unification grammars
- Indexed grammars and unification grammars
- The Logic of Typed Feature Structures
- Modelling shape languages with type constraint systems
- A set-theoretic approach to linguistic feature structures and unification algorithms. I.
- A set-theoretic approach to linguistic feature structures and unification algorithms. II
- Greatest model semantics for typed feature structures
- How to Frame a Mathematician
- Efficient computation of overlay for multiple inheritance hierarchies in discourse modeling
- A complete and recursive feature theory
- How to frame innovation in mathematics
- Fuzzy order-sorted feature logic
- Order-sorted logic programming with predicate hierarchy
- Finite-tree analysis for constraint logic-based languages
This page was built for publication: The Logic of Typed Feature Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4023581)
