MaxHS is a fast solver for a variety of optimization problems. MaxHS accepts any of the four classes of MaxSat problems including the most general weighted partial class. Unlike most other MaxSat solvers MaxHS can accept floating point weights. Represent your optimization problem as a set of soft and hard clauses. The soft clauses can have weights. MaxHS takes its input in WDIMACS format as used by the MaxSat Evauations

References in zbMATH (referenced in 27 articles , 2 standard articles )

Showing results 1 to 20 of 27.
Sorted by year (citations)

1 2 next

  1. Berend, Daniel; Twitto, Yochai: Probabilistic characterization of random Max (r)-Sat (2021)
  2. Bonet, Maria Luisa; Buss, Sam; Ignatiev, Alexey; Morgado, Antonio; Marques-Silva, Joao: Propositional proof systems based on maximum satisfiability (2021)
  3. Ignatiev, Alexey; Marques-Silva, Joao: SAT-based rigorous explanations for decision lists (2021)
  4. Py, Matthieu; Cherif, Mohamed Sami; Habet, Djamal: A proof builder for Max-SAT (2021)
  5. Bomanson, Jori; Janhunen, Tomi: Boosting answer set optimization with weighted comparator networks (2020)
  6. Cai, Shaowei; Lei, Zhendong: Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability (2020)
  7. Cherif, Mohamed Sami; Habet, Djamal; Abramé, André: Understanding the power of Max-SAT resolution through up-resilience (2020)
  8. Otpuschennikov, Ilya V.; Semenov, Alexander A.: Using merging variables-based local search to solve special variants of MaxSAT problem (2020)
  9. Say, Buser; Sanner, Scott: Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models (2020)
  10. Hooker, John N.: Logic-based Benders decomposition for large-scale optimization (2019)
  11. Zha, Aolong; Koshimura, Miyuki; Fujita, Hiroshi: (N)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (2019)
  12. Ansótegui, Carlos; Gabàs, Joel: WPM3: an (in)complete algorithm for weighted partial MaxSAT (2017)
  13. Berg, Jeremias; Järvisalo, Matti: Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (2017)
  14. Ansótegui, Carlos; Gabàs, Joel; Levy, Jordi: Exploiting subproblem optimization in SAT-based maxsat algorithms (2016)
  15. Arif, M. Fareed; Mencía, Carlos; Ignatiev, Alexey; Manthey, Norbert; Peñaloza, Rafael; Marques-Silva, Joao: BEACON: an efficient SAT-based tool for debugging (\mathcalEL^+) ontologies (2016)
  16. Berend, Daniel; Twitto, Yochai: The normalized autocorrelation length of random Max (r)-Sat converges in probability to ((1-1/2^r)/r) (2016)
  17. Cai, Shaowei; Luo, Chuan; Lin, Jinkun; Su, Kaile: New local search methods for partial MaxSAT (2016)
  18. Hurley, Barry; O’Sullivan, Barry; Allouche, David; Katsirelos, George; Schiex, Thomas; Zytnicki, Matthias; de Givry, Simon: Multi-language evaluation of exact solvers in graphical model discrete optimization (2016)
  19. Liffiton, Mark H.; Previti, Alessandro; Malik, Ammar; Marques-Silva, Joao: Fast, flexible MUS enumeration (2016)
  20. Liu, Yan-Li; Li, Chu-Min; He, Kun; Fan, Yi: Breaking cycle structure to improve lower bound for Max-SAT (2016)

1 2 next

Further publications can be found at: