Solving (Weighted) Partial MaxSAT with ILP

Several combinatorial optimization problems can be translated into the Weighted Partial Maximum Satisfiability (WPMS) problem. This is an optimization variant of the Satisfiability (SAT) problem. There are two main families of WPMS solvers based on SAT technology: branch and bound and SAT-based. From the MaxSAT evaluations, we have learned that SAT-based solvers dominate on industrial instances while branch and bound dominate on random. For crafted instances it depends on the category. In this work, we study the performance of an Integer Linear Programming approach. In particular, we translate the WPMS problem into ILP and apply the Mixed Integer Programming (MIP) solver, IBMCPLEX. We present an extensive experimental evaluation showing that this approach clearly dominates on crafted instances.

[1]  Josep Argelich,et al.  Solving Linux Upgradeability Problems Using Boolean Optimization , 2010, LoCoCo.

[2]  Vasco M. Manquinho,et al.  Clause Sharing in Parallel MaxSAT , 2012, LION.

[3]  Felip Manyà,et al.  Exploiting Cycle Structures in Max-SAT , 2009, SAT.

[4]  Kaile Su,et al.  Within-problem Learning for Efficient Lower Bound Computation in Max-SAT Solving , 2008, AAAI.

[5]  Vasco M. Manquinho,et al.  Exploiting Cardinality Encodings in Parallel Maximum Satisfiability , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

[6]  Miyuki Koshimura,et al.  QMaxSAT: A Partial Max-SAT Solver , 2012, J. Satisf. Boolean Model. Comput..

[7]  Maria Luisa Bonet,et al.  Improving SAT-Based Weighted MaxSAT Solvers , 2012, CP.

[8]  Albert Oliveras,et al.  MiniMaxSat: A New Weighted Max-SAT Solver , 2007, SAT.

[9]  Felip Manyà,et al.  MaxSAT, Hard and Soft Constraints , 2021, Handbook of Satisfiability.

[10]  Jin-Kao Hao,et al.  A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite , 2001, Comput. Optim. Appl..

[11]  Sharad Malik,et al.  On Solving the Partial MAX-SAT Problem , 2006, SAT.

[12]  Vasco M. Manquinho,et al.  Algorithms for Weighted Boolean Optimization , 2009, SAT.

[13]  Fahiem Bacchus,et al.  Solving MAXSAT by Solving a Sequence of Simpler SAT Instances , 2011, CP.

[14]  W. Marsden.  I and J , 2012 .

[15]  Joel Sokol,et al.  Optimal Protein Structure Alignment Using Maximum Cliques , 2005, Oper. Res..

[16]  Sean Safarpour,et al.  Improved Design Debugging Using Maximum Satisfiability , 2007 .

[17]  Adrian Kügel,et al.  Improved Exact Solver for the Weighted MAX-SAT Problem , 2010, POS@SAT.

[18]  Joao Marques-Silva,et al.  Improvements to Core-Guided Binary Search for MaxSAT , 2012, SAT.

[19]  James D. Park.  Using weighted MAX-SAT engines to solve MPE , 2002, AAAI/IAAI.

[20]  Joao Marques-Silva,et al.  Core-Guided Binary Search Algorithms for Maximum Satisfiability , 2011, AAAI.

[21]  Kaile Su,et al.  Exploiting Inference Rules to Compute Lower Bounds for MAX-SAT Solving , 2007, IJCAI.