TURTLE ROBOT WORLD AND GRAPHICS.

• simulator
• geometry
• genetic

PRODUCTION SYSTEMS AND PATTERN MATCHING.

• ROMAN1.CL Tanimoto. Roman numeral conversion with an unordered P.S.
• ROMAN2.CL Tanimoto. Roman numeral conversion with an ordered P.S.
• ROMAN3.CL Tanimoto. Roman numeral conversion with a discrimination net.
• MATCH.CL Matcher of Tanimoto. Attempt to find a correspondence between P and S, utilizing any special constructs appearing in P. Return an association list of bindings if successful; NIL otherwise.
• WINSTON, RULE BASED SYSTEM: BAGGER.
  1. allergy.lsp test, restaurant, Winston book.
  2. backward.lsp Winston, Backward Chaining.
  3. bagger.exp Winston, subroutines for CHAIN.
  4. bagger.lsp Winston, rules for restaurant
  5. bagger.ref Winston, BAGGER rules.
  6. bagger.txt Winston, BAGGER description and experiments.
• WINSTON, ZOO. Rule-based.
  1. zoo.lsp
  2. zoobk.exp
  3. zoobk.lsp
  4. zoobk.ref
  5. zoobk.txt
  6. zoofw.exp
  7. zoofw.lsp
  8. zoofw.ref
  9. zoofw.txt

ELIZA-LIKE PROGRAMS.

• SHRINK.CL Eliza-like program from Tanimoto.
• eliza.lsp Eliza-like program.
• doctor.lsp Simulated Psychiatrist. It is funny to have him talk to Eliza as his patient. See what will happen!
• HONEY.LSP One more, this is very good.
• SCRIPT.LSP I did not test it yet. Have fun.

SYMBOLIC DIFFERENTIATION AND SIMILAR RECURSIONS.

• MATCHL.CL Better Matcher from Tanimoto. Attempt to find a correspondence between P and S, utilizing any special constructs appearing in P. Return an association list of bindings if successful; NIL otherwise. This is an enhanced version of MATCH for LEIBNIZ.CL.
• LEIBNIZ.CL Production system for symbolic differentiation. From Tanimoto.

KNOWLEDGE REPRESENTATION.

• LINNEUS.CL Tanimoto. This program is described in Chapter 4 ("Knowledge Representation") of "The Elements of Artificial Intelligence Using Common Lisp," 2nd ed.

SEARCH.

• WINSTON, SEARCH. program support for Chapter 4, Nets and Basic Search
  1. search.exp
  2. search.lsp
  3. search.ref
  4. search.txt
• RECPSDF.CL Tanimoto. "Painted Squares" puzzle solving using Depth-First Search.
• PSDFS.CL Tanimoto. "Painted Squares" puzzle solving using an iterative version of Depth-First Search.
• DEPTHFS.CL Tanimoto. Depth-first search
• BREADTH.CL Tanimoto. Breadth-first search
• BESTFS.CL Tanimoto. Best-first search.
• UNIFCOST.CL Uniform-Cost search from Tanimoto.
• ASTAR.CL A star search algorithm from Tanimoto.
• GENETIC.CL Genetic Algorithm from Tanimoto.
• WINSTON, OPTIMIZE. Chapter 5, Nets and Optimal Search
  1. optimize.exp
  2. optimize.lsp
  3. optimize.ref
  4. optimize.txt

LOGICAL REASONING.

• PROVER.CL A verifier for propositions using Wang's algorithm. Tanimoto.
• UNIFY.CL Tanimoto. A Unification algorithm for literals in the Predicate Calculus, implemented in Common Lisp.
• PROLOG.CL Prolog in Lisp from Tanimoto.
• PROLIST.CL Experiments in list manipulation using the mock PROLOG interpreter. From Tanimoto.
• WINSTON, RESOLVE. Purpose: program support for Chapter 13, Logic and Resolution Proof
  1. resolve.exp
  2. resolve.lsp
  3. resolve.ref
  4. resolve.txt

PROBABILISTIC REASONING.

• INFNET.CL Probabilistic Reasoning from Tanimoto.

COMMONSENSE REASONING.

• CASE-BR.CL Tanimoto. Basic structures for a small demonstration of Case-Based Problem Solving.
• TEMPORAL.CL A demonstration of temporal reasoning using constraint propagation with James Allen's interval algebra. Tanimoto.

PLANNING.

• IDDFS.CL Tanimoto. Iterative Deepening Depth-First Search, applied to robot planning.
• WSPLAN.CL Tanimoto. World-space planner.
• POPLAN.CL A partial-order (non-linear) planner. Tanimoto.

LEARNING.

• INDUCTR.CL Tanimoto. Induces decision trees using the basic method of CLS and ID3. Demonstrates machine learning of classification rules from examples.
• PYTHAG.CL Tanimoto. "Pythagoras" -- a program that demonstrates heuristically-guided concept formation in mathematics.
• WINSTON, VERSION. Purpose: program support for Chapter 20, Learning by Managing Multiple Models
  1. version.exp
  2. version.lsp
  3. version.ref
  4. version.txt
• WINSTON, KD. program support for Chapter 19, Learning by Recording Cases
  1. kd.exp
  2. kd.lsp
  3. kd.ref
  4. kd.txt
• match.lsp Matcher from Winston.
• WINSTON, TRAIN. Purpose: program support for Chapter 23, Learning by Training Perceptrons
  1. train.exp
  2. train.lsp
  3. train.ref
  4. train.txt

NATURAL LANGUAGE UNDERSTANDING.

• PARSE.CL A top-down, backtracking parser for a context-free grammar from Tanimoto.
• STONEWLD.CL A "Stone World" and a natural language interface to it. Tanimoto.
• WINSTON, TOOLS. Purpose: program support for Chapter 29, Responding to Questions and Commands
  1. tools.exp
  2. tools.lsp
  3. tools.ref
  4. tools.txt
  5. tools.usr

VISION.

• CONNECTD.CL A program for connected components labelling. From Tanimoto.
• EDGES.CL Tanimoto. A demonstration of edge detection and related image processing in Lisp.
• RAMER.CL Tanimoto. A Common Lisp implementation of Ramer's recursive algorithm for approximating a polygon with another polygon.

NEURAL NETWORKS.

• PERCEPTR.CL Perceptron.
• BACKPROP.CL Backpropagating Neural Net.

EXPERT SYSTEMS.

• SHELL.CL Shell of an Expert System.

GAMES.

• ab.lsp Alpha-Beta procedure, Winston.
• colors.lsp Winston. Colors.
• WINSTON, CONTEST. Trees and Adversarial Search. Uses Alpha-Beta.
  1. contest.exp
  2. contest.lsp
  3. contest.ref
  4. contest.txt