Add to ORKGInternational audienceAdapting a resolution refutation for SAT into a Max-SAT resolution refutation without increasing considerably the size of the refutation is an open question. This paper contributes to this topic by introducing an algorithm, called substitute generation, able to adapt any resolution refutation to get a Max-SAT refutation using SAT oracles. This algorithm is able to efficiently adapt k-stacked diamond patterns, whose transformation is exponential in the literature
Core-guided approaches to solving MAXSAT have proved to be effective on industrial problems. These a...
AbstractWe report initial results on shortening propositional resolution refutation proofs. This has...
Many exact Max-SAT solvers use a branch and bound algorithm, where the lower bound is calculated wit...
International audienceAdapting a resolution refutation for SAT into a Max-SAT resolution refutation ...
International audienceAdapting a resolution proof for SAT to a Max-SAT resolution proof without incr...
International audienceCurrent Max-SAT solvers are able to efficiently compute the optimal value of a...
International audienceComplete Max-SAT solvers are able to return the optimal value of an input inst...
The refutation power of SAT and MaxSAT resolution is challenged by problems like the soft and hard P...
The refutation power of SAT and MaxSAT resolution is challenged by problems like the soft and hard P...
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof t...
Weighted Max-SAT is the optimization version of SAT and many important problems can be naturally enc...
In this paper we augment the Max-SAT solver of (Larrosa & Heras 2005) with three new inference r...
Conflict-driven clause learning (CDCL) is at the core of the success of modern SAT solvers. In terms...
Conflict-driven clause learning (CDCL) is at the core of the success of modern SAT solvers. In terms...
Core-guided algorithms proved to be effective on industrial instances of MaxSAT, the optimization va...
Core-guided approaches to solving MAXSAT have proved to be effective on industrial problems. These a...
AbstractWe report initial results on shortening propositional resolution refutation proofs. This has...
Many exact Max-SAT solvers use a branch and bound algorithm, where the lower bound is calculated wit...
International audienceAdapting a resolution refutation for SAT into a Max-SAT resolution refutation ...
International audienceAdapting a resolution proof for SAT to a Max-SAT resolution proof without incr...
International audienceCurrent Max-SAT solvers are able to efficiently compute the optimal value of a...
International audienceComplete Max-SAT solvers are able to return the optimal value of an input inst...
The refutation power of SAT and MaxSAT resolution is challenged by problems like the soft and hard P...
The refutation power of SAT and MaxSAT resolution is challenged by problems like the soft and hard P...
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof t...
Weighted Max-SAT is the optimization version of SAT and many important problems can be naturally enc...
In this paper we augment the Max-SAT solver of (Larrosa & Heras 2005) with three new inference r...
Conflict-driven clause learning (CDCL) is at the core of the success of modern SAT solvers. In terms...
Conflict-driven clause learning (CDCL) is at the core of the success of modern SAT solvers. In terms...
Core-guided algorithms proved to be effective on industrial instances of MaxSAT, the optimization va...
Core-guided approaches to solving MAXSAT have proved to be effective on industrial problems. These a...
AbstractWe report initial results on shortening propositional resolution refutation proofs. This has...
Many exact Max-SAT solvers use a branch and bound algorithm, where the lower bound is calculated wit...