METUComputer EngineeringSpring 1994

Instructor: Cem Bozsahin

textbook: Logic for Computer Science, by Reeves and Clarke, Addison-Wesley, 1990.

Prereq.: CENG 224 or permission of the instructor.

Topics: Standard logic and many other non-standard logics have found their applications in Computer Science subjects such as programming language design and implementation, software verification, artificial intelligence, communicating processes, deductive databases, etc. The main theme of the course can be called 'applied logic'. After an overview of propositional and first-order (i.e, classical) logics, we will study how formal concepts of logic can be transformed into algorithms that can be used for computer programming. We will study the following:

• Overview of propositional logic.
• Algorithms for implementing deduction in propositional logic.
• Overview of first-order logic.
• Algorithms for implementing deduction in first-order logic. Clausal forms in logic.
• Resolution, unification and the logical foundations of logic programming.
• Modal logic, Intuitionistic logic, Temporal logic and their use in computer science.

We will cover chapters 1-4, 7-8 from the text, with some sections omitted. I will provide additional material to augment the text book.

evaluation:

Notes: 1. no make-up exams; Let me know in advance if you are going to miss an exam.

2. Exams will cover portions of the text and the material covered in class. It is your responsibility to keep track of announcements (homework, project, etc.) in class.

3. Homeworks are due in one week from the day announced in class. Late homeworks cost 25%per week day.

• About this document ...