Cambridge Catalog  
  • Your account
  • View basket
  • Help
Home > Catalog > The Logic of Typed Feature Structures
The Logic of Typed Feature Structures


  • 28 b/w illus.
  • Page extent: 280 pages
  • Size: 247 x 174 mm
  • Weight: 0.453 kg
Add to basket


 (ISBN-13: 9780521022545 | ISBN-10: 0521022541)

  • There was also a Hardback of this title but it is no longer available | Adobe eBook
  • Published November 2005

Manufactured on demand: supplied direct from the printer

$56.00 (C)

This book develops the theory of typed feature structures, a new form of data structure that generalizes both the first-order terms of logic programs and feature-structures of unification-based grammars to include inheritance, typing, inequality, cycles and intensionality. It presents a synthesis of many existing ideas into a uniform framework, which serves as a logical foundation for grammars, logic programming and constraint-based reasoning systems. Throughout the text, a logical perspective is adopted that employs an attribute-value description language along with complete equational axiomatizations of the various systems of feature structures. Efficiency concerns are discussed and complexity and representability results are provided. The application of feature structures to phrase structure grammars is described and completeness results are shown for standard evaluation strategies. Definite clause logic programs are treated as a special case of phrase structure grammars. Constraint systems are introduced and an enumeration technique is given for solving arbitrary attribute-value logic constraints. This book with its innovative approach to data structures will be essential reading for researchers in computational linguistics, logic programming and knowledge representation. Its self-contained presentation makes it flexible enough to serve as both a research tool and a textbook.


Acknowledgements; Part I. Basics: 1. Introduction; 2. Types and inheritance; 3. Feature structures; 4. Attribute-value descriptions and satisfaction; Part II. Extensions: 5. Acyclic feature structures; 6. Appropriateness and typing; 7. Inequations; 8. Identity and extensionality; 9. Maximality, groundedness and closed world inference; Part III. Alternatives: 10. Variables and assignments; 11. Feature algebras; 12. Infinite feature structures and domains; Part IV. Applications: 13. Unification-based phrase structure grammars; 14. Definite clause programming; 15. Recursive type constraint systems; Bibliography.


"...well and clearly written....can be used as a textbook as well as a monograph." Peter Bachmann, Mathematical Reviews

" indispensable compendium for the researcher or graduate student working on constraint-based grammatical formalisms, and they also make it a very useful reference work for researchers in object-oriented databases and logic programming." Fernando Pereira, Computational Linguistics

printer iconPrinter friendly version AddThis