Satisfaction Guaranteed or your Money Back

Supervisor
Nachum Dershowitz - Tel Aviv University
Date and time
Monday, June 8, 2015 at 5:00 PM - 16:45 rinfresco, 17:00 inizio seminario
Place
Ca' Vignal - Piramide, Floor 0, Hall Verde
Programme Director
Maria Paola Bonacina
External reference
Publication date
May 25, 2015
Department
Computer Science  

Summary

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.





© 2002 - 2021  Verona University
Via dell'Artigliere 8, 37129 Verona  |  P. I.V.A. 01541040232  |  C. FISCALE 93009870234