CISC 310   -   Logic and Programming   -   Fall 1999

T/Th 3:30-4:45, Smith 220
 
 

 
Instructor: K. Vijayashanker  Grader: Carl Valentin
Office: Room 202, The Green House (77-79 E. Delaware) 
Hours: Tuesday, Thursday 10:00-11:30 
Phone: 831-1952 
Email: vijay@cis.udel.edu  Email: valentin@udel.edu

Textbook

Logic For Computer Scientists, by Uwe Schoening

Additional Reference

Programming in Prolog: Fourth Edition, by W. F. Clocksin and C. S. Mellish

Syllabus and Course Description

We will begin with propositional logic to clarify the ``meaning'' of logical connectives. After studying the syntax and semantics of this logic, we will consider a theorem-proving method called resolution. This involves the study of particular representations of formulae called clauses . We will consider its relevance and that of resolution for logic programming. Our study of propositional logic will be based on material in Chapter 1 of the textbook. Chapter 2 of the textbook concerns (first-order) predicate logic. Building on propositional logic, we will now focus on the notion of quantification. Again, our study will start with the syntax and semantics of this logic. Next, we will consider how the propositional resolution method can be extended to obtain the resolution method for predicate logic. Tighter connections will then be made with the logic programming language, Prolog, and material in Chapter 3 of the textbook. For predicate logic, the material from the 2nd chapter of the textbook will be used (Sections 2.3 and 2.4 will not be covered in detail).

Grading

Homeworks:
There will be about 4 written homeworks. They will have to be turned in at the beginning of the class on the due date. For assignments turned in late (without prior permission), twenty percent will be subtracted for one class day, and forty percent for two class days. No assignment will be accepted more than two class-days late.

All homework assignments have to be completed individually. Students should not collaborate among themselves in answering the homework assignment questions.

Programs:
There will be 3-4 prolog programming assignments. Programming assignments are also due at the start of class on the due date. Assessment of penalty for late submission is the same as for the written homework. Also, programming assignments will not be accepted more than two class-days late.

All programming assignments have to be completed individually. Students should not collaborate among themselves while working on the programs.

Exams:
There will be a final exam. Instead of a mid-term exam, we will have several quizzes. We will have an in-class quiz approzimately once in two weeks. Quizzes will be announced at least a week in advance. Each quiz will be for 10 minutes and will start at the beginning of the class period.
Overall Course Grade:
    35% Final

    25% Quizzes
    20% Programming assignments
    20% Homework

Handouts

Most of the handouts will be postscript files. They will be made available and can be printed from this page (http://www.cis.udel.edu/~vijay/cis310/cis310.html).

Prolog Handout 1: Introduction to prolog


Prolog Handout 2: List processing


Prolog Handout 3: Introduction to BinProlog3.0


Prolog Handout 4: Some Additional Features of Prolog


Homework 1 (due April 13, 2000)


Last Prolog Homework


Facts for the Last Prolog Homework



K Vijayashanker
Last modified: Mon May 15 12:42:51 EDT 2000