CS570 Knowledge Engineering and Building Problem Solvers
- 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:
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):
- The TRE components:
a test case for it,
- The FTRE components (NOTE: This code will only run with Allegro CL)
!!! 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:
- A non-monotonic TMS example
Return to Zlatareva's Home Page
- Introductory readings:
- Homework 1 problems.
- Homework 2 problems.
- Midterm test problems.
- Homework 3 problem.
- Homework 4: assigned article, write a paper and give a
presentation in class. Paper is due the end of the semester,
the presentation as scheduled.
- Research project: as explained in the course outline,
deadline - the end of the semester.
- Final exam questions.