This file contains code from Poole, Mackworth and Goebel,
Computational Intelligence: A Logical Approach. All code is
copyright by Poole, Mackworth and Goebel, and Oxford University Press,
1998. All Rights reserved. This code comes with no warranty.
This code runs in CILog, a
representation and reasoning system for definite clauses, with
declarative debugging tools.
Either save the code to a file and load it into CILog,
or cut and paste each clause and
tell it to CILOG.
- west.pl axiomatization of office layout from
Figure 2.3 and Example 2.13 (page 43).
- times.pl axiomatization of orderings of the
times of the day from Example 2.28 (page 59).
- elect.pl electrical wiring example
from Section 3.2
- course.pl course example from Section 3.3
- lists.pl list procedures from Section 3.4
- univ.pl university requirements example
of Section 3.5
- univ2.pl university requirements
example, different axiomatization
- The following are based on the generic graph searcher:
The following domains can be used:
- search.pl The generic graph
searcher from Section 4.3.
- hsearch.pl a graph searcher for
heuristic search. This maintains more information per node than the
generic graph searchers.
iterative deepening search, based on the generic search algorithm.
iterative deepening A* search, based on the generic search algorithm.
- graph.pl The delivery domain
graph from Figure 4.2 of the book.
- graph2.pl The graph of Figure 4.5
(i.e., like graph.pl, but with cycles.
- elect_abd.pl Electrical domain for
abductive diagnosis. Note that CILog does not do a consistency-check,
so it does not give the correct answers for this example (some of the
"explanations" are not consistent)!
Last updated 25 January 2006, David