Minipref: A Tool for Preferences in SAT (short paper)

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.

[1]  Enrico Giunchiglia,et al.  Combining approaches for solving satisfiability problems with qualitative preferences , 2013, AI Commun..

[2]  Enrico Giunchiglia,et al.  Planning as Satisfiability with Preferences , 2007, AAAI.

[3]  Armin Biere,et al.  Evaluating CDCL Variable Scoring Schemes , 2015, SAT.

[4]  Ilkka Niemelä,et al.  Unrestricted vs restricted cut in a tableau method for Boolean circuits , 2005, Annals of Mathematics and Artificial Intelligence.

[5]  Toby Walsh,et al.  Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications , 2009 .

[6]  Mario Alviano,et al.  Evaluation of Disjunctive Programs in WASP , 2019, LPNMR.

[7]  Fahiem Bacchus,et al.  Relaxation Search: A Simple Way of Managing Optional Clauses , 2014, AAAI.

[8]  Martin Gebser,et al.  Theory Solving Made Easy with Clingo 5 , 2016, ICLP.

[9]  Enrico Giunchiglia,et al.  Solving Optimization Problems with DLL , 2006, ECAI.

[10]  Mikolás Janota,et al.  Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence On Computing Minimal Correction Subsets , 2022 .

[11]  Mikolás Janota,et al.  Algorithms for computing backbones of propositional formulae , 2015, AI Commun..

[12]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[13]  Matti Järvisalo,et al.  A preference-based approach to backbone computation with application to argumentation , 2018, SAC.

[14]  Enrico Giunchiglia,et al.  A new Approach for Solving Satisfiability Problems with Qualitative Preferences , 2008, ECAI.

[15]  Gilles Audemard,et al.  On the Glucose SAT Solver , 2018, Int. J. Artif. Intell. Tools.

[16]  Mario Alviano,et al.  Cautious reasoning in ASP via minimal models and unsatisfiable cores , 2018, Theory and Practice of Logic Programming.