Winter term 2025

This webpage is for all seminars (and some seminar/projects) with the lecturer Johannes P. Wallner.

The seminar this term is based on the Handbook of Satisfiability, second edition (2021). This handbook is fully accessible from the TU Graz library. 

Possible topics for the seminar include

• algorithmic approaches to the Boolean SATisfiability problem (e.g., CDCL algorithms, preprocessing, random satisfiability, complete/incomplete algorithms, branching heuristics, ...)
• algorithmic approaches to related problems to SAT, such as Maximum Satisfiability, model counting, quantified Boolean satisfiability, answer set programming, integer linear programming, constraint satisfaction problems
• unsatisfiability of Boolean formulas (e.g., proofs of unsatisfiability, unsatisfiable cores)
• theoretical foundations of the SAT problem and related problems, such as computational complexity, worst-case upper bounds, fixed-parameter tractability, proof complexity
• selected applications of SAT solving, such as planning, bounded model checking, verification
• connections of SAT solving and machine learning

If you want to attend this seminar, send an eMail to johannes.p.wallner@tugraz.at with the seminar (or seminar/project) course you want to attend this course. Note that some seminars include a project and others do not. This page is mainly for the seminars. Seminar/projects are oftentimes taken together with the Master's thesis. If you want to attend with a seminar/project, mail me before.

In winter term 2025, the seminar will start later (November). 

The language of the seminar will be English.

First meeting (kick-off): 11.11.2025 from 12:00 to 13:00 in the SAI seminar room.

Remark: registering in TUGrazOnline is not sufficient for registering to a seminar (an eMail to the lecturer is required).

TeachCenter course: registered students will be added to a TeachCenter course (https://tc.tugraz.at/main/course/view.php?id=6221).