Teaching
Advanced Topics in SAT SolvingAdvanced Topics in SAT Solving
Post Kick-Off update: Please send us three ordered preferences for your favorite topics in the below slide set until Sunday, November 9 EOD.
Kick-Off: Thursday, November 6, 2025, 10 AM, room 205
This seminar covers new topics and recent advances in propositional satisfiability and optimization. Cutting-edge topics to be examinated include parallel SAT solving, algorithm portfolios, maximum satisfiability, and modern production and checking of proofs of unsatisfiability.
We prepare bundles of two papers for the first session, usually one recent and one classic. You may choose one of the bundles to prepare a presentation for the end of the semester. We expect a 30-minute presentation that presents and critically discusses the according works, followed by 15 minutes of discussion. You are not expected to prepare a document or paper in the scope of this course.