Community-Based Partitioning for MaxSAT Solving

  • Ruben Martins
  • Vasco Manquinho
  • Inês Lynce
Conference paper

DOI: 10.1007/978-3-642-39071-5_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7962)
Cite this paper as:
Martins R., Manquinho V., Lynce I. (2013) Community-Based Partitioning for MaxSAT Solving. In: Järvisalo M., Van Gelder A. (eds) Theory and Applications of Satisfiability Testing – SAT 2013. SAT 2013. Lecture Notes in Computer Science, vol 7962. Springer, Berlin, Heidelberg

Abstract

Unsatisfiability-based algorithms for Maximum Satisfiability (MaxSAT) have been shown to be very effective in solving several classes of problem instances. These algorithms rely on successive calls to a SAT solver, where an unsatisfiable subformula is identified at each iteration. However, in some cases, the SAT solver returns unnecessarily large subformulas. In this paper a new technique is proposed to partition the MaxSAT formula in order to identify smaller unsatisfiable subformulas at each call of the SAT solver. Preliminary experimental results analyze the effect of partitioning the MaxSAT formula into communities. This technique is shown to significantly improve the unsatisfiability-based algorithm for different benchmark sets.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Ruben Martins
    • 1
  • Vasco Manquinho
    • 1
  • Inês Lynce
    • 1
  1. 1.IST/INESC-IDTechnical University of LisbonPortugal

Personalised recommendations