An introduction to area of deductive databases and logic
programming. Topics include: Logic programming and Prolog,
Syntax of logic programs and deductive databases, Model-theoretic,
Proof-theoretic and Fixpoint semantics, Operational semantics such as
bottom-up evaluation and SLD-resolution techniques, Query optimization
in deductive databases, Negation in deductive databases,
Applications of deductive databases, Constraint checking in deductive databases.
Textbooks
- Logic, Programming and Prolog,
Ulf Nilsson and Jan Maluszynski (2nd Edition), 2000.
Online Edition.
Individual Chapters will be provided. To save trees,
kindly print only the chapters we will cover in class.
For reference, you may keep the online text with you.
- Logic for Computer Scientists, Uwe Schoning.
pdf.
- LogicBlox Documentation
book
- Additional notes and papers will be provided.
Grading Policy: The grading will be based on the following components:
- Three exams worth 25% each
- Homework assignments and Programming Projects worth 25%.
The final letter grade will be determined based on the following
criteria:
| A |
90 and above |
| B |
80 thru 89 |
| C |
65 thru 79 |
| D |
50 thru 64 |
| F |
less than 50 |
Last date to withdraw: 11 October, 2016 (Tuesday).
Academic Honesty Policy:
All work submitted for grading must be
student's own work. Plagiarism will result in a score of zero on the test
or assignment, or dismissal from the course.
NOTE:
This syllabus represents a general plan for the course and
deviations from this plan may be necessary during the duration of the course.
Raj Sunderraman
8/26/2016