\textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
From MaRDI portal
Publication:5015596
Recommendations
Cites work
- A Generalized Framework for Conflict Analysis
- A logical approach to efficient Max-SAT solving
- Algorithms for the maximum satisfiability problem
- Branching rules for satisfiability
- Community-Based Partitioning for MaxSAT Solving
- Cores in core based MaxSat algorithms: an analysis
- 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
- Generalized conflict-clause strengthening for satisfiability solvers
- GRASP: a search algorithm for propositional satisfiability
- scientific article; zbMATH DE number 1222824 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1114003 (Why is no real title available?)
- scientific article; zbMATH DE number 956861 (Why is no real title available?)
- scientific article; zbMATH DE number 956866 (Why is no real title available?)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP
- Learning action models from plan examples using weighted MAX-SAT
- Local Consistency in Weighted CSPs and Inference in Max-SAT
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- MaxSAT by improved instance-specific algorithm configuration
- 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 Protein Structure Alignment Using Maximum Cliques
- QMaxSAT: A partial Max-SAT solver
- Resolution for Max-SAT
- Resolution-based lower bounds in MaxSAT
- SCIP: solving constraint integer programs
- Solving propositional satisfiability problems
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
Cited in
(15)- Understanding the power of Max-SAT resolution through up-resilience
- A proof builder for Max-SAT
- Voting on multi-issue domains with conditionally lexicographic preferences
- New local search methods for partial MaxSAT
- On Inconsistent Clause-Subsets for Max-SAT Solving
- Exploiting Cycle Structures in Max-SAT
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
- Breaking cycle structure to improve lower bound for Max-SAT
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Proofs and Certificates for Max-SAT
- MaxSAT resolution for regular propositional logic
- Resolution-based lower bounds in MaxSAT
- Enhancing MaxSAT local search via a unified soft clause weighting scheme
- Solving weighted maximum satisfiability with branch and bound and clause learning
This page was built for publication: \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015596)
