Search
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ý
Note that the titles and topics of future lectures are tentative and subject to change.
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.
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.
The exam will be a written test (50 points), see a sample, and to pass, you need to get at least 25 points. You are eligible for a grade only after receiving the labs assessment. 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:
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.