The following pages link to SAT-based MaxSAT algorithms (Q360042):
Displaying 35 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)
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (Q2009185) (← links)
- Probabilistic characterization of random Max \(r\)-Sat (Q2042075) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- Clause redundancy and preprocessing in maximum satisfiability (Q2104499) (← links)
- A novel algorithm for Max Sat calling MOCE to order (Q2149880) (← links)
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability (Q2211872) (← links)
- Popularity-similarity random SAT formulas (Q2238712) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- On the complexity of inconsistency measurement (Q2321337) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$ (Q2818001) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- Advances in WASP (Q3449189) (← links)
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem (Q3452557) (← links)
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT (Q4632177) (← links)
- Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem (Q4965126) (← links)
- RC2: an Efficient MaxSAT Solver (Q5015603) (← links)
- Boosting branch-and-bound MaxSAT solvers with clause learning (Q5106262) (← links)
- Hybrid metabolic network completion (Q5197745) (← links)
- Proofs and Certificates for Max-SAT (Q5870516) (← links)
- A memetic algorithm for restoring feasibility in scheduling with limited makespan (Q6177176) (← links)
