2nd Semester, 2005-2006

John Paul Vergara, PhD

- Final Exam coverage: First-Order Resolution and Naive-Bayes Classifiers. Exempted (A-standing) from the Final Exam: Carrascoso, La Chica, and Lim. The exam is optional. You may consult me for your current standings.
- Project 2 hints:
- lisp code that elimates
**equivalent**operators. - I suggest the following stages: remove equivalent, remove implies, move nots, generate clauses

- lisp code that elimates
- Project 2 (Lisp) deadline extended
to Friday, March 3.

Here are sample calls and expected output - Lisp exercises
- Midterm exam on Feb 17: 3:30-5pm. Here are sample exams: midterm last year finals last year .
- Input files are now available:

sample input file 1 , output fie

sample input file 2 , output fie - Another clarification for project 1: goal state is reached if middle and right rooms are clean AND vacuum cleaner is empty.
- The Specs have been updated to include a clarification: Moves that do not change state are considered invalid-- this will reduce effective branching factor.
- Specs (Draft) for project 1, due Dec 21. Keep posted for updates and sample files.
- Nov 25: For today, work on the following exercise in searching. Be prepared for a quiz on the subject matter. If I arrive early from my meeting, we will have the quiz at 4pm. If not, we will have the quiz next Wednesday.
- Welcome to this website! Visit this link regularly for course material, announcements and updates

- Project 1 (Searching)

sample input file 1 , output fie

sample input file 2 , output fie - Project 2 (Lisp)

- AI and Agents: PDF , PPT
- Problem Solving:
PDF ,
PPT

Demo of Search Strategies - Informed Search Strategies: PPT
- Adversarial Search: PPT
- Some sample problems that we will formulate as search problems in class. A demonstration of Depth-First Search using recursion that solves the Pegs problem: dfs.cpp and a sample input file .
- Logical Agents: PPT
- Inference Algorithms: PPT
- First Order Logic: PPT
- Inference in First Order Logic: PPT
- Resolution in First order Logic: PPT
- Crash Course in Lisp ;

Handouts: 1-page Quick Reference by Marty Hall, Tutorial by Pierce & Chapiro ;

GNU Common Lisp (zipped), Sample lisp code - Prolog
- Exercises
given today (22 Feb) cannot be encoded
in Prolog easily (or at all) because Prolog works best with horn clauses
(a1 and a2 and a3 and ... => b,
where all a# and b are positive terms).
Nevertheless, here are the answers--
animals ,
lapuplapu --
that I have come up with.
Note the
*fix*I used when dealing with negated terms. Stay tuned for more doable examples :-).

- Exercises
given today (22 Feb) cannot be encoded
in Prolog easily (or at all) because Prolog works best with horn clauses
(a1 and a2 and a3 and ... => b,
where all a# and b are positive terms).
Nevertheless, here are the answers--
animals ,
lapuplapu --
that I have come up with.
Note the
- Knowledge Representation: PPT
- Classifiers: PPT , Demo (Microsoft Excel) of the different approaches using a sample dataset.