Logic and Computability

Content

Syntax and semantics of logic formulas in propositional logic and predicate logic (first-order logic) Basics of logical reasoning (natural deduction) Combinational equivalence checking Propositional satisfiability problem - DPLL algorithm - Resolution proofs Craig Interpolation Binary Decision Diagrams Decidability, Halteproblem First-Order Theories Satisfiability modulo Theories

Administrative Information

Previous Knowledge

basic programming skills (understanding pseudo-code) definition and working principle of Turing machines basic knowledge in complexity theory

Prerequisites Curriculum

See position in the curriculum

Objective

Understanding the construction, interpretation, and representation of logic formulas, understanding logic proof systems, ability to construct logic proofs, understanding the fundamental limitations of the computing abilities of digitial computers, mastering common proof techniques of computer science, understanding selected decision problems and the underlying algorithms

Language

English

Teaching Method

Lecture, partially supported by PowerPoint presentations and blackboard (exercises and examples)

How to get a grade

Default: written exam. Oral exams are possible at the candidates discretion. If less than four candidates are registered for a particular exam date, this exam will be conducted orally.

Registration

https://online.tugraz.at/tug_online/sa.gruppen_einteilung?clvnr=228545&corg=983
Warning: count(): Parameter must be an array or an object that implements Countable in /www/htdocs/w019a0d8/iaik.stefan-kremsner.at/wp-content/themes/iaik-git/iaik-theme/includes/single-course.php on line 196

Lecturers & Student Assistants