Final exam 

Submit by January 5, 2008 by e-mail to zlatareva@ccsu.edu with a copy to 
gurok@aol.com

Also, please make sure that I have your reasearch paper in a readable form 
by January 5, 2008. Final grades will be delivered to the office and e-mailed 
to you around January 10, 2008.

***********************************

Please remember that this is a test, and everybody must work on his own.

Feel free to submit your test in either Bulgarian or English.


***********************************


Problem 1: Describe the Boolean Constraint Propagation (BCP) algorithm and
illustrate how it works on the following puzzle:


	E A T
   +
      T H A T
     __________

    A P P L E

Define the initial assumptions, constraints, and show how the BCP process
is carried out.


Problem 2: Describe ATMS (representation, labels, update algorithms).
Compare ATMS and CTMS. Can ATMS handle defaults (recall that
one of the goals of TMSs is to support default reasoning)? If yes, explain.
You may use an example to illustrate your answer. 


Problem 3: Explain the idea behind model-based diagnosis as an alternative 
to rule-based diagnostic systems.