Skip to content
Register Sign in Wishlist

The Logic of Typed Feature Structures
With Applications to Unification Grammars, Logic Programs and Constraint Resolution

$56.00 (C)

Part of Cambridge Tracts in Theoretical Computer Science

  • Date Published: November 2005
  • availability: Available
  • format: Paperback
  • isbn: 9780521022545

$ 56.00 (C)
Paperback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    Reviews & endorsements

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

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: November 2005
    • format: Paperback
    • isbn: 9780521022545
    • length: 280 pages
    • dimensions: 245 x 170 x 15 mm
    • weight: 0.453kg
    • contains: 28 b/w illus.
    • availability: Available
  • Table of Contents

    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.

  • Author

    Robert L. Carpenter, Carnegie Mellon University, Pennsylvania

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×