Using local search to find MSSes and MUSes
In this paper, a new complete technique to compute Maximal Satisfiable Subsets (MSSes) and Minimally Unsatisfiable Subformulas (MUSes) of sets of Boolean clauses is introduced. The approach improves the currently most efficient complete technique in several ways. It makes use of the powerful concept of critical clause and of a computationally inexpensive local search oracle to boost an exhaustive algorithm proposed by Liffiton and Sakallah. These features can allow exponential efficiency gains to be obtained. Accordingly, experimental studies show that this new approach outperforms the best current existing exhaustive ones.
Year of publication: |
2009
|
---|---|
Authors: | Grégoire, Éric ; Mazure, Bertrand ; Piette, Cédric |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 199.2009, 3, p. 640-646
|
Publisher: |
Elsevier |
Keywords: | SAT MSSes MUSes Satisfiability Hybrid algorithm |
Saved in:
Saved in favorites
Similar items by person
-
Using local search to find MSSes and MUSes
Grégoire, Éric, (2009)
-
Using local search to find MSSes and MUSes
Grégoire, Éric, (2009)
-
A fast logically-complete preferential reasoner for the assessment of critical situations
Grégoire, Éric, (2013)
- More ...