Resolution-based lower bounds in MaxSAT
From MaRDI portal
Recommendations
- Exploiting Cycle Structures in Max-SAT
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Understanding the power of Max-SAT resolution through up-resilience
Cites work
- A Complete Calculus for Max-SAT
- A logical approach to efficient Max-SAT solving
- Exploiting Cycle Structures in Max-SAT
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Minimaxsat: an efficient weighted Max-SAT solver
- New inference rules for Max-SAT
- On Inconsistent Clause-Subsets for Max-SAT Solving
- Resolution for Max-SAT
- Solving weighted Max-SAT problems in a reduced search space: a performance analysis
- The first and second Max-SAT evaluations
Cited in
(14)- scientific article; zbMATH DE number 1929954 (Why is no real title available?)
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem
- Optimizing with minimum satisfiability
- Exploiting Cycle Structures in Max-SAT
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT
- Understanding the power of Max-SAT resolution through up-resilience
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Theory and Applications of Satisfiability Testing
- Efficient reasoning for inconsistent Horn formulae
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- On Inconsistent Clause-Subsets for Max-SAT Solving
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
- Integrating multi-armed bandit with local search for MaxSAT
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
This page was built for publication: Resolution-based lower bounds in MaxSAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606913)
