• versat

  • Referenced in 9 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...
  • NiVER

  • Referenced in 18 articles [sw06958]
  • used in SAT solvers. We present a combination of two techniques: we use NiVER ... step, and then solve the simplified problem using a DPLL SAT solver. NiVER ... SAT solvers show the usefulness of NiVER. Some instances cannot be solved without NiVER preprocessing ... incorporated into all general purpose SAT solvers...
  • ZetaSAT

  • Referenced in 7 articles [sw11459]
  • ZetaSAT – Boolean satisfiability solving on desktop grids. ZetaSAT is a research effort ... enable efficient parallel Boolean satisfiability (SAT) solving on the Desktop Grid. ZetaSAT is based ... constraint satisfaction problems of the kind of SAT in Desktop Grids, like dynamic problem decomposition...
  • LPG

  • Referenced in 12 articles [sw20690]
  • Walksat, an efficient procedure to solve SAT-problems. The search space of LPG consists...
  • PaInleSS

  • Referenced in 4 articles [sw21967]
  • Painless: a framework for parallel SAT solving. Over the last decade, parallel SAT solving ... present PaInleSS: a framework to build parallel SAT solvers for many-core environments. Thanks ... implementation of basics for parallel SAT solving like clause exchanges, portfolio and divide and conquer...
  • CirCUs

  • Referenced in 9 articles [sw00128]
  • SAT instances given in CNF. Specifically, the clauses are sorted by solving a hypergraph linear ... single diagram, the SAT instance is solved directly. Otherwise, search for a satisfying assignment ... especially for medium-size SAT instances that are hard to solve by traditional solvers based...
  • CCLS

  • Referenced in 14 articles [sw36049]
  • Eighth Max-SAT Evaluation (Max-SAT 2013), and wins four tracks in this evaluation, illustrating ... performance of SLS algorithms on solving MAX-SAT instances...
  • TACO

  • Referenced in 6 articles [sw07668]
  • tools based on SAT-solving, model checking or SMT-solving...
  • Azucar

  • Referenced in 5 articles [sw10083]
  • This paper describes a SAT-based CSP solver Azucar. Azucar solves a finite ... compact order encoding and then solving the encoded SAT instance with an external SAT solver ... SAT-based CSP solver Sugar. Through some experiments, we confirmed Azucar can encode and solve...
  • MPIDepQBF

  • Referenced in 4 articles [sw18671]
  • Inspired by recent work on parallel SAT solving, we present a lightweight approach for solving...
  • antom

  • Referenced in 4 articles [sw11457]
  • antom is a C++ library for solving: SAT, Unweighted MaxSAT, Partial MaxSAT, and #SAT problems...
  • GrADSAT

  • Referenced in 5 articles [sw07282]
  • parallel satisfiability solver aimed at solving hard SAT instances using a large number of widely ... most instances. Furthermore it is capable of solving problem instance which were never solved before...
  • kcnfs

  • Referenced in 8 articles [sw00484]
  • prove the unsatisfiability of random k-sat formulae and which has been inspired by recent ... waspresented in [DD01] and generalized to solve k-sat formulae with a renormalization strategy...
  • PySAT

  • Referenced in 6 articles [sw25459]
  • Boolean satisfiability (SAT) solvers are at the core of efficient approaches for solving a vast ... more importantly implementing SAT-based problem solving solutions is often a difficult and error-prone ... which enables fast Python-based prototyping using SAT oracles and SAT-related technology. PySAT provides...
  • URSA

  • Referenced in 4 articles [sw15541]
  • from various areas, being solved by reducing them to SAT. However, for many applications, translation ... into SAT is performed by specialized, problem-specific tools. In this paper we describe ... uniform solving of a wide class of problems by reducing them to SAT. The system ... tool for solving problems by reducing them to SAT, but also as a general-purpose...
  • OKlibrary

  • Referenced in 2 articles [sw28616]
  • generative research platform for (generalised) SAT solving. The OKlibrary is introduced, an active library supporting ... development in the area of generalised SAT-solving, available at http://www. ok-sat-library.org. We discuss ... generalised satisfiability problems” as a generalisation of SAT towards CSP, and we discuss the basic...
  • PASSAT

  • Referenced in 3 articles [sw10074]
  • algorithm that makes use of powerful SAT-solving techniques. Problem specific heuristics are applied ... guide the search. In contrast to previous SAT-based algorithms, the new approach can also...
  • ChainSAT

  • Referenced in 8 articles [sw09444]
  • Circumspect descent prevails in solving random constraint satisfaction problems. We study the performance of stochastic ... random instances of the K-satisfiability (K-SAT) problem. We present a stochastic local search ... ChainSAT and other focused algorithms solve large K-SAT instances almost surely in linear time...
  • FrankenBit

  • Referenced in 3 articles [sw25253]
  • been an amazing progress in SAT solving, Satisfiability Modulo Theory of Bit Vectors...
  • CryptoMiniSat

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