CS251: Logical Structures
Syllabus  Fall 2002
Course:
CS251: Logical Structures
Course Reference Number: 13859
Instructor:
Harry Porter
EMail:
harry@cs.pdx.edu
Office at PSU: 11506 (Fourth Ave Bldg)
Office Phone: 5037254039
Office hours: directly after class meetings and by arrangement
Grader:
Name: Karen Chan
EMail:
chank@cs.pdx.edu
Course Description:
Introduction to logic from a computational viewpoint. Propositional calculus, firstorder predicate calculus, formal reasoning. Resolution and natural deduction. Applications to program correctness and automatic reasoning. Proof techniques. The Prolog language is introduced and used for programming experiments.
Major topics covered in the course:

Elementary Logic: propositional calculus, formal reasoning.

Predicate Logic: first order predicate calculus, formal reasoning.

Applied Logic: proving programs correct, higher order logics.

Computational Logic: resolution, unification, automatic reasoning.

Prolog: Laboratory experiments will use the Prolog language.
CS 251 is the second term of the three term sequence CS 250251311. The main goal of the sequence is that students obtain those skills in discrete mathematics, logic, and computability that provide a foundation for the study and practice of computer science. A second goal is that students become familiar with Maple and Prolog as tools for doing laboratory experiments in discrete mathematics, logic, and computability.
Prerequisites:

CS 250  Discrete Structures
When and Where:
Tuesday & Thursday, 12:00 Noon  1:50 PM
Cramer Hall  Room 383
First Class: Tuesday, October 1, 2002
No Class: Thursday, November 28, 2002 (Thanksgiving)
Textbooks:

Discrete Structures, Logic, and Computability (Second Edition), by James L. Hein, Jones and Bartlett (2002).
For Errata to the textbook, click here:
pdf

Prolog Experiments in Discrete Mathematics, Logic, and Computability (January, 2002), by James L. Hein. 160 pages.
Bound copies are available at Smart Copy
(on 6th Ave, next to Hot Lips)
or you can download the
pdf version.
Lecture Notes:

Students may puchase copies of the lecture transparencies,
roughly every week after the lectures,
from Smart Copy
(on 6th Ave, next to Hot Lips).

Downloadable MS Word versions of the transparencies are at
www.geocities.com/arias_computing/packets.htm.
Exams:

Quiz #1: Tuesday, October 15

Quiz #2: Tuesday, October 31

Quiz #3: Tuesday, Novemeber 11

Quiz #4: Tuesday, November 26

Final Exam: Thursday, December 12, 10:15AM  12:05PM
The inclass quizes will be 45 minutes and will be closed book and closed notes.
The final exam will be comprehensive, closed book, and closed notes. The quizes and final may test on material covered only in class and on material covered only in the reading assignments.
Lab Exercises and Notebook:
Be sure you have a current and active account in the Computer Science Department.
(See
www.cat.pdx.edu/users
for more info.)
Several lab experiments are assigned (approximately one experiment per week) to reflect the classroom work. The experiments are similar in scope to homework exercises.
We will be using Sicstus Prolog on the computer science machine "sirius.cs.pdx.edu".
By default, Sicstus Prolog is not accessible in new accounts. From your account, type the Unix command "addpkg". Then choose to add Sicstus Prolog. You should now be able to type "sicstus" at the Unix prompt.
The following web addresses contain information on Prolog.
You will maintain a lab notebook regarding your work with the Prolog language, and this will be handed in several times during the term.
Lab experiments must be written up in a hard cover "compositionstyle" notebook.
Please purchase a composition notebook measuring 9.75" by 7.5", with 80 pages
(no spiral notebooks).
Students should work independently (not together) on the lab assignments.
Homework Assignments:
There will be weekly homework assignments. These will be due on Tuesday at the beginning of class. Late homeworks will not be accepted without prior approval.
The homeworks will not be graded. Nevertheless, they must be done and handed in. You should check your answers by looking in the back of the textbook.
Students should work independently (not together) on the homework assignments.
Mailing List:
There is a mailing list for this class, which you should subscribe to. Send an email to
majordomo@cs.pdx.edu.
Send this email from the account which you want to be on the mailing list. The subject line should say:
subscribe cs251
You should get a confirmation reply within a few minutes. You will need to read this and respond a second time.
Attendance:
Attendance in class is mandatory. Attendance will be checked periodically and will count for part of your grade.
Grading:
Your grade will be determined according to the following percentages. These are tentative; I may change them.

Lab notebook 15%

4 inclass quizes 50%

Final exam 25%

Homeworks 5%

