This seminar covers new topics and recent advances in propositional satisfiability and optimization. Topics include parallel SAT, algorithm portfolios, maximum satisfiability, and proof production and checking. 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 on at the end of the semester.

Folien / Themenübersicht