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