Add to ORKGAbstract. This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local Search procedure (SLS) can be substantially improved when its search is initialized with an assignment provided by a complete SAT solver.
The Maximum Satisfiability (MaxSAT) problem is an optimization variant of the Satisfiability (SAT) p...
Stochastic local search (SLS) is the dominant paradigm for incomplete SAT and MAXSAT solvers. Early ...
This paper proposes a new algorithm for solving MAX2SAT problems based on combining search methods w...
This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a com...
This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a com...
peer-reviewedThis paper presents several ways to compute lower and upper bounds for MaxSAT based on...
Weighted Max-SAT is the optimization version of SAT and many important problems can be naturally enc...
The lower bound (LB) implemented in branch and bound MaxSAT solvers is decisive for obtaining a comp...
In this paper we augment the Max-SAT solver of (Larrosa & Heras 2005) with three new inference r...
Core-guided approaches to solving MAXSAT have proved to be effective on industrial problems. These a...
Abstract. We present two new branch and bound weighted Max-SAT solvers (Lazy and Lazy ⋆ ) which inco...
Stochastic local search (SLS) is the dominant paradigm for incomplete SAT and MAXSAT solvers. Early ...
MAXSAT solutions, i.e., near-satisfying assignments for propositional formulas, are sometimes meanin...
MAXSAT solutions, i.e., near-satisfying assignments for propositional formulas, are sometimes meanin...
Maximum Satisfiability (MaxSAT) is the optimization version of the Satisfiability (SAT) problem. Par...
The Maximum Satisfiability (MaxSAT) problem is an optimization variant of the Satisfiability (SAT) p...
Stochastic local search (SLS) is the dominant paradigm for incomplete SAT and MAXSAT solvers. Early ...
This paper proposes a new algorithm for solving MAX2SAT problems based on combining search methods w...
This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a com...
This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a com...
peer-reviewedThis paper presents several ways to compute lower and upper bounds for MaxSAT based on...
Weighted Max-SAT is the optimization version of SAT and many important problems can be naturally enc...
The lower bound (LB) implemented in branch and bound MaxSAT solvers is decisive for obtaining a comp...
In this paper we augment the Max-SAT solver of (Larrosa & Heras 2005) with three new inference r...
Core-guided approaches to solving MAXSAT have proved to be effective on industrial problems. These a...
Abstract. We present two new branch and bound weighted Max-SAT solvers (Lazy and Lazy ⋆ ) which inco...
Stochastic local search (SLS) is the dominant paradigm for incomplete SAT and MAXSAT solvers. Early ...
MAXSAT solutions, i.e., near-satisfying assignments for propositional formulas, are sometimes meanin...
MAXSAT solutions, i.e., near-satisfying assignments for propositional formulas, are sometimes meanin...
Maximum Satisfiability (MaxSAT) is the optimization version of the Satisfiability (SAT) problem. Par...
The Maximum Satisfiability (MaxSAT) problem is an optimization variant of the Satisfiability (SAT) p...
Stochastic local search (SLS) is the dominant paradigm for incomplete SAT and MAXSAT solvers. Early ...
This paper proposes a new algorithm for solving MAX2SAT problems based on combining search methods w...