Does This Set of Clauses Overlap with at Least One MUS?

This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More precisely, an original approach is introduced to check whether overlaps with at least one minimally unsatisfiable subset (MUS) of . In the positive case, it intends to compute and deliver one such MUS. The approach re-expresses the problem within an evolving coarser-grained framework where clusters of clauses of are formed and examined according to their levels of mutual conflicts when they are interpreted as basic interacting entities. It then progressively refines the framework and the solution by splitting most promising clusters and pruning the useless ones until either some maximal preset computational resources are exhausted, or a final solution is discovered. The viability and the usefulness of the approach are illustrated through benchmarks experimentations.

• Type: Conference
• Year: 2009
• Where: CADE
• Authors: Éric Grégoire, Bertrand Mazure, Cédric Piette
• Keywords: Automated Reasoning, Basic Interacting Entities, Boolean CNF Formula, CADE 2009, Preset Computational Resources