SAT solvers are used in a wide variety of applications, including hardware and software verification, planning and combinatorial design. Given a propositional formula, standard SAT solvers are able to decide whether it is satisfiable or not. In the first case, a model is returned as a witness of satisfiability. The returned model is typically selected according to an internal heuristic and no control on the assignment is offered to the final user. This paper serves as a description for our tool minipref, a SAT solver extended to provide an optimal model with respect to a given preference over literals.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | Minipref: A tool for preferences in SAT |
Autori: | |
Data di pubblicazione: | 2020 |
Serie: | |
Handle: | http://hdl.handle.net/20.500.11770/298696 |
Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |