CSC491 - Foundations of Logic Programming
Spring 2011
Description
In this course we will explore the mathematical foundations of programming
with first order logic. We will start by looking and models and semantics of
logic formulas. We continue to look at the herbrand universe and simple fix point
semantics. Next we look at resolution, the mechanized version of the modus ponens.
Negation and negative knowledge are then explored.
The goal of the course is to give you a deeper insight into logic programming and in
particular programming with the language Prolog.
We will be using this book.
Announcements:
[3/9/11] Posted problems for chapter 2.
[3/2/11] Posted Dave's slides and posted some additional exercises.
[2/16/11] posted assignment
[2/16/11] posted PDFs of handouts below.
[2/14/11] Please sign up for a presentation slot.
Presentation Schedule
Week Presenter Sections
---- --------- --------
2/16 David 1.1, 1.2
2/23 David 1.3, 1.4, 1.5
3/2 Aseel 2.1, 2.2
3/9 Aseel 2.3, 2.4
3/16 Jake 3.1, 3.2, 3.3
3/23 spring break
3/30 Arthur 3.4, 3.5, 3.6
4/6 Yanina 4.1, 4.2, 4.3
4/13 Cora 4.4, 4.5
4/20 David 5.1
4/27 Rich 13.1, 13.2, 13.3
Documents of Interest
Assignments:
The following are suggested problems you should take a look at in order to further deepen
your understand of the material. I will not collect them or grade them.
- Do problems 1.1, 1.3, 1.6, 1.15
- Do problems 2.1, 2.3, 2.5, 2.6
Instructor:
Dr. Lutz Hamel
Tyler, Rm 251
Office Hours: Tuesday/Thursday 11-noon
email: hamel@cs.uri.edu