Exploiting subproblem optimization in SAT-based maxsat algorithms
From MaRDI portal
Recommendations
- SAT-based MaxSAT algorithms
- Exploiting resolution-based representations for MaxSAT solving
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
Cites work
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- A Complete Calculus for Max-SAT
- A logical approach to efficient Max-SAT solving
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- Algorithms for Weighted Boolean Optimization
- Boolean lexicographic optimization: algorithms \& applications
- Exploiting Cycle Structures in Max-SAT
- Exploiting the power of MIP solvers in MAXSAT
- Handbook of constraint programming.
- Improvements to core-guided binary search for MaxSAT
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization
- Introduction to algorithms.
- Iterative and core-guided maxsat solving: a survey and assessment
- Lazy satisfiability modulo theories
- Local Consistency in Weighted CSPs and Inference in Max-SAT
- Metaheuristics -- the metaphor exposed
- Minimaxsat: an efficient weighted Max-SAT solver
- New Encodings of Pseudo-Boolean Constraints into CNF
- New inference rules for Max-SAT
- On SAT Modulo Theories and Optimization Problems
- On Solving the Partial MAX-SAT Problem
- QMaxSAT: A partial Max-SAT solver
- Resolution lower bounds for the weak pigeonhole principle
- SAT-based MaxSAT algorithms
- Satisfiability modulo the theory of costs: foundations and applications
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
- Unsatisfiability-based optimization in clasp
Cited in
(10)- Subsumed label elimination for maximum satisfiability
- MaxSAT by improved instance-specific algorithm configuration
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
- Maximum satisfiability in software analysis: applications and techniques
- Exploiting the power of MIP solvers in MAXSAT
- SAT-based MaxSAT algorithms
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Exploiting resolution-based representations for MaxSAT solving
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
This page was built for publication: Exploiting subproblem optimization in SAT-based maxsat algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q525063)
