• ManySAT

  • Referenced in 36 articles [sw00544]
  • ManySAT: a parallel SAT solver. ManySAT, a new portfolio-based parallel SAT solver, is thoroughly ... benefits from the main weaknesses of modern SAT solvers: their sensitivity to parameter tuning ... This contrasts with most of the parallel SAT solvers generally designed using the divide ... conquer paradigm. Experiments on many industrial SAT instances, and the first rank obtained by ManySAT...
  • MiniMaxSat

  • Referenced in 36 articles [sw09732]
  • MiniMaxSat: A New Weighted Max-SAT Solver. n this paper we introduce MiniMaxSat ... SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard ... clauses (clauses of mandatory satisfaction as in SAT), soft clauses (clauses whose falsification is penalized ... cost as in Max-SAT) as well as pseudo-boolean objective functions and constraints...
  • MathSAT5

  • Referenced in 45 articles [sw09569]
  • arrays and floating point; third, sound SAT-style Boolean formula preprocessing for SMT formulae; finally ... allowing users for plugging their custom tuned SAT solvers. MathSAT5 is freely available...
  • Nitpick

  • Referenced in 61 articles [sw00622]
  • Isabelle/HOL that builds on Kodkod, a SAT-based first-order relational model finder. Nitpick supports...
  • Plingeling

  • Referenced in 60 articles [sw07091]
  • Lingeling, plingeling, picosat and precosat at sat race...
  • zChaff

  • Referenced in 37 articles [sw04757]
  • known CHAFF, an algorithm for solving satisfiability (SAT) problems. It won the Best Complete Solver ... industrial and handmade benchmark categories in the SAT 2002 Competition, and the Best Complete Solver ... industrial benchmark in the SAT 2004 Competition. It is a popular solver...
  • PSATO

  • Referenced in 41 articles [sw02635]
  • PSATO: a Distributed/parallel Prover for propositional satisfiability (SAT) for networks of workstations. PSATO is based ... sequential SAT prover SATO, which is an efficient implementation of the Davis-Putnam algorithm...
  • SatAbs

  • Referenced in 41 articles [sw12804]
  • SATABS: SAT-based predicate abstraction for ANSI-C. This paper presents a model checking tool ... SatAbs overcomes these limitations by using a SAT-solver. This allows the model checker...
  • UnitWalk

  • Referenced in 35 articles [sw00993]
  • present a new randomized algorithm for SAT, i.e., the satisfiability problem for Boolean formulas ... local search (which is used in many SAT algorithms, e.g., in GSAT and WalkSAT ... several implementations of our algorithm with other SAT solvers. We also prove that our algorithm...
  • UBCSAT

  • Referenced in 39 articles [sw02614]
  • experimentation environment for SLS algorithms for SAT ... SAT...
  • Glucose

  • Referenced in 39 articles [sw07833]
  • Glucose SAT Solver. Glucose is based on a new scoring scheme (well ... clause learning mechanism of so called ”Modern” SAT sovlers (it is based our IJCAI...
  • Satallax

  • Referenced in 52 articles [sw06849]
  • theory with extensionality and choice operators. The SAT solver MiniSat is responsible for much...
  • iProver

  • Referenced in 49 articles [sw09707]
  • particular, any state-of-the art SAT solver can be integrated into our framework. iProver...
  • sharpSAT

  • Referenced in 25 articles [sw16713]
  • implicit BCP. We introduce sharpSAT, a new #SAT solver that is based on the well ... known DPLL algorithm and techniques from SAT and #SAT solvers. Most importantly, we introduce ... manner that is well suited for #SAT solving. We show that these techniques are highly ... solver performs significantly better than other #SAT solvers...
  • Treengeling

  • Referenced in 44 articles [sw13314]
  • tracks (out of 11) of the SAT’14 Competition and thus won 4 Gödel medals...
  • Pueblo

  • Referenced in 30 articles [sw00743]
  • integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability ... linear programming and pre-processing to CNF SAT, and present a thorough comparison between them...
  • MaxSolver

  • Referenced in 20 articles [sw01990]
  • Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which ... most competitive exact algorithms for solving max-SAT. In this paper, we propose and investigate ... number of strategies for max-SAT. The first strategy is a set of unit propagation ... unit resolution rules for max-SAT. We summarize three existing unit propagation rules and propose...
  • Zchaff2004

  • Referenced in 21 articles [sw01032]
  • Boolean Satisfiability Problem (SAT) is a well known NP-complete problem. While its complexity remains ... recent years. The emergence of efficient SAT solvers which can handle large structured SAT instances ... enabled the use of SAT solvers in diverse domains such as electronic design automation ... development of faster and more robust SAT solvers. In this paper, we describe the popular...