swMATH21187MaRDI QIDQ32998FDOQ32998
Author name not available (Why is that?)
Official website: http://www.maxhs.org/
Cited In (70)
- QMaxSATpb
- Boosting Answer Set Optimization with Weighted Comparator Networks
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Using merging variables-based local search to solve special variants of MaxSAT problem
- Fast, flexible MUS enumeration
- A proof builder for Max-SAT
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT
- Propositional proof systems based on maximum satisfiability
- BEACON: an efficient SAT-based tool for debugging \(\mathcal {EL}^+\) ontologies
- The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$
- New local search methods for partial MaxSAT
- Probabilistic characterization of random Max \(r\)-Sat
- Understanding the power of Max-SAT resolution through up-resilience
- OptSAT
- 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
- Iterative and core-guided maxsat solving: a survey and assessment
- CCLS
- CCEHC
- SATLike
- RC2
- Boosting branch-and-bound MaxSAT solvers with clause learning
- HgMUS
- LMHS: a SAT-IP hybrid MaxSat solver
- SAT-based rigorous explanations for decision lists
- Volt: a lazy grounding framework for solving very large MaxSAT instances
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models
- WPM3
- Open-WBO-Inc
- CHAMP: a multipass algorithm for Max Sat based on saver variables
- Proofs and Certificates for Max-SAT
- Logic-based Benders decomposition for large-scale optimization
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
- 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
- Exploiting subproblem optimization in SAT-based maxsat algorithms
This page was built for software: MaxHS
