Tutorial speaker

Armin Biere Johannes Kepler University, Linz, Austria

Title: Searching, Simplifying, Proving. A Tutorial on Modern SAT Solving.

This tutorial covers algorithmic aspects of conflict-driven clause learning and important extensions developed in recent years, including decision heuristics, restart schemes, various pre- and inprocessing techniques as well as proof generation and checking.  Programmatic incremental usage of SAT solvers is discussed next.  The talk closes with an overview on the state-of-the-art in parallel SAT solving and open challenges in general.

The speaker contributed to the core technology of modern SAT solving, has developed 12 SAT solvers since 1999, which won 36 medals including 16 gold medals in international SAT competitions.

(This video recording was produced and is kindly provided by the Aristotle University of Thessaloniki)

Who's online

We have 116 guests and no members online

Site Hosted by