In this assignment you will represent a problem instance in first-order logic, as defined by Ginsberg in chapters 6-8 of the text. The notation will be as in the text, except that ASCII syntax will replace the special symbols, as follows
If you need more notation to describe the instance, please feel free to define and then use it.
Syntax Operation not negation and conjunction or disjunction implies implication iff equivalence a[b] subscripting (``a sub b'') forall universal quantification exists existential quantification
The problem instance is the Zebra Problem, defined below. The subscript notation defined above is to help with the locational data: you may also use simple arithmetic ("+" and "-") in subscripts. You may also quantify over indices as needed.
For each of the 14 English sentences in the instance description, write a set of logical sentences which are equivalent. For example, sentence 5 might be rendered as
forall i . green(House[i]) iff ivory(House[i-1])or as
(green(House2) and ivory(House1)) or (green(House3) and ivory(House2)) or (green(House4) and ivory(House3)) or (green(House5) and ivory(House4))You may need to start with some general sentences about the problem statement.
Homework should be submitted by e-mail to <bart@cs.pdx.edu>. The words "CS441/541 HW1" should appear somewhere in the subject line. The homework submission should be a writeup in ASCII answering all questions posed by the assignment, in the requested format Remember, if I can't understand your submission, I can't give you credit for it.
I'd like you to do this assignment by yourself. If you do work with anyone else, you must credit them in your submission.
The infamous Zebra Problem concerns five houses, each of a different colour and inhabited by men of different nationalities, with different pets, drinks and cigarettes.
Thanks to René Stolp <rst@cs.tu-berlin.de> for his class web page http://www.epita.fr/~n-da_y/backjumping1.html which gives roughly the above statement of the problem.