The following pages link to MaxHS (Q32998):
Displaying 30 items.
- Fast, flexible MUS enumeration (Q272009) (← links)
- New local search methods for partial MaxSAT (Q329035) (← links)
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models (Q785238) (← links)
- WPM3: an (in)complete algorithm for weighted partial MaxSAT (Q1680676) (← links)
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (Q2009185) (← links)
- Probabilistic characterization of random Max \(r\)-Sat (Q2042075) (← links)
- Understanding the power of Max-SAT resolution through up-resilience (Q2046032) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- SAT-based rigorous explanations for decision lists (Q2118305) (← links)
- A proof builder for Max-SAT (Q2118341) (← links)
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability (Q2211872) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- Multi-language evaluation of exact solvers in graphical model discrete optimization (Q2398440) (← links)
- Computational protein design as an optimization problem (Q2453727) (← 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)
- BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies (Q2818038) (← links)
- LMHS: A SAT-IP Hybrid MaxSAT Solver (Q2818041) (← links)
- Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) (← links)
- Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances (Q3453234) (← links)
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT (Q4632177) (← links)
- Boosting Answer Set Optimization with Weighted Comparator Networks (Q4957202) (← links)
- Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem (Q4965126) (← links)
- Boosting branch-and-bound MaxSAT solvers with clause learning (Q5106262) (← links)
- Proofs and Certificates for Max-SAT (Q5870516) (← links)
- Publication:4957202 (← links)
