|
|
Sold Out
Book Categories |
| Acknowledgments | ||
| 1 | Introduction | 1 |
| I | Basics | |
| 2 | Types and Inheritance | 11 |
| Type Inheritance Hierarchies | 11 | |
| Constructing Inheritance Hierarchies | 17 | |
| 3 | Feature Structures | 33 |
| Feature Structures | 36 | |
| Subsumption | 40 | |
| Abstract Feature Structures | 43 | |
| Unification | 45 | |
| 4 | Attribute-Value Descriptions and Satisfaction | 51 |
| Description Language | 52 | |
| Satisfaction | 53 | |
| Proof Theory | 60 | |
| II | Extensions | |
| 5 | Acyclic Feature Structures | 73 |
| 6 | Appropriateness and Typing | 77 |
| Appropriateness | 85 | |
| Well-Typed Feature Structures | 88 | |
| Totally Well-Typed Feature Structures | 94 | |
| Static Typing | 104 | |
| 7 | Inequations | 109 |
| Inequations and Negation | 109 | |
| Inequated Feature Structures | 112 | |
| Fully Inequated Feature Structures | 117 | |
| 8 | Identity and Extensionality | 124 |
| Identity in Feature Structures | 124 | |
| Extensionality | 126 | |
| Collapsing | 135 | |
| 9 | Maximality, Groundedness, and Closed World Inference | 139 |
| III | Alternatives | |
| 10 | Variables and Assignments | 151 |
| 11 | Feature Algebras | 160 |
| 12 | Infinite Feature Structures and Domains | 167 |
| IV | Applications | |
| 13 | Unification-Based Phrase Structure Grammars | 185 |
| Unification Phrase Structure Grammars | 188 | |
| Rewriting | 196 | |
| Tree Admissibility | 198 | |
| Denotational Semantics | 204 | |
| Top-Down and Bottom-Up Evaluation | 206 | |
| 14 | Definite Clause Programming | 215 |
| Definite Clause Programs | 217 | |
| Forward Chaining and Program Meaning | 219 | |
| Backward Chaining and Program Operation | 222 | |
| 15 | Recursive Type Constraints | 227 |
| Type Constraint Systems | 228 | |
| Queries and [pi]-Resolution | 230 | |
| Phrase Structure with Constraints | 234 | |
| Junk Slots, Definite Constraints, and Parsing | 238 | |
| Domains and Infinite Solutions | 242 | |
| Bibliography | 245 | |
| Index of Symbols | 259 | |
| Index | 263 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Jim Bruyere
reviewed The Logic of Typed Feature Structures: With Applications to Unification Grammars, Logic Programs and Constraint Resolution on September 30, 2014
The Logic of Typed Feature Structures: With Applications to Unification Grammars, Logic Programs and Constraint Resolution
In comparison to "Introduction to Algorithms" (the other algorithm book I had significant exposure to) this one is faster to read, easier to digest and more tailored towards applications.
I found the "Hitchhiker's Guide to Algorithms" in the back to be extremely useful if you really find yourself tackling an algorithmic problem in practice.
The main part (maybe skipping/skimming down a few chapters) is a very good preparation for algorithm-heavy job interviews (e.g. Google, Facebook etc ...).
Very much recommended.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
The Logic of Typed Feature Structures: With Applications to Unification Grammars, Logic Programs and Constraint Resolution
X
This Item is in Your Inventory
The Logic of Typed Feature Structures: With Applications to Unification Grammars, Logic Programs and Constraint Resolution
X
You must be logged in to review the productsX
X
X
Add The Logic of Typed Feature Structures: With Applications to Unification Grammars, Logic Programs and Constraint Resolution, 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 a, The Logic of Typed Feature Structures: With Applications to Unification Grammars, Logic Programs and Constraint Resolution to the inventory that you are selling on WonderClubX
X
Add The Logic of Typed Feature Structures: With Applications to Unification Grammars, Logic Programs and Constraint Resolution, 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 a, The Logic of Typed Feature Structures: With Applications to Unification Grammars, Logic Programs and Constraint Resolution to your collection on WonderClub |