Boosting branch-and-bound MaxSAT solvers with clause learning
From MaRDI portal
Publication:5106262
Cites work
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- A Complete Calculus for Max-SAT
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- Algorithms for Weighted Boolean Optimization
- An efficient solver for weighted Max-SAT
- Chaff
- Clause size reduction with all-UIP learning
- Clause vivification by unit propagation in CDCL SAT solvers
- Core-guided and core-boosted search for CP
- Exploiting Cycle Structures in Max-SAT
- Exploiting the power of MIP solvers in MAXSAT
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Handbook of satisfiability. In 2 parts
- scientific article; zbMATH DE number 1522934 (Why is no real title available?)
- Improving implementation of SAT competitions 2017--2019 winners
- LMHS: a SAT-IP hybrid MaxSat solver
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- Minimaxsat: an efficient weighted Max-SAT solver
- New inference rules for Max-SAT
- New Upper Bounds for Maximum Satisfiability
- On Solving the Partial MAX-SAT Problem
- Open-WBO: a modular MaxSAT solver
- Optimal speedup of Las Vegas algorithms
- QMaxSAT: A partial Max-SAT solver
- RC2: an efficient MaxSAT solver
- Relaxation-aware heuristics for exact optimization in graphical models
- Resolution for Max-SAT
- Resolution-based lower bounds in MaxSAT
- SAT-based MaxSAT algorithms
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- Understanding the power of Max-SAT resolution through up-resilience
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
Cited in
(7)- New Bounds for MAX-SAT by Clause Learning
- The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study
- Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases
- Proofs and Certificates for Max-SAT
- Certified Core-Guided MaxSAT Solving
- Integrating multi-armed bandit with local search for MaxSAT
- Solving weighted maximum satisfiability with branch and bound and clause learning
This page was built for publication: Boosting branch-and-bound MaxSAT solvers with clause learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5106262)
