Theory and Applications of Truth Maintenance Systems
Lecture nodes
Lisp code
- Student data base example
- Missionaries and cannibals example with depth-first search
- Missionaries and cannibals example with breadth-first search
- A simple breadth-first search example
- A simple depth-first search example
- A simple best-first search example
- A simple hill-climbing search example
- Search using association lists for representing data
- Search using structures for representing data
- Iterative breadth-first search example from the book
- Recursive breadth-first search example from the book
- Beam search example
- A forward chaining algorithm (adapted from Winston & Horn).
- A backward chaining algorithm (adapted from Winston & Horn).
- The Boston subway problem solver components:
search.lsp,
variants.lsp,
subways.lsp,
and boston.lsp.
Here is an
example run of this program.
- Additional files for the Abgebra problem solver (search.lsp and variants.lsp
are the same as in the Boston subway problem solver):
match.lsp,
simplify.lsp,
and algebra.lsp.
- The TRE components:
tinter.lsp,
data.lsp,
rules.lsp,
unify.lsp, and
a test case for it,
treex1new.lsp.
- The FTRE components (NOTE: This code will only run with Allegro CL)
finter.lsp,
fdata.lsp,
frules.lsp,
unify.lsp,
funify.lsp,
fnd.lsp,
fnd-ex.lsp,
fqueens.lsp,
fqrule.lsp,
ftrestart.lsp,
ftrestartNQ.lsp.
!!! To run the two example applications, review and modify ftrestart.lsp (KM* system: a complete implementation) and ftrestartNQ.lsp (N-Queens problem) to adjust them to your personal set-up. Also a similar change is needed in fnd-ex.lsp
and fqueens.lsp !!!
- The JTMS components:
jtms.lsp and
jtms-ex.lsp
- A non-monotonic TMS example
Assignments
Return to Zlatareva's Home Page