Article,

Book Review of The Logic of Typed Feature Structures by Bob Carpenter 1992

.
Computational Linguistics, 19 (3): 545--552 (1993)

Abstract

I believe that The Logic of Typed Feature Structures is essential for any practicing or prospective researcher on feature-based grammar or knowledge representation formalisms and also very useful to researchers or graduate students in the grammar formalisms area of computational linguistics. Nowhere else can one find all the main mathematical analysis tools related to each other and all the central results carefully proved. Many readers, however, will need to come equipped with the support of a careful instructor or an attentive reading of a good introduction to the mathematical theory of partial orders, for instance, Davey and Priestley's (1990) Introduction to Lattices and Order. And those readers interested in the complexity of decision procedures for feature logics or in implementing systems based on them will have to look elsewhere for detailed algorithmic descriptions and complexity analyses of operations on feature structures and formulas. Carpenter's book is more in the European tradition that emphasizes algebraic models for formalisms than in the American tradition of complexity analyses for deductive procedures. Both are important. The Logic of Typed Feature Structures is the first systematic mapping of the landscape of feature logics, but many of the underlying processes and mechanisms still await an equally adept analysis.

Tags

Users

  • @flint63

Comments and Reviews