IA008 Computational Logic

Faculty of Informatics
Spring 2023
Extent and Intensity
2/2/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium).
Teacher(s)
Dr. rer. nat. Achim Blumensath (lecturer)
Guaranteed by
Dr. rer. nat. Achim Blumensath
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Thu 16. 2. to Thu 11. 5. Thu 10:00–11:50 D1
  • Timetable of Seminar Groups:
IA008/01: Tue 14. 2. to Tue 9. 5. Tue 12:00–13:50 C525, A. Blumensath
IA008/02: Tue 14. 2. to Tue 9. 5. Tue 14:00–15:50 C525, A. Blumensath
IA008/03: Wed 15. 2. to Wed 10. 5. Wed 12:00–13:50 C416, A. Blumensath
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 111 student(s).
Current registration and enrolment status: enrolled: 24/111, only registered: 0/111, only registered with preference (fields directly associated with the programme): 0/111
fields of study / plans the course is directly associated with
there are 52 fields of study the course is directly associated with, display
Course objectives
At the end of the course students should be familiar with main research and applications in computational logic; They will be able to use automatic provers for propositional and predicate logic and also for its extensions; They will be familiar with, and able to use, methods for inductive inference in those logics;
Learning outcomes
After successfully completing this course students should be familiar with several logics, including propositional logic, first-order logic, and modal logic. They should be familiar with various proof calculi for these logics and be able to use such calculi to test formulae for satisfiability and or validity. In addition, they should have basic knowledge about automatic theorem provers and they way these work.
Syllabus
  • Resolution for propositional logic.
  • Resolution for first-order logic.
  • Prolog.
  • Fundamentals of database theory.
  • Tableaux proofs for first-oder logic.
  • Natural deduction.
  • Induction.
  • Modal logic.
  • Many-valued logics.
Literature
  • NERODE, Anil and Richard A. SHORE. Logic for applications. New York: Springer-Verlag, 1993, xvii, 365. ISBN 0387941290. info
  • FITTING, Melvin. First order logic and automated theorem proving. 2nd ed. New York: Springer, 1996, xvi, 326. ISBN 0387945938. info
  • NIENHUYS-CHENG, Shan-Hwei and Ronald de WOLF. Foundations of inductive logic programming. Berlin: Springer, 1997, xvii, 404. ISBN 3540629270. info
  • PRIEST, Graham. An introduction to non-classical logic : from if to is. 2nd ed. Cambridge: Cambridge University Press, 2008, xxxii, 613. ISBN 9780521854337. info
Teaching methods
lectures, exercises.
Assessment methods
A final written exam.
Language of instruction
English
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, Autumn 2017, Autumn 2018, Autumn 2019, Autumn 2020, Spring 2022, Spring 2024, Spring 2025.
  • Enrolment Statistics (Spring 2023, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2023/IA008