Satisfaction Guaranteed or your Money Back

Speaker:  Nachum Dershowitz - Tel Aviv University
  Monday, June 8, 2015 at 5:00 PM 16:45 rinfresco, 17:00 inizio seminario
Over the past decade or so, propositional satisfiability (SAT) has become a workhorse for many types of problem solving.  We explain the functionality of modern learning-based SAT solvers in terms of the duality between search and inference by resolution.  And we discuss some enhancements, including the use of hints to potentially speed up the search for solutions.

Place
Ca' Vignal - Piramide, Floor 0, Hall Verde

Programme Director
Maria Paola Bonacina

External reference
Publication date
May 25, 2015

Studying

Share