Pages that link to "Item:Q606913"
From MaRDI portal
The following pages link to Resolution-based lower bounds in MaxSAT (Q606913):
Displaying 11 items.
- On Davis-Putnam reductions for minimally unsatisfiable clause-sets (Q391124) (← links)
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes (Q505972) (← links)
- Optimizing with minimum satisfiability (Q1761303) (← links)
- Understanding the power of Max-SAT resolution through up-resilience (Q2046032) (← links)
- Efficient Reasoning for Inconsistent Horn Formulae (Q2835881) (← links)
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem (Q3452557) (← links)
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers (Q3524192) (← links)
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT (Q4632177) (← links)
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver (Q5015596) (← links)
- Boosting branch-and-bound MaxSAT solvers with clause learning (Q5106262) (← links)
- Integrating multi-armed bandit with local search for MaxSAT (Q6665727) (← links)
