COSC 387 Project 4

COSC 387: Artificial Intelligence

Project 4
Spring 2008

Due: Wed, Nov 24 @ 10 P.M.
13 points

Using a language of your choosing, implement Neapolitan's algorithm for probability propagation in trees. Your implementation must be general, meaning that it must work for any tree-structured Bayesian network.
Test your implementation using the example from lecture involving the patients who participated in a drug study. Implement this test as example1. It should instantiate the evidence that the doctor has encountered a cured patient and print the probability that the patient was part of the drug study.
Test your implementation using Neopolitan's &ldquot;cheating spouse example&rdquot; (Section 6.2.2). Implement this test as example2. It should instantiate the evidence that the spouse is reported seen dining with another and print the probability that a strange man/lady calls on the phone.

Instructions for Electronic Submission

In the header comments of the primary file, provide the following information:

;;;;
;;;; COSC 387 Project 4
;;;; Name
;;;; E-mail Address
;;;; Platform: Windows, Linux (seva), etc.
;;;; Lisp Environment: clisp, gcl, cmucl
;;;;
;;;; In accordance with the class policies and Georgetown's Honor Code,
;;;; I certify that, with the exceptions of the course materials and those
;;;; items noted below, I have neither given nor received any assistance
;;;; on this project.
;;;;

You'll be using Blackboard to submit your assignments. Please keep in mind that Blackboard lets you submit only once.

You must submit your project before 10 PM on the due date.

Plan B

If something goes wrong with Blackboard, then send your project as an attachment to an e-mail to me.