Exploiting Configurations of MaxSAT Solvers

Josep Alòs, Carlos Ansótegui, Josep M. Salvia, Eduard Torres
6/13/2023
cs.AI

No confident code implementation found for this paper.

Abstract

In this paper, we describe how we can effectively exploit alternative parameter configurations to a MaxSAT solver. We describe how these configurations can be computed in the context of MaxSAT. In particular, we experimentally show how to easily combine configurations of a non-competitive solver to obtain a better solving approach.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

IntSat: Integer Linear Programming by Conflict-Driven Constraint-Learning

81% match2024

Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectives

79% match1 repo942024

Evaluating SAT and SMT Solvers on Large-Scale Sudoku Puzzles

78% match1 repo2025

Combining Monte Carlo Tree Search and Heuristic Search for Weighted Vertex Coloring

77% match2023

Learning to Configure Mathematical Programming Solvers by Mathematical Programming

77% match2024

ASP-FZN: A Translation-based Constraint Answer Set Solver

77% match2025

Cite this paper

@article{als2023exploiting,
  title  = {Exploiting Configurations of MaxSAT Solvers},
  author = {Josep Alòs and Carlos Ansótegui and Josep M. Salvia and Eduard Torres},
  year   = {2023},
  eprint = {2306.07635},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.07635v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2306.07635.svg)](https://codeofpaper.com/paper/2306.07635)

Discussion