Talks and Poster Presentations (without Proceedings-Entry):

J. Fichte:
"Modern SAT Solvers -- History, Techniques, and Success --";
Talk: UIB Department Seminar at Informatics, University of Bergen, Bergen, Norwegen (invited); 03-26-2015.

English abstract:
The propositional satisfiability problem (SAT) is probably one of the
most important computationally hard problems in computer science with
a wide-ranging application in industry. SAT asks whether a given
propositional formula has some assignment to its variables that makes
the formula true.
SAT is the first problem shown to be NP-complete and holds a central
role in the theory of computational complexity. Despite its
theoretical hardness, today's modern SAT solvers routinely solve huge
industrial instances with hundreds of thousands of variables in
applications like formal verification, planning, bio-informatics, and
many others.
In this talk we will outline the success story of SAT solving from
theoretical NP-hardness to modern practical techniques that can
heuristically avoid the "theoretical complexity issues" in many
practical applications.

Created from the Publication Database of the Vienna University of Technology.