Approximation Strategies for Incomplete MaxSAT

  title={Approximation Strategies for Incomplete MaxSAT},
  author={Saurabh Joshi and Prateek Kumar and Ruben Martins and Sukrut Rao},
Incomplete MaxSAT solving aims to quickly find a solution that attempts to minimize the sum of the weights of the unsatisfied soft clauses without providing any optimality guarantees. In this paper, we propose two approximation strategies for improving incomplete MaxSAT solving. In one of the strategies, we cluster the weights and approximate them with a representative weight. In another strategy, we break up the problem of minimizing the sum of weights of unsatisfiable clauses into multiple… 

Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT

This paper proposes two approximation strategies for improving incomplete weighted MaxSAT solving that are competitive with the best of the solvers and compares them on benchmarks taken from MaxSat Evaluation 2017 andMaxSAT Evaluation 2018.

Constraint-Based Techniques in Stochastic Local Search MaxSAT Solving

Two constraint-based techniques for improving local search MaxSAT solvers are proposed, an unsatisfiability-based algorithm is used to guide the local search solver into the feasible region of the search space and Minimal Correction Subsets enumeration is performed in order to improve upon the best solution found by the localsearch solver.

Maximum Satisfiability

This chapter provides a detailed overview of the approaches to MaxSAT solving that have in recent years been most successful in solving real-world optimization problems.

Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search

This work identifies three weaknesses of the linear MaxSAT algorithm that prevent it from effectively computing low-violation solutions early in the search and develops a novel approach inspired by local search to address these issues.

MaxSAT Evaluation 2018: New Developments and Detailed Results

An overview of the 2018 MaxSAT Evaluation is provided, including a description of the main changes made in 2017 under a new organizing team, an Overview of the solvers and benchmarks submitted in 2018, and detailed results of the2018 evaluation.

Minimal Perturbation in University Timetabling with Maximum Satisfiability

A maximum satisfiability (MaxSAT) encoding to solve large and complex university timetabling problem instances which can be subject to disruptions is proposed and is able to efficiently solve the disrupted instances.

Learning from survey propagation: a neural network for MAX-E-3-SAT

  • Raffaele Marino
  • Computer Science
    Machine Learning: Science and Technology
  • 2021
This paper presents a new algorithm for computing approximate solutions in Θ(N) for the maximum exact 3-satisfiability (MAX-E-3-SAT) problem by using supervised learning methodology and shows that this new algorithm can build assignments better than a random one, even if the convergence of the messages is not found.

Polarity and Variable Selection Heuristics for SAT-Based Anytime MaxSAT

The recently introduced polarity and variable selection heuristics, TORC and TSB, respectively, are implemented in the Open-WBO-Inc-BMO algorithm within the open-source anytime MaxSAT solver Open-SAT-Inc.

On Optimizing a Generic Function in SAT

  • Alexander Nadel
  • Computer Science
    2020 Formal Methods in Computer Aided Design (FMCAD)
  • 2020
It is shown that integrating Polosat into a state-of-the-art open-source anytime MaxSAT solver significantly improves the solver's performance and substantially improves the solution quality of an industrial placement tool.

ITC-2019: A MaxSAT approach to solve University Timetabling problems

An algorithm is described that uses a MaxSAT encoding to solve course timetabling and student sectioning problems as specified for the International Timetabling Competition 2019 and a hybridized algorithm is developed that combines local search techniques and aMaxSAT solver.



Incremental Cardinality Constraints for MaxSAT

This paper exploits the knowledge acquired across iterations using novel schemes to use cardinality constraints in an incremental fashion and shows a significant performance boost for these algorithms as compared to their non-incremental counterparts, suggesting that incremental cardinality constraint constraints could be beneficial for other constraint solving domains.

Improving SAT-Based Weighted MaxSAT Solvers

An extensive experimental investigation is presented comparing the new algorithm with state-of-the-art solvers showing that the approach makes WPM1 much more competitive.

WPM3: An (in)complete algorithm for weighted partial MaxSAT

A MaxSAT Algorithm Using Cardinality Constraints of Bounded Size

A new core-guided algorithm is introduced that adds cardinality constraints for each detected core, but also limits the number of literals in each constraint in order to control thenumber of refutations in subsequent satisfiability checks.

LMHS: A SAT-IP Hybrid MaxSAT Solver

LMHS is a hybrid SAT-IP MaxSat solver that implements the implicit hitting set approach to MaxSAT and offers integrated preprocessing, solution enumeration, an incremental API, and the use of a choice of SAT and IP solvers.

From Decimation to Local Search and Back: A New Approach to MaxSAT

This work proposes a novel decimation algorithm for MaxSAT, and then combines it with a local search algorithm, and the resulting solvers significantly improve local search solvers on crafted and industrial benchmarks, and are complementary to SAT-based solvers.

CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability

Experimental results illustrate that the quality of solution found by CCLS is much better than that found by IRoTS, akmaxsat_ls and New WPM2 on most industrial, crafted and random instances, indicating the efficiency and the robustness of the CCRS algorithm.

Solving MAXSAT by Solving a Sequence of Simpler SAT Instances

This paper introduces a new MAXSAT algorithm that solves a sequence of SAT instances and can, however, require solving more SAT instances than previous approaches, which is simpler than previous methods and displays superior performance on some benchmarks.

Tailoring Local Search for Partial MaxSAT

New ideas for local search for PMS are proposed, which mainly rely on the distinction between hard and soft clauses to develop a local search PMS algorithm called {\it Dist}.

Boolean lexicographic optimization: algorithms & applications

This paper develops and evaluates algorithms for solving MOCO problems, defined on Boolean domains, and where the optimality criterion is lexicographic, and shows that lexicography optimization conditions are observed in the majority of the problem instances from the MaxSAT evaluations.