The following pages link to SAT-based MaxSAT algorithms (Q360042):
Displaying 14 items.
- Quantified maximum satisfiability (Q272016) (← links)
- MaxSAT by improved instance-specific algorithm configuration (Q274404) (← links)
- New local search methods for partial MaxSAT (Q329035) (← links)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes (Q505972) (← links)
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition (Q1621888) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- WPM3: an (in)complete algorithm for weighted partial MaxSAT (Q1680676) (← links)
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming (Q1730740) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- A novel algorithm for Max Sat calling MOCE to order (Q2149880) (← links)
