Foundations of Logic Programming
From International Center for Computational Logic
Foundations of Logic Programming
Course with SWS 2/0/0 (lecture/exercise/practical) in WS 2020
Lecturer
SWS
- 2/0/0
Modules
Examination method
- Oral exam
Exams
- All examinations will be oral remote exams.
- The exams will take place on the 5th of March (Friday).
- In a first step, students have to register for the exam by following the usual procedure for their study program and module. For students in the CMS program, it is sufficient to register via SELMA.
- In a second step, once the examination date is known, students must contact the CL secretary (ramona.behling@tu-dresden.de) to ask for a time slot and, if applicable, submit the registration forms they obtained from the examination office. CMS students do not need to submit registration forms.
- The duration of exams for KR will be 20 minutes, unless another length is required and clearly stated in the email to the KBS secretary.
- Exams are "closed book" (i.e., additional materials and lecture notes are not permitted).
- Registration with the secretary must happen happen until 26th of February the latest.
Q&A Session, 1st of February
Will start at 16:40 under the following zoom link:
https://tu-dresden.zoom.us/j/83807887109?pwd=Qjl1ZFhDa1ZMQ3RhM2lHS09MYnNVdz09
Description
Logic programming supports the declarative programming paradigm, which describes the solution logically rather than how to compute it. This introductory course covers the fundamental topics of logic programming such as rule-based syntax, procedural and declarative semantics, negation, the logic programming language PROLOG, and answer set programming (ASP).
Schedule and Location
During the winter term 2020/21, the lecture will be virtual.
All dates are published on this page (see Dates & Materials above)
- The weekly lecture sessions will be prerecorded as video and uploaded here ahead of the corresponding Monday.
- Krzysztof R. Apt. From Logic Programming to Prolog. Prentice Hall 1997.
- Martin Gebser, Roland Kaminski, Benjamin Kaufmann and Torsten Schaub. Answer Set Solving in Practice. Morgan and Claypool 2012.
Subscribe to events of this course (icalendar)
| Lecture | Introduction | DS6, October 26, 2020 in Asynchronous | File |
| Video | |||
| Lecture | Unification | DS6, November 2, 2020 in Asynchronous | File |
| Video | |||
| Lecture | Procedural Interpretation | DS6, November 9, 2020 in Asynchronous | File |
| Video | |||
| Lecture | Pure Prolog | DS6, November 16, 2020 in Asynchronous | File |
| Video | |||
| Lecture | Negation: Procedural Interpretation | DS6, November 23, 2020 in Asynchronous | File |
| Video | |||
| Lecture | Declarative Interpretation I | DS6, November 30, 2020 in Asynchronous | File |
| Video | |||
| Lecture | Declarative Interpretation II | DS6, December 7, 2020 in Asynchronous | |
| Video | |||
| Lecture | Negation: Declarative Interpretation | DS6, December 14, 2020 in Asynchronous | File |
| Video | |||
| Lecture | Termination | DS6, January 4, 2021 in Asynchronous | File |
| Video | |||
| Lecture | ASP: Introduction | DS6, January 11, 2021 in Asynchronous | File |
| Video | |||
| Lecture | ASP: Stable Models | DS6, January 18, 2021 in Asynchronous | File |
| Video | |||
| Lecture | ASP: Solving | DS6, January 25, 2021 in Asynchronous | File |
| Video | |||
| Lecture | Q&A | DS6, February 1, 2021 in Video conference | |
Calendar
