License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SAT.2023.12
URN: urn:nbn:de:0030-drops-184745
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/18474/
Go to the corresponding LIPIcs Volume Portal

Katsirelos, George

An Analysis of Core-Guided Maximum Satisfiability Solvers Using Linear Programming

pdf-format:
LIPIcs-SAT-2023-12.pdf (0.8 MB)

Abstract

Many current complete MaxSAT algorithms fall into two categories: core-guided or implicit hitting set. The two kinds of algorithms seem to have complementary strengths in practice, so that each kind of solver is better able to handle different families of instances. This suggests that a hybrid might match and outperform either, but the techniques used seem incompatible. In this paper, we focus on PMRES and OLL, two core-guided algorithms based on max resolution and soft cardinality constraints, respectively. We show that these algorithms implicitly discover cores of the original formula, as has been previously shown for PM1. Moreover, we show that in some cases, including unweighted instances, they compute the optimum hitting set of these cores at each iteration. We also give compact integer linear programs for each which encode this hitting set problem. Importantly, their continuous relaxation has an optimum that matches the bound computed by the respective algorithms. This goes some way towards resolving the incompatibility of implicit hitting set and core-guided algorithms, since solvers based on the implicit hitting set algorithm typically solve the problem by encoding it as a linear program.

BibTeX - Entry

@InProceedings{katsirelos:LIPIcs.SAT.2023.12,
  author =	{Katsirelos, George},
  title =	{{An Analysis of Core-Guided Maximum Satisfiability Solvers Using Linear Programming}},
  booktitle =	{26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)},
  pages =	{12:1--12:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-286-0},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{271},
  editor =	{Mahajan, Meena and Slivovsky, Friedrich},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2023/18474},
  URN =		{urn:nbn:de:0030-drops-184745},
  doi =		{10.4230/LIPIcs.SAT.2023.12},
  annote =	{Keywords: maximum satisfiability, core-guided solvers, minimum hitting set problem, linear programming}
}

Keywords: maximum satisfiability, core-guided solvers, minimum hitting set problem, linear programming
Collection: 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)
Issue Date: 2023
Date of publication: 09.08.2023

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI