• Chaff

  • Referenced in 579 articles [sw06916]
  • efficient SAT solver. Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant ... provide practical solutions to this problem for problem instances encountered in a range of applications ... culminated in the development of several SAT packages, both proprietary and in the public domain ... search - especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel...
  • Zchaff2004

  • Referenced in 21 articles [sw01032]
  • Boolean Satisfiability Problem (SAT) is a well known NP-complete problem. While its complexity remains...
  • UnitWalk

  • Referenced in 35 articles [sw00993]
  • randomized algorithm for SAT, i.e., the satisfiability problem for Boolean formulas in conjunctive normal form ... many common benchmarks ranging from graph coloring problems to microprocessor verification. Our algorithm is inspired ... local search (which is used in many SAT algorithms, e.g., in GSAT and WalkSAT...
  • CCASat

  • Referenced in 12 articles [sw12924]
  • local search strategies for the Boolean Satisfiability (SAT) problem. We start by proposing a local...
  • satUZK

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

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

  • Referenced in 30 articles [sw00743]
  • Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability ... optimization problems. To achieve this, we adopt the cutting-plane technique to draw inferences among...
  • Quantor

  • Referenced in 22 articles [sw28381]
  • boolean formulas (QBF) in the QDIMACS format. Checking satisfiability of QBF, the QBF problem ... standard PSPACE complete problem. Many practically important problems, such as non-deterministic planning or symbolic ... applications. More information on the QBF problem can be found at QBFLIB. The algorithm behind ... used as preprocessor in the context of SAT and as such was submitted...
  • NLocalSAT

  • Referenced in 1 article [sw40123]
  • Search with Solution Prediction. The Boolean satisfiability problem (SAT) is a famous NP-complete problem...
  • FourierSAT

  • Referenced in 1 article [sw40459]
  • multilinear Fourier expansions. The Boolean SATisfiability problem (SAT) is of central importance in computer science ... Local Search SAT solvers—has been remarkable. Yet, while SAT solvers, aimed at solving industrial ... Normal Form (CNF), have become quite mature, SAT solvers that are effective on other types ... SAT solver based on Fourier Analysis (also known as Walsh-Fourier Transform) of Boolean functions...
  • meSAT

  • Referenced in 5 articles [sw29642]
  • SAT. One approach for solving Constraint Satisfaction Problems (CSP) (and related Constraint Optimization Problems ... involving integer and Boolean variables is reduction to propositional satisfiability problem (SAT). A number...
  • InKreSAT

  • Referenced in 5 articles [sw23448]
  • InKreSAT: modal reasoning via incremental reduction to SAT. InKreSAT is a prover for the modal ... Boolean satisfiability problem, which is then solved using a SAT solver. InKreSAT improves on previous...
  • PySAT

  • Referenced in 10 articles [sw25459]
  • toolkit for prototyping with SAT oracles. Boolean satisfiability (SAT) solvers are at the core ... solving a vast multitude of practical problems. Moreover, albeit targeting an NP-complete problem...
  • ZetaSAT

  • Referenced in 7 articles [sw11459]
  • research effort to enable efficient parallel Boolean satisfiability (SAT) solving on the Desktop Grid. ZetaSAT ... specific issues arising when executing constraint satisfaction problems of the kind of SAT in Desktop...
  • MaxSolver

  • Referenced in 20 articles [sw01990]
  • sought to satisfy the maximum number of clauses in a Boolean formula. A branch ... SAT. In this paper, we propose and investigate a number of strategies for max-SAT ... propagation or unit resolution rules for max-SAT. We summarize three existing unit propagation rules ... both max-SAT and weighted max-SAT. Our experimental results on random problem instances...
  • 3BA

  • Referenced in 2 articles [sw25685]
  • SAT extension. Many search problems over Boolean variables can be formulated in terms of satisfiability ... clauses or solving a system of Boolean polynomials. On one hand, there exists a great ... from different areas such as commutative algebra, SAT or SMT, that can be used ... power of the Boolean border basis algorithm (BBBA) with a CDCL SAT solver...
  • aspeed

  • Referenced in 10 articles [sw27492]
  • solver scheduling via answer set programming. Although Boolean Constraint Technology has made tremendous progress over ... problem instances, and is known to depend strongly on algorithm parameters. This problem was addressed ... very impressive performance in the 2011 Satisfiability Testing (SAT) Competition. Inspired by this, we take...
  • PASSAT

  • Referenced in 3 articles [sw10074]
  • Boolean satisfiability (SAT) has been proposed as an alternative to classical search algorithms. SAT-based ... robust and more effective by formulating the problem as a set of equations. In this...
  • DiffSat

  • Referenced in 1 article [sw13372]
  • Solving SAT problem by heuristic polarity decision-making algorithm. This paper presents a heuristic ... polarity decision-making algorithm for solving Boolean satisfiability (SAT). The algorithm inherits many features...
  • BoolVar/PB

  • Referenced in 2 articles [sw13579]
  • satisfiable if and only if the input problem admits a solution. BoolVar/PB allows problems that ... specified with pseudo-Boolean constraints to be solved using SAT solvers...