MaxHS
From MaRDI portal
Cited in
(72)- QMaxSATpb
- LMHS: a SAT-IP hybrid MaxSat solver
- Fast, flexible MUS enumeration
- Probabilistic characterization of random Max \(r\)-Sat
- Understanding the power of Max-SAT resolution through up-resilience
- Logic-based Benders decomposition for large-scale optimization
- A proof builder for Max-SAT
- SAT-based rigorous explanations for decision lists
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT
- CHAMP: a multipass algorithm for Max Sat based on saver variables
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- OptSAT
- MaxSolver
- UBCSAT
- RPOLY
- Sat4j
- NumberJack
- ToulBar2
- LOOPS
- OPIUM
- QMaxSAT
- MiniMaxSat
- MSUnCore
- Open-WBO
- PackUp
- Ltur
- CEL
- CCASat
- Alchemy
- Coprocessor
- Just
- LMHS
- VOLT
- WPM2
- DAOOPT
- mplp2
- OpenGM
- Osprey
- MaxPre
- llama
- EL2MCS
- BooleForce
- Tuffy
- SCIPPlan
- maxino
- RockIt
- Boosting Answer Set Optimization with Weighted Comparator Networks
- CCLS
- CCEHC
- SATLike
- RC2
- HgMUS
- Iterative and core-guided maxsat solving: a survey and assessment
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Propositional proof systems based on maximum satisfiability
- Using merging variables-based local search to solve special variants of MaxSAT problem
- WPM3
- Open-WBO-Inc
- Boosting branch-and-bound MaxSAT solvers with clause learning
- New local search methods for partial MaxSAT
- Exploiting subproblem optimization in SAT-based maxsat algorithms
- Volt: a lazy grounding framework for solving very large MaxSAT instances
- Proofs and Certificates for Max-SAT
- BEACON: an efficient SAT-based tool for debugging \(\mathcal {EL}^+\) ontologies
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
- The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- Computational protein design as an optimization problem
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- Using the method of conditional expectations to supply an improved starting point for CCLS
This page was built for software: MaxHS
