Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. The Logic of Typed Feature Structures
  • Cited by 259
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      October 2009
      June 1992
      ISBN:
      9780511530098
      9780521022545
      DOI:
      https://doi.org/10.1017/CBO9780511530098
      Dimensions:
      Weight & Pages:
      Dimensions:
      (247 x 174 mm)
      Weight & Pages:
      0.453kg, 280 Pages
      • Subjects:
      Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Programming Languages and Applied Logic
      Series:
      Cambridge Tracts in Theoretical Computer Science (32)
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Programming Languages and Applied Logic
    Series:
    Cambridge Tracts in Theoretical Computer Science (32)
    Information

    Book description

    This book develops the theory of typed feature structures, a data structure that generalizes both first-order terms and feature structures of unification-based grammars to include inheritance, typing, inequality, cycles and intensionality. The resulting synthesis serves as a logical foundation for grammars, logic programming and constraint-based reasoning systems. A logical perspective is adopted which employs an attribute-value description language along with complete equational axiomatizations of the various systems of feature structures. At the same time, efficiency concerns are kept in mind 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 developed for solving arbitrary attribute-value logic constraints. This book, with its innovative approach to data structure, 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 text book.

    Reviews

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

    "...an 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

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Contents

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.