peer-reviewedThis 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 lower bound (LB) implemented in branch and bound MaxSAT solvers is decisive for obtaining a comp...
AbstractMany industrial optimization problems can be translated to MaxSAT. Although the general prob...
In this paper we augment the Max-SAT solver of (Larrosa & Heras 2005) with three new inference r...
Abstract. This paper presents several ways to compute lower and upper bounds for MaxSAT based on cal...
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...
AbstractWeighted Max-SAT is the optimization version of SAT and many important problems can be natur...
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...
We present a new branch and bound algorithm for weighted Max-SAT, called Lazy which incorporates ori...
Weighted Max-SAT is the optimization version of SAT and many important problems can be naturally enc...
Core-guided approaches to solving MAXSAT have proved to be effective on industrial problems. These a...
Maximum Satisfiability (MaxSAT) is the optimization version of the Satisfiability (SAT) problem. Par...
Maximum Satisfiability (MaxSAT) is a prototypical constraint optimization problem, and its generaliz...
The Maximum Satisfiability (MaxSAT) problem is an optimization variant of the Satisfiability (SAT) p...
The lower bound (LB) implemented in branch and bound MaxSAT solvers is decisive for obtaining a comp...
AbstractMany industrial optimization problems can be translated to MaxSAT. Although the general prob...
In this paper we augment the Max-SAT solver of (Larrosa & Heras 2005) with three new inference r...
Abstract. This paper presents several ways to compute lower and upper bounds for MaxSAT based on cal...
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...
AbstractWeighted Max-SAT is the optimization version of SAT and many important problems can be natur...
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...
We present a new branch and bound algorithm for weighted Max-SAT, called Lazy which incorporates ori...
Weighted Max-SAT is the optimization version of SAT and many important problems can be naturally enc...
Core-guided approaches to solving MAXSAT have proved to be effective on industrial problems. These a...
Maximum Satisfiability (MaxSAT) is the optimization version of the Satisfiability (SAT) problem. Par...
Maximum Satisfiability (MaxSAT) is a prototypical constraint optimization problem, and its generaliz...
The Maximum Satisfiability (MaxSAT) problem is an optimization variant of the Satisfiability (SAT) p...
The lower bound (LB) implemented in branch and bound MaxSAT solvers is decisive for obtaining a comp...
AbstractMany industrial optimization problems can be translated to MaxSAT. Although the general prob...
In this paper we augment the Max-SAT solver of (Larrosa & Heras 2005) with three new inference r...