/cs/dept/course/2008-09/F/4402

Course Work:

• Assignment 1, 10%;
  deadline: October 18
  
• Assignment 2, 10%;
  deadline: February 19
  
• Assignment 3, 10%;
  deadline: cancelled
  
• Midterm, 30%, Oct. 28
• Final project 40%, end of exams.

Project

The first part of the project is a parser for Horn language. Your parser should be able to:
1. do syntax verification of clauses
2. represent clauses using preselected data structures.

Notes for part 1:
1. when selecting data structures for terms and clauses please keep in mind the unification algorithm and the algorithm for computing resolvents;
2. if you want to adopt the "standard" list notation used by most Standard PROLOG systems (i.e., the "[...]" notation), then your parser should be able to represent such lists as terms (cf. the discussion in Lloyd's book on page 9 where lists are represented in terms of the two argument function ".").

Documentation for part 1:
1. provide details on the data structures for terms and clauses as well as on syntax error handling;
2. give examples and provide test results.

This part of the project has to be submitted by the end of October.

Minimal list of predefined predicates and functions to be implemented:

• predicates: consult, halt, is, unify
• functions: list formtaion, arithmetic operations +. *, -.

Note: a student cannot receive a passing final grade without receiving at least 14% on midterm and 20% on the final exam.