|
Comp. Sci. 513
|
Logic in Computer Science
|
Fall, 2011
|
|
|
Meeting times: Tu-Th 2:30 - 3:45, LGRT 202
Instructor: Neil
Immerman
| Office Hours |
| Neil Immerman, CompSci Bldg 374,
immerman@cs.umass.edu | Tue 1:15 - 2:15; Wed 2:30 - 3:30, and by appointment.
|
Handouts:
If some of the symbols that I have been using seem Greek to you, here
is a Symbol
Table to help you remember what they mean.
Notes:
- This year we will be using Piazza to
encourage discussion about the course material, homeworks, etc. Please check it out.
- There is a lovely little book, germane to this course:
LOGICOMIX: an Epic Search for
Truth by Apostolos Doxiadis and Christos Papadimitriou with
art by Alecos Papadatos and Annie Di Donna. I urge you to get a copy
and read.
What is this course about?
Rigorous introduction to mathematical logic from an algorithmic perspective. Topics include:
Propositional logic: Horn clause satisfiability and SAT solvers; First Order Logic:
soundness and completeness of resolution, compactness theorem.
We will use the Coq theorem prover and Datalog.
Prerequisites:
CMPSCI 311
Requirements Class participation, biweekly problem sets, a midterm, and a
final project.
Required text: Uwe Schoning,
Logic for Computer Scientists, 2008 Birkhauser, paperback.
We
will do this whole book, and read various papers as well.
This course provides credit towards the
Five
College Logic Certificate Program.