• Sat4j

  • Referenced in 63 articles [sw07283]
  • satisfaction and optimization problems. It can solve SAT, MAXSAT, Pseudo-Boolean, Minimally Unsatisfiable Subset ... fastest one to solve those problems (a SAT solver in Java is about 3.25 times...
  • BerkMin

  • Referenced in 158 articles [sw06917]
  • with Chaff, the leader among resolution-based SAT-solvers. Experiments show that our program ... more robust than Chaff being able to solve more instances than Chaff in a reasonable...
  • DRAT-trim

  • Referenced in 25 articles [sw13313]
  • predecessor, DRUP-trim, all presently known SAT solving and preprocessing techniques can be validated using...
  • WASP

  • Referenced in 20 articles [sw09565]
  • WASP implements techniques originally introduced for SAT solving that have been extended to cope with ... learning and backjumping. Moreover, WASP combines these SAT-based techniques with optimization methods that have...
  • clasp

  • Referenced in 78 articles [sw07095]
  • techniques from the area of Boolean constraint solving. The primary clasp algorithm relies on conflict ... that proved very successful for satisfiability checking (SAT). Unlike other learning ASP solvers, clasp does ... rely on legacy software, such as a SAT solver or any other existing ASP solver ... been genuinely developed for answer set solving based on conflict-driven nogood learning. clasp...
  • sharpSAT

  • Referenced in 17 articles [sw16713]
  • manner that is well suited for #SAT solving. We show that these techniques are highly ... solver performs significantly better than other #SAT solvers...
  • PrecoSAT

  • Referenced in 16 articles [sw07832]
  • mostly focusing on practical SAT solving. On our software page you find earlier SAT solvers...
  • Sugar

  • Referenced in 24 articles [sw09758]
  • Sugar is a SAT-based Constraint Solver. Constraint Satisfaction Problem (CSP) is encoded ... formula, and it is solved by an external SAT solver. Sugar also can solve Constraint...
  • zChaff

  • Referenced in 23 articles [sw04757]
  • well known CHAFF, an algorithm for solving satisfiability (SAT) problems. It won the Best Complete...
  • SATO

  • Referenced in 192 articles [sw04451]
  • major practical methods for the satisfiability (SAT) problem of propositional logic. In the last decade ... efficiency of our programs allowed us to solve over one hundred open quasigroup problems...
  • Coprocessor

  • Referenced in 13 articles [sw16739]
  • apply simplifications also for incremental SAT solving. Experiments show that Coprocessor 2.0 performs better than...
  • FORCE

  • Referenced in 9 articles [sw09016]
  • size of BDDs and accelerate SAT-solving. Applications to reachability analysis have also been successful ... several times larger than any existing SAT solver. Tweaking MINCE is difficult.In this work ... MINCE orderings does not affect subsequent SAT-solving...
  • HordeSat

  • Referenced in 8 articles [sw16712]
  • successful approach to parallel satisfiability (SAT) solving is to run several different (a portfolio ... case of massively parallel SAT solving. Our solver is intended to run on clusters with ... HordeSat is a fully distributed portfolio-based SAT solver with a modular design that allows...
  • Pueblo

  • Referenced in 29 articles [sw00743]
  • constraints into generic SAT solvers in order to solve PB satisfiability and optimization problems ... solving PB problems, namely integer linear programming and pre-processing to CNF SAT, and present...
  • PaMiraXT

  • Referenced in 10 articles [sw06997]
  • PaMiraXT: parallel SAT solving with threads and message passing. This article describes PaMiraXT, a powerful ... well to other state-of-the-art SAT algorithms. In single-threaded mode, it outperforms ... MiraXT provides cutting edge performance, as it solves significantly more instances within the given time ... industrial benchmarks of the 2007 SAT competition...
  • Proteus

  • Referenced in 8 articles [sw10080]
  • recent years, portfolio approaches to solving SAT problems and CSPs have become increasingly common. There ... leverage advances in both SAT and CSP solving to present a novel hierarchical portfolio-based ... approach to CSP solving, which we call Proteus, that does not rely purely ... encode a CSP problem instance into SAT, selecting an appropriate encoding and a corresponding...
  • SATzilla

  • Referenced in 77 articles [sw06281]
  • constructing per-instance algorithm portfolios for SAT that use so-called empirical hardness models ... such as mean runtime, percent of instances solved, or score in a competition). The excellent ... SATzilla was independently verified in the 2007 SAT Competition, where our SATzilla07 solvers won three...
  • MaxSolver

  • Referenced in 20 articles [sw01990]
  • optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy ... most competitive exact algorithms for solving max-SAT. In this paper, we propose and investigate...
  • versat

  • Referenced in 8 articles [sw08417]
  • versat to a state-of-the-art SAT solver that produces certified “unsat” answers ... empirical evaluation that versat can solve SAT problems on the modern scale...
  • tawSolver

  • Referenced in 8 articles [sw10844]
  • holistic” research platform for (generalised) SAT solving. Report CSR 1-2009. Report Series Computer Science...