Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-v9fdk Total loading time: 0 Render date: 2024-11-09T08:23:26.046Z Has data issue: false hasContentIssue false

1 - Introduction

Published online by Cambridge University Press:  12 October 2009

Robert L. Carpenter
Affiliation:
Carnegie Mellon University, Pennsylvania
Get access

Summary

In this monograph we motivate and provide theoretical foundations for the specification and implementation of systems employing data structures which have come to be known as 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. Feature structures are inherently associative in nature, with features interpreted as associative connections between domain objects. This leads to natural graph-based representations in which the value of a feature or attribute in a feature structure is either undefined or another feature structure. 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 behavior of systems that employ features, roles, attributes, or slots with structured fillers or values. We provide a degree of abstraction away from concrete feature structures by employing a general attribute-value logic. We extend the usual attribute-value logic of Rounds and Kasper (1986, Kasper and Rounds 1986) to allow for path inequations, but do not allow general negation or implication of the sort studied by Johnson (1987, 1988), Smolka (1988), or King (1989).

Type
Chapter
Information
The Logic of Typed Feature Structures
With Applications to Unification Grammars, Logic Programs and Constraint Resolution
, pp. 1 - 8
Publisher: Cambridge University Press
Print publication year: 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Introduction
  • Robert L. Carpenter, Carnegie Mellon University, Pennsylvania
  • Book: The Logic of Typed Feature Structures
  • Online publication: 12 October 2009
  • Chapter DOI: https://doi.org/10.1017/CBO9780511530098.001
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Introduction
  • Robert L. Carpenter, Carnegie Mellon University, Pennsylvania
  • Book: The Logic of Typed Feature Structures
  • Online publication: 12 October 2009
  • Chapter DOI: https://doi.org/10.1017/CBO9780511530098.001
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Introduction
  • Robert L. Carpenter, Carnegie Mellon University, Pennsylvania
  • Book: The Logic of Typed Feature Structures
  • Online publication: 12 October 2009
  • Chapter DOI: https://doi.org/10.1017/CBO9780511530098.001
Available formats
×