On Inconsistent Clause-Subsets for Max-SAT Solving
From MaRDI portal
Recommendations
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- Resolution-based lower bounds in MaxSAT
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Exploiting Cycle Structures in Max-SAT
- Understanding the power of Max-SAT resolution through up-resilience
Cites work
- Exact Max-SAT solvers for over-constrained problems
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- scientific article; zbMATH DE number 1405442 (Why is no real title available?)
- scientific article; zbMATH DE number 956866 (Why is no real title available?)
- Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP
- Maintaining reversible DAC for Max-CSP
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- New bounds for oblivious mesh routing
- New inference rules for Max-SAT
- Solving Max-SAT as weighted CSP
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
Cited in
(10)- Inapproximability results for set splitting and satisfiability problems with no mixed clauses
- Understanding the power of Max-SAT resolution through up-resilience
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- A taxonomy of exact methods for partial Max-SAT
- MaxSAT by improved instance-specific algorithm configuration
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Exploiting Cycle Structures in Max-SAT
- Algorithms for Weighted Boolean Optimization
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- Resolution-based lower bounds in MaxSAT
This page was built for publication: On Inconsistent Clause-Subsets for Max-SAT Solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523061)