Satisfaction Guaranteed or your Money Back

Relatore
Nachum Dershowitz - Tel Aviv University
Data e ora
lunedì 8 giugno 2015 alle ore 17.00 - 16:45 rinfresco, 17:00 inizio seminario
Luogo
Ca' Vignal - Piramide, Piano 0, Sala Verde
Referente
Maria Paola Bonacina
Referente esterno
Data pubblicazione
25 maggio 2015
Dipartimento
Informatica  

Riassunto

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  Università degli studi di Verona
Via dell'Artigliere 8, 37129 Verona  |  P. I.V.A. 01541040232  |  C. FISCALE 93009870234