Solving satisfiability problems with preferences

  • Authors:

  • Emanuele Di Rosa;Enrico Giunchiglia;Marco Maratea

  • Affiliations:

  • DIST, University of Genoa, Genoa, Italy 16145;DIST, University of Genoa, Genoa, Italy 16145;DIST, University of Genoa, Genoa, Italy 16145

  • Venue:
  • Constraints
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different application domains, including planning and formal verification. The main reason for this success is that modern SAT solvers can successfully deal with problems having millions of variables. All these solvers are based on the Davis---Logemann---Loveland procedure (dll). In its original version, dll is a decision procedure, but it can be very easily modified in order to return one or all assignments satisfying the input set of clauses, assuming at least one exists. However, in many cases it is not enough to compute assignments satisfying all the input clauses: Indeed, the returned assignments have also to be "optimal" in some sense, e.g., they have to satisfy as many other constraints--expressed as preferences--as possible. In this paper we start with qualitative preferences on literals, defined as a partially ordered set (poset) of literals. Such a poset induces a poset on total assignments and leads to the definition of optimal model for a formula 驴 as a minimal element of the poset on the models of 驴. We show (i) how dll can be extended in order to return one or all optimal models of 驴 (once converted in clauses and assuming 驴 is satisfiable), and (ii) how the same procedures can be used to compute optimal models wrt a qualitative preference on formulas and/or wrt a quantitative preference on literals or formulas. We implemented our ideas and we tested the resulting system on a variety of very challenging structured benchmarks. The results indicate that our implementation has comparable performances with other state-of-the-art systems, tailored for the specific problems we consider.