MUS Extraction Using Clausal Proofs

  • Anton Belov
  • Marijn J. H. Heule
  • Joao Marques-Silva
Conference paper

DOI: 10.1007/978-3-319-09284-3_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8561)
Cite this paper as:
Belov A., Heule M.J.H., Marques-Silva J. (2014) MUS Extraction Using Clausal Proofs. In: Sinz C., Egly U. (eds) Theory and Applications of Satisfiability Testing – SAT 2014. SAT 2014. Lecture Notes in Computer Science, vol 8561. Springer, Cham

Abstract

Recent work introduced an effective method for extraction of reduced unsatisfiable cores of CNF formulas as a by-product of validation of clausal proofs emitted by conflict-driven clause learning SAT solvers. In this paper, we demonstrate that this method for trimming CNF formulas can also benefit state-of-the-art tools for the computation of a Minimal Unsatisfiable Subformula (MUS). Furthermore, we propose a number of techniques that improve the quality of trimming, and demonstrate a significant positive impact on the performance of MUS extractors from the improved trimming.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Anton Belov
    • 1
  • Marijn J. H. Heule
    • 2
  • Joao Marques-Silva
    • 1
    • 3
  1. 1.Complex and Adaptive Systems LaboratoryUniversity College DublinIreland
  2. 2.The University of Texas at AustinUSA
  3. 3.IST/INESC-IDTechnical University of LisbonPortugal

Personalised recommendations