Using Local Search to Find \MSSes and MUSes

Éric Grégoire (1) , Bertrand Mazure (1) , Cédric Piette (1)

1 CRIL - Centre de Recherche en Informatique de Lens

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.

Domaines: Intelligence artificielle [cs.AI]

Éric Grégoire, Bertrand Mazure, Cédric Piette. Using Local Search to Find \MSSes and MUSes. European Journal of Operational Research, 2009, 199 (3), pp.640-648. ⟨hal-00868114⟩