RC2: an efficient MaxSAT solver
From MaRDI portal
Recommendations
Cites work
- Algorithms for Weighted Boolean Optimization
- Boolean lexicographic optimization: algorithms \& applications
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
- Iterative and core-guided maxsat solving: a survey and assessment
- On Solving the Partial MAX-SAT Problem
- Progression in maximum satisfiability
- PySAT: a Python toolkit for prototyping with SAT oracles
- SAT-based MaxSAT algorithms
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Temporal induction by incremental SAT solving
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- Unsatisfiability-based optimization in clasp
Cited in
(30)- PySAT: a Python toolkit for prototyping with SAT oracles
- Understanding the power of Max-SAT resolution through up-resilience
- Clause redundancy and preprocessing in maximum satisfiability
- Efficient SAT-based minimal model generation methods for modal logic S5
- SAT-based rigorous explanations for decision lists
- Assessing progress in SAT solvers through the Lens of incremental SAT
- A proof builder for Max-SAT
- Solving RCPSP/max by lazy clause generation
- QMaxSATpb: a certified MaxSAT solver
- Using merging variables-based local search to solve special variants of MaxSAT problem
- Learning Optimal Decision Sets and Lists with SAT
- Boosting branch-and-bound MaxSAT solvers with clause learning
- RC2
- Proofs and Certificates for Max-SAT
- Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding
- Certified dominance and symmetry breaking for combinatorial optimisation
- Certified Core-Guided MaxSAT Solving
- A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems
- Scaling up nonmonotonic c-inference via partial MaxSAT problems
- Towards universally accessible SAT technology
- The InfOCF library for reasoning with conditional belief bases
- Engineering and evaluating multi-objective pseudo-Boolean optimizers
- Solving weighted maximum satisfiability with branch and bound and clause learning
- A reinforcement learning approach for resolving inconsistencies in qualitative constraint networks
- Scaling up reasoning from conditional belief bases
- Scheduling pre-operative assessment clinic with answer set programming
- Satisfiability modulo user propagators
- Certified MaxSAT preprocessing
- PACE solver description: minimum hitting set computation via core-guided MaxSAT solving
- PACE solver description: HitS\&DoSeS -- exact and heuristic solvers for the dominating set and hitting set problems
This page was built for publication: RC2: an efficient MaxSAT solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015603)
