• WPM3

  • Referenced in 6 articles [sw41870]
  • solvers for real world (industrial) problems were those implementing SAT-based algorithms. These algorithms reformulate ... optimization problem into a sequence of SAT decision problems where Pseudo-Boolean (PB) constraints ... unsatisfiable cores retrieved from the previous SAT problems in the sequence while refining the lower...
  • ModGen

  • Referenced in 6 articles [sw21347]
  • other researchers so that the SAT problems can be easily represented, stored and communicated ... easily replaced by any advanced SAT problem solver. ModGen is easy to use and very...
  • SAT competition

  • Referenced in 8 articles [sw04623]
  • international SAT Competitions web page. The purpose of the competition is to identify new challenging ... solvers for the propositional satisfiability problem (SAT) as well as to compare them with state...
  • ToulBar2

  • Referenced in 22 articles [sw07289]
  • Random Fields, Weighted Constraint Satisfaction Problems, Weighted Max-SAT, Quadratic Pseudo-Boolean Optimization, and Bayesian...
  • MaxSolver

  • Referenced in 20 articles [sw01990]
  • weighted max-SAT. Our experimental results on random problem instances and many instances from...
  • HordeSat

  • Referenced in 14 articles [sw16712]
  • different (a portfolio of) SAT solvers on the input problem at the same time until ... design that allows it to use any SAT solver that implements a given interface. HordeSat ... benchmark problems from the application tracks of the 2011 and 2014 International SAT Competitions...
  • meSAT

  • Referenced in 5 articles [sw29642]
  • SAT. One approach for solving Constraint Satisfaction Problems (CSP) (and related Constraint Optimization Problems ... variables is reduction to propositional satisfiability problem (SAT). A number of encodings (e.g., direct ... that performs well on all classes of problems and there is a need ... translates specifications of finite linear CSP problems into SAT instances using several well-known encodings...
  • PrecoSAT

  • Referenced in 21 articles [sw07832]
  • Competition. SAT is the classical NP complete problem of searching for a satisfying assignment ... aspects for the field. Further information on SAT can be found at www.satlive.org or www.satlib.org...
  • antom

  • Referenced in 5 articles [sw11457]
  • Unweighted MaxSAT, Partial MaxSAT, and #SAT problems...
  • c-sat

  • Referenced in 8 articles [sw00168]
  • Opterons on each node (32 PEs), c-sat ran at least 23 times faster than ... satisfiable problems) for 189 large-scale problems from SAT Competition and two SAT-Races...
  • WPM2

  • Referenced in 5 articles [sw19790]
  • optimization variant of the Satisfiability (SAT) problem. Several combinatorial optimization problems can be translated into...
  • Outward rotations

  • Referenced in 45 articles [sw08660]
  • with applications to MAX CUT and other problems. We present a tool, outward rotations ... improved approximation algorithm for MAX NAE-f3g-SAT. Finally, we provide some evidence that outward ... algorithms for MAX NAE-SAT and MAX SAT. 1 Introduction MAX CUT is perhaps ... most natural APX-complete constraint satisfaction problem (see, e.g., [AL97]). There are various simple ways...
  • iSat

  • Referenced in 4 articles [sw14762]
  • iSat: Structure Visualization for SAT Problems. We present iSat, a Python command line tool ... propositional satisfiability problems. iSat offers an interactive shell to control propositional SAT solvers and generate...
  • satUZK

  • Referenced in 4 articles [sw18570]
  • learning solver for the boolean satisfiability problem (SAT). It is written in C++ from scratch...
  • Anteater

  • Referenced in 4 articles [sw32373]
  • level network invariants into boolean satisfiability problems (SAT), checks them against network state using...
  • URSA

  • Referenced in 4 articles [sw15541]
  • uniform reduction to SAT. There are a huge number of problems, from various areas, being ... many applications, translation into SAT is performed by specialized, problem-specific tools. In this paper ... wide class of problems by reducing them to SAT. The system uses a new specification ... tool for solving problems by reducing them to SAT, but also as a general-purpose...
  • ZetaSAT

  • Referenced in 7 articles [sw11459]
  • effort to enable efficient parallel Boolean satisfiability (SAT) solving on the Desktop Grid. ZetaSAT ... when executing constraint satisfaction problems of the kind of SAT in Desktop Grids, like dynamic...
  • SATLIB Benchmark Suite

  • Referenced in 3 articles [sw11916]
  • problems: test-sets sampled from random instance distributions, such as uniform Random-3-SAT; test ... from random instance distribution of SAT-encoded combinatorial problems such as Graph Colouring; and individual ... search algorithms for SAT. For the SAT-encoded problems, the hardness of the instances ... that was used for transforming them into SAT...
  • SymChaff

  • Referenced in 6 articles [sw00938]
  • high level problem description to pass on symmetry information to the SAT solver ... best systematic SAT solvers on problems from both theory and practice, often by simply using...
  • CryptoMiniSat

  • Referenced in 41 articles [sw10082]
  • feature-set of CryptoMiniSat, a modern SAT Solver that aims to unify the advantages ... that can solve many types of different problem instances under reasonable time...