LUP – Logical reasoning and programming

This page provides information for the class B4M36LUP - Logické usuzování a programování as well as its English-language counterpart BE4M36LUP - Logical reasoning and programming, which are taught jointly. The lectures are held in English unless all participants speak Czech.

The course's aim is to explain selected significant methods of computational logic. These include algorithms for propositional satisfiability checking, first-order theorem proving and model-finding, and logical programming in Prolog,. Time permitting, we will also discuss some complexity and decidability issues pertaining to the said methods.

Lecturers: Karel Chvalovský, Ondřej Kuželka

Lab instructors: Karel Chvalovský, Radomír Černoch

Course supervisor: Filip Železný

Lectures

Date Lecturer Topic Resources
1 20.9. Chvalovský Introduction and propositional logic (recap) slides
2 27.9. Chvalovský SAT solving—resolution and DPLL slides
3 4.10. Chvalovský SAT solving (cont'd)—CDCL slides
4 11.10. Chvalovský SAT solving (cont'd) slides
5 18.10. Chvalovský FOL and SMT slides
6 25.10. Chvalovský SMT (cont'd) and quantifiers in FOL slides
7 1.11. Chvalovský First-Order Logic—Resolution slides
8 8.11. Chvalovský Resolution, equality, and model finding slides
9 15.11. Chvalovský Proof assistants slides
10 22.11. Kuželka Introduction to Prolog slides
11 29.11. Kuželka Recursion, lists slides
12 6.12. Kuželka SLD trees, cut, negation
13 12.12. Kuželka Search in Prolog
14 3.1. Kuželka Answer set programming

Note that the titles and topics of future lectures are tentative and subject to change.

Labs

Date Tutor Topic Resources
1 20.9. Chvalovský General discussion and exercises on propositional logic exercises
2 27.9. Chvalovský SAT Solving I exercises
3 4.10. Chvalovský SAT Solving II exercises
4 11.10. Chvalovský SAT Solving III exercises,
notebooks
5 18.10. Chvalovský FOL and SMT exercises
6 25.10. Chvalovský SMT (cont'd) and FOL (basic notions) exercises,
smt problems
7 1.11. Chvalovský FOL and resolution exercises
8 8.11. Chvalovský Resolution and ATPs exercises,
TPTP problems
9 15.11. Chvalovský Isabelle exercises
10 22.11. Černoch Prolog as a database exercises
11 29.11. Černoch Lists in Prolog exercises
12 6.12. Černoch Cut in Prolog exercises
13 13.12. Černoch Search in Prolog exercises

Tasks

Assigned Deadline Name BRUTE label Description Points
1 13.10. 11.11. Light Up task1 20
2 15.11. 14.12. Proof systems task2 15
3 22.11. 2.1. Prolog search task3 15

Grading

Note that although we all hope for the best, it may happen that we will have to adjust the following requirements to the evolving coronavirus situation.

Labs

There will be 3 tasks (for 20, 15, and 15 points) assigned during the semester. You submit your solutions through BRUTE. Late submissions are penalized.

An assessment is awarded if you receive at least 25 points for all your solutions.

Examination

The exam will be a written test (50 points), and to pass, you need to get at least 25 points. You are eligible for a grade only after you receive the assessment for labs. However, you can still attend the exam.

The final grade is based on the sum of points you receive for labs (max. 50 pts.) and the exam (max. 50 pts.) and follows university regulations:

Points Grade
100-90 A 1 excellent
89-80 B 1.5 very good
79-70 C 2 good
69-60 D 2.5 satisfactory
59-50 E 3 sufficient
<50 F 4 failed

There are many general introductions covering basic notions from propositional and first-order logic. For example, the Open Logic Project is freely accessible. Decision Procedures (PDF is available from the CTU network) covers many topics from SAT and SMT. Another relevant book available from the CTU networks is Mathematical Logic for Computer Science.

SAT/SMT

TPTP

Automated Theorem Provers

Model Finders

courses/lup/start.txt · Last modified: 2021/11/28 23:34 by kuzelon2