Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
From MaRDI portal
Recommendations
- Community-Based Partitioning for MaxSAT Solving
- Exploiting subproblem optimization in SAT-based maxsat algorithms
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- Exploiting resolution-based representations for MaxSAT solving
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Cites work
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 5139165 (Why is no real title available?)
- scientific article; zbMATH DE number 5226464 (Why is no real title available?)
- Minimaxsat: an efficient weighted Max-SAT solver
- On Solving the Partial MAX-SAT Problem
- Theory and Applications of Satisfiability Testing
- Variable Dependency in Local Search: Prevention Is Better Than Cure
Cited in
(19)- RC2: an efficient MaxSAT solver
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- A taxonomy of exact methods for partial Max-SAT
- Boolean lexicographic optimization: algorithms \& applications
- Comparison of SAT-based and ASP-based algorithms for inconsistency measurement
- Unsatisfiability-based algorithms for multi-objective combinatorial optimization
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization
- Iterative and core-guided maxsat solving: a survey and assessment
- Efficiently explaining CSPs with unsatisfiable subset optimization
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Exploiting resolution-based representations for MaxSAT solving
- Unsatisfiable core analysis and aggregates for optimum stable model search
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- Solving weighted maximum satisfiability with branch and bound and clause learning
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Algorithms for Weighted Boolean Optimization
- Generalizing Core-Guided Max-SAT
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Exploiting subproblem optimization in SAT-based maxsat algorithms
This page was built for publication: Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3502710)
