Expert Systems: Principles And Programming

✍ Scribed by Giarratano/ Riley

• Publisher: Cengage
• Year: 2005
• Tongue: English
• Leaves: 856
• Edition: 4e
• Category: Library

✦ Synopsis

The new edition of this market-leading text builds upon the blend of expert systems theory and application established in earlier editions. The first half of the book concentrates on the theoretical base of expert systems, and offers a broad overview of Artificial Intelligence and its relation to expert systems. The second half of the text focuses on application, with the introduction of the CLIPS expert systems tool, and its new object-oriented language, COOL. All chapters end with an extensive problem set designed to reinforce knowledge.

✦ Table of Contents

Contents
Preface
1: Introduction to Expert Systems
1.1 introduction
1.2 What Is an Expert System
1.3 Advantages of Expert Systems
1.4 General Concepts of Expert Systems
1.5 Characteristics of an Expert System
1.6 The Development of Expert Systems Technology
1.7 Expert Systems Applications and Domains
1.8 Languages, Shells, and Tools
1.9 Elements of an Expert System
1.10 Production Systems
1.11 Procedural Paradigms
1.12 Nonprocedural Paradigms
1.13 Artificial Neural Systems
1.14 Connectionist Expert Systems and Inductive Learning
1.15 The State of the Art in Artificial Intelligence
1.16 Summary
Problems
Bibliography
2: The Representation of Knowledge
2.1 Introduction
2.2 -The Meaning of Knowledge
2.3 Productions
2.4 Semantic Nets
2.5 Object-Attribute-Value Triples
2.6 PROLOG and Semantic Nets
2.7 Difficulties with Semantic Nets
2.8 Schemata
2.9 Frames
2.10 Difficulties with Frames
2.11 Logic and Sets
2.12 Propositional Logic
2.13 The First Order Predicate Logic
2.14 The Universal Quantifier
2.15 The Existential Quantifier
2.16 Quantifiers and Sets
2.17 Limitations of Predicate Logic
2.18 Summary
Problems
Bibliography
3: Methods of Inference
3.1 Introduction
3.2 Trees, Lattices, and Graphs
3.3 State and Problem Spaces
3.4 AND-OR Trees and Goals
3.5 Deductive Logic and Syllogisms
3.6 Rules of Inference
3.7 Limitations of Propositional Logic
3.8 First-Order Predicate Logic
3.9 Logic Systems
3.10 Resolution
3.11 Resolution Systems and Deduction
3.12 Shallow and Causal Reasoning
3.13 Resolution and First-Order Predicate Logic
3.14 Forward and Backward Chaining
3.15 Other Methods of Inference
3.16 Metaknowledge
3.17 Hidden Markov Models
3.18 Summary
Problems
Bibliography
4: Reasoning under Uncertainty
4.1 Introduction
4.2 Uncertainty
4.3 TypesofError
4.4 Errors and Induction
4.5 Classical Probability
4.6 Experimental and Subjective Probabilities
4.7 Compound Probabilities
4.8 Conditional Probabilities
4.9 Hypothetical Reasoning and Backward Induction
4.10 Temporal Reasoning and Markov Chains
4.11 The Odds of Belief.
4.12 Sufficiency and Necessity
4.13 Uncertainty in Inference Chains
4.14 The Combination of Evidence
4.15 Inference Nets
4.16 The Propagation of Probabilities
4.17 Summary
Problems
Bibliography
5: Inexact Reasoning
5.1 Introduction
5.2 Uncertainty and Rules
5.3 Certainty Factors
5.4 Dempster-Shafer Theory
5.5 Approximate Reasoning
5.6 The State of Uncertainty
5.7 Some Commercial Applications of Fuzzy logic
5.8 Summary
Problems
Bibliography
6: Design of Expert Systems
6.1 Introduction
6.2 Selecting the Appropriate Problem
6.3 Stages in the Development of an Expert System
6.4 Errors in Development Stages
6.5 Software Engineering and Expert Systems
6.6 The Expert System Life Cycle
6.7. A Detailed Life Cycle Model
6.8 Summary
Problems
Bibliography
7: Introduction to CLIPS
7.1 Introduction
7.2. CLIPS
7.3. Notation
7.4 Fields
7.5 Entering and Exiting CLIPS
7.6 Facts
7.7. Adding and Removing Facts
7.8 Modifying and Duplicating Facts
7.9 The Watch Command
7.10 The Deffacts Construct
7.11 The Components of aRule
7.12 The Agenda and Execution
7.13 Commands for Manipulating Constructs
7.14 The Printout Command
7.15 Using Multiple Rules
7.16 The Set-Break Command
7.17 Loading and Saving Constructs
7.18 Commenting Constructs
7.19 Variables
7.20 Multiple Use of Variables
7.21 Fact Addresses
7.22 Single-Field Wildcards
7.23 Blocks World
7.24 Multifield Wildcards and Variables
7.25 Summary
Problems
Bibliography
8: Advanced Pattern Matching
8.1 Introduction
8.2 Field Constraints
8.3 Functions and Expressions
8.4 Summing Values Using Rules
8.5 The Bind Function
8.6 1/OFunctions
8.7 The Game of Sticks
8.8 Predicate Functions
8.9 The Test Conditional Element
8.10 The Predicate Field Constraint
8.11 The Return Value Field Constraint
8.12 The Sticks Program
8.13 The OR Conditional Element
8.14 The AND Conditional Element
8.15 The NOT Conditional Element
8.16 The EXISTS Conditional Element
8.17 The FORALL Conditional Element
8.18 The LOGICAL Conditional Element
8.19 Summary
Problems
9: Modular Design, Execution Control, and Rule Efficiency
9.1 Introduction
9.2 Deftemplate Attributes
9.3 Salience
9.4 Phases and Control Facts
9.5 Misuse of Salience
9.6 The Defmodule Construct
9.7. Importing and Exporting Facts
9.8 Modules and Execution Control
9.9 The Rete Pattern-Matching Algorithm
9.10 The Pattern Network
9.11 The Join Network
9.12 The Importance of Pattern Order
9.13 Ordering Patterns for Efficiency
9.14 Multifield Variables and Efficiency
9.15 The Test CE and Efficiency
9.16 Built-In Pattern-Matching Constraints
9.17 General Rules versus Specific Rules
9.18 Simple Rules versus Complex Rules
9.19 Summary
Problems
Bibliography
10: Procedural Programming
10.1 Introduction
10.2 Procedural Functions
10.3 The Deffunction Construct
10.4 The Defglobal Construct
10.5 The Defgeneric and Defmethod Constructs
10.6 Procedural Constructs and Defmodules
10.7 Useful Commands and Functions
10.8 Summary
Problems
11: Classes, Instances, and Message-Handlers
11.1. Introduction
11.2. The Defclass Construct
11.3 Creating Instances
11.4 System-Defined Message-Handlers
11.5 The Definstances Construct
11.6 Classes and inheritance
11.7 Object Pattern Matching
11.8 User-Defined Message-Handlers
11.9 Slot Access and Handler Creation
11.10 Before, After, and Around Messsage-Handlers
11.11 Instance Creation, Initialization, Handlers and Deletion Message-Handlers
11.12 Modifying and Duplicating Instances
11.13 Classes and Generic Functions
11.14 Instance Set Query Functions
11.15 Multiple Inheritance
11.16 Defclasses and Defmodules
11.17 Loading and Saving Instances
11.18 Summary
Problems
12: Expert System Design Examples
12.1 introduction
12.2 Certainty Factors
12.3 Decision Trees
12.4 Backward Chaining
12.5 A Monitoring Problem
12.6 Summary
Problems
Bibliography
APPENDIXES
APPENDIX A Some Useful Equivalences
APPENDIX B Some Elementary Quantifiers and Their Meanings
APPENDIX C Some Set Properties
APPENDIX D CLIPS Support Information
APPENDIXE CLIPS Commands and Functions Summary
APPENDIX F CLIPS BNF
APPENDIX G Software Resources
Index