Attendance 5%
My PointSystem of Grading:
I will compute your grade as follows.
Each quiz will be worth some number of points. For example, quiz #2 might be worth 60 points. Each quiz will constitute a certain percentage of your grade. For example, quiz #2 might be worth 12.5% of your final grade. The actual number of points you make on an individual quiz will then be divided by the number of points earned by the high scorer for that quiz and the result will be multiplied by the percentage weight of the quiz to give a normalized number of points. For example, if you got 43 points on quiz #2 and the highest score on the quiz was 55 points, you would get 9.77 normalized points, i.e., (43/55) * 12.5%.
For the lab notebook and the final exam, I will compute your normalized points in the same way, based on the percentage weights for the notebook and the final. Summing the normalized points from each of your quizes, the notebook, and the final, you will then have a net score between 0 and 100.
I will then sort the students on net score and give students with more points better grades. Grading will be based on a curve; in other words, I will select the range for A's, B's, etc., after seeing how the net scores distribute. I may vary the percentage weights of the individual exams at the end of the term (keeping within the general percentages listed above), if I feel that some deserve larger weights in the final score. I will also take the homeworks and attendance into account in some asyet undetermined way.
Incompletes will not be given.
Snow Closure Info:
For inclement weather information, call the University switchboard, 7253000,
for a recorded message about universitywide class cancellation.
Class Schedule:

Week 1  10/01/02 and 10/03/02

Reading: Text 6.16.2 and Experiments 1.12.4.

Homework: 6.2: 1ac, 2a, 3, 5, 7ace, 8aceg, 9ace, 10aceg, 11ace, 12aceg, 13a, 14ace, 15ace.

Week 2  10/08/02 and 10/10/02

Reading: Text 6.36.4 and Experiments 2.52.9.

Homework: 6.3: 1a, 2, 3a, 4, 5acegi, 6aceg, 7acegik, 8a, 9a. 6.4: 1, 3ac.

Week 3  10/15/02 and 10/17/02

Quiz #1: Tuesday 10/15/02

Reading: Text 7.1 and Experiments 3.13.2.

Homework: 7.1: 1a, 2ace, 3a, 4, 5ac, 6, 7a, 8a, 9a, 10a, 11ace, 12aceg, 13a, 14ac, 16aceg, 17ac.

Week 4  10/22/02 and 10/24/02

Reading: Text 7.2 and Experiments 3.33.4.

Homework: 7.2: 1ace, 2ac, 3ac, 4ace, 5ace, 6a, 7ace, 8aceg, 9a, 10aceg.

Lab Notebook due Thursday 10/24/02:

2.5 Family Trees: 1, 2, 3a.

2.6 Interactive Reading and Writing: 1, 2.

3.1 The Ancester Problem: 1, 2, 3.

3.2 Writing and Summing: 1, 2, 3, 4, 5.

Week 5  10/29/02 and 10/31/02

Quiz #2: Tuesday 10/29/02

Reading: Text 7.3 and Experiments 4.14.2.

Homework: 7.3: 1ace, 2, 3a, 5, 6aceg, 7ace, 8ace, 9ac, 10.

Week 6  11/05/02 and 11/07/02

Reading: Text 8.18.2 and Experiments 4.34.4.

Homework: 8.1: 1, 3, 4ace, 5, 6a, 7ace, 8ac, 9a. 8.2: 1, 2a, 3a, 4ac, 5a, 6a.

Week 7  11/12/02 and 11/14/02

Quiz #3: Tuesday 11/12/02

Reading: Text 8.2 and Experiments 5.15.2.

Homework: 8.2: 7, 8a, 9, 13ac, 14ac, 15ac, 16ac, 17ac, 18a.

Lab Notebook due Thursday 11/14/02:

4.1 Negation and Inference Rules: 1, 2, 3, 4, 5.

4.2 The Blocks World 1, 2.

4.3 Verifying Arguments in FirstOrder Logic: 1, 3.

Week 8  11/19/02 and 11/21/02

Reading: Text 8.3 and Experiments 5.35.4.

Homework: 8.3: 1acegi, 2a, 3ace, 5, 7ac, 8, 9a, 10a.

Week 9  11/26/02

Quiz #4: Tuesday 11/26/02

Reading: Text 9.1 and Experiments 6.16.3.

Homework: 9.1: 1ace, 2, 3ac, 4ace, 5ac, 6ac, 7, 8ace, 9ac, 10ace, 12a, 13ace.

Week 10  12/03/02 and 12/05/02

Reading: Text 9.2 and Experiments 4.54.6.

Homework: 9.2: 1ac, 2ac, 3ab, 4ac, 5a, 6a, 7ac, 8aceg.

Lab Notebook due Thursday 12/05/02:

5.2 Sets and Bags of solutions to a Query: 1, 2, 3, 4.

5.4 List Operations: 3, 5, 7, 9.

6.3 Simple Ciphers: 1, 2, 3.

Week 11:

Final Exam: Thursday 12/12/02, 10:1512:05
Problems / Comments on This Web Page