Skip to content

Prolog and Expert Systems Programming

Best in textbook rentals since 2012!

ISBN-10: 0070067317

ISBN-13: 9780070067318

Edition: 1991

Authors: Kenneth Bowen

List price: $59.38
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

One of the striking and successful areas of application of Prolog is to the implementation of expert systems. This book orients the presentation of Prolog programming toward the development of several approaches to the implementation of expert systems. Part I of the book introduces elementary Prolog programming. Part II presents advanced aspects while developing several large expert systems with examples of inherent interest to most people. In the second part, software design issues in the context of Prolog programming also are considered. Covering numerous expert systems examples, the exercises utilize real information from the everyday and scientific worlds as the basis for developing…    
Customers also bought

Book details

List price: $59.38
Copyright year: 1991
Publisher: McGraw-Hill Higher Education
Binding: Paperback
Pages: 448
Size: 6.50" wide x 9.25" long x 0.75" tall
Weight: 1.100
Language: English

Prefacep. xi
Core Prolog
Prolog Databasesp. 3
Elementary Prolog Databasesp. 3
Representing a Circuitp. 8
Identification of Hickory Treesp. 12
Syntaxp. 14
Using Prolog Systemsp. 18
Exercisesp. 22
Simple Queries against Databasesp. 26
Concrete Questionsp. 26
Databases and Realityp. 29
Documentation Style and Commentsp. 31
Queries with Variablesp. 32
Exercisesp. 35
Compound Queriesp. 39
Queries with Multiple Literalsp. 39
Solving Compound Queries by Backtrackingp. 43
Backtracking, Multiple Variables, and Multiple Solutionsp. 50
The Logical Interpretation of Prolog Queriesp. 54
Facts Containing Variablesp. 58
Differencep. 61
Exercisesp. 63
Queries and Rulesp. 66
Abbreviating Questions by Rulesp. 66
Defining Relationships with Rulesp. 74
Two Interpretations of Rulesp. 77
How Prolog Worksp. 80
Tracing Prolog Computationsp. 82
How Prolog Applies Rulesp. 87
Exercisesp. 96
Recursion on Predicatesp. 99
The Ancestor Problemp. 99
Path Finding in Graphsp. 103
Representing Systems with Statep. 112
Exercisesp. 120
Recursion on Termsp. 126
Elementary List Processingp. 126
Reversing and Sorting Listsp. 134
Association Listsp. 143
Treesp. 150
Graphs Revisitedp. 155
Exercisesp. 169
Pragmaticsp. 172
Control: Disjunction, Cut, Negation, and Relativesp. 172
Looking at the Programp. 178
Builtins Affecting the Programp. 179
Comparing Terms and Sorting Listsp. 182
Collecting Informationp. 185
Analyzing Termsp. 189
Arithmetic Expressionsp. 192
Input/Outputp. 194
Operator Declarationsp. 202
Exercisesp. 204
MetaLevel Programming and Expert Systems
Elementary Expert Systemsp. 209
Object-Level Expert Systemsp. 209
Generate and Testp. 221
Query-the-Userp. 231
Accumulating Proofs for Explanationsp. 236
Exercisesp. 241
MetaLevel Shellsp. 242
A Prolog Interpreter in Prologp. 242
Interpreters for Rule-Based Systemsp. 245
Solving Constraintsp. 257
Exercisesp. 263
Parsing and Definite Clause Grammarsp. 265
Stepping-Stone Parsing and List Representationp. 265
Parameter-Free Definite Clause Grammarsp. 272
Building an Internal Representationp. 275
Using DCGs with Expert Systemsp. 279
Exercisesp. 283
Compiling Knowledgep. 287
Exercisesp. 310
Mixed Forward and Backward Reasoningp. 311
Exercisesp. 320
Appendixesp. 321
Television Schematic and Repairp. 321
Enzyme Sites and Actionsp. 323
Cloud Descriptions and Propertiesp. 324
IRS Filing Rulesp. 330
Photography Troubleshootingp. 333
Automobile Engine Problemsp. 336
Bibliographyp. 341
Indexp. 343
Table of Contents provided by Syndetics. All Rights Reserved.