The following pages link to RC2: an Efficient MaxSAT Solver (Q5015603):
Displaying 18 items.
- RC2 (Q51750) (← links)
- PySAT: a Python toolkit for prototyping with SAT oracles (Q1656601) (← links)
- Understanding the power of Max-SAT resolution through up-resilience (Q2046032) (← links)
- Clause redundancy and preprocessing in maximum satisfiability (Q2104499) (← links)
- Efficient SAT-based minimal model generation methods for modal logic S5 (Q2118302) (← links)
- SAT-based rigorous explanations for decision lists (Q2118305) (← links)
- Assessing progress in SAT solvers through the Lens of incremental SAT (Q2118309) (← links)
- A proof builder for Max-SAT (Q2118341) (← links)
- Solving RCPSP/max by lazy clause generation (Q2434317) (← links)
- QMaxSATpb: a certified MaxSAT solver (Q2694600) (← links)
- Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem (Q4965126) (← links)
- Learning Optimal Decision Sets and Lists with SAT (Q5026234) (← links)
- Boosting branch-and-bound MaxSAT solvers with clause learning (Q5106262) (← links)
- Proofs and Certificates for Max-SAT (Q5870516) (← links)
- Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding (Q6175523) (← links)
- Certified dominance and symmetry breaking for combinatorial optimisation (Q6488808) (← links)
- A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems (Q6568503) (← links)
- Scaling up nonmonotonic c-inference via partial MaxSAT problems (Q6630195) (← links)
