Expert Systems, Principles and Programming by Giarratano y Riley

Preface

Chapter 1: Introduction to expert systems

Chapter 2: The representation of knowledge

Chapter 3: Methods of inference

Chapter 4: Reasoning under uncertainty

4.1 Introduction
4.2 Uncertainty
4.3 Types of error
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 combinationof evidence
4.15 Inference nets
4.16 The propagation of probabilities

Chapter 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

 Chapter 6: Design of expert systems

6.1 Introduction
6.2 Selecting the appropiate 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

 Chapter 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 a rule
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 contructs
7.18 Commentingconstructs

 Chapter 8: Pattern Matching

8.1 Introduction
8.2 Variables
8.3 Multiple use of variables
8.4 Fact addresses
8.5 Single field wildcars
8.6 Blocks world
8.7 Multifield wildcars and variables
8.8 Field constrains
8.9 Functions and expressions
8.10 Summing values using rules
8.11 The bind function
8.12 I/O functions

 Chapter 9: Advanced Pattern Matching

9.1 Introduction
9.2 The game fo sticks
9.3 Input techniques
9.4 Predicate functions
9.5 The test conditional element
9.6 The predicate field constraints
9.7 The return value field constraint
9.8 The sticks program
9.9 The OR conditional element
9.10 The AND conditional element
9.11 The NOT conditional element
9.12 The EXISTS conditional element
9.13 The FORALL conditional element
9.14 The LOGICAL conditional element
9.15 Utility commands

Chapter 10: Modular Design and Execution Control

10.1 Introduction
10.2 Deftemplate attributes
10.3 Salience
10.4 Phases and control facts
10.5 Misuse of salience
10.6 The defmodule construct
10.7 Importing and exporting facts
10.8 Modules and execution control

Chapter 11: Efficiency in Rule-Based Languages

11.1 Introduction
11.2 The rete pattern-matching algorithm
11.3 The pattern network
11.4 The join network
11.5 The importance of pattern order
11.6 Ordering patterns for efficiency
11.7 Multifield variables and efficiency
11.8 The test CE and efficiency
11.9 Built-In Pattern-Matching constrains
11.10 General rules versus Specific rules
11.11 Procedural functions
11.12 Simple rules versus Complex rules
11.13 Loading and saving facts

Chapter 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

Appendix A: Some useful equivalences

Appendix B: Some elementary quantifiers and their meanings

Appendix C: Some set propierties

Appendix D: CLIPS support information

Appendix E: CLIPS command and function summary

Appendix F: CLIPS BNF