• SATO

  • Referenced in 196 articles [sw04451]
  • major practical methods for the satisfiability (SAT) problem of propositional logic. In the last decade...
  • Chaff

  • Referenced in 586 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...
  • Sat4j

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

  • Referenced in 59 articles [sw02107]
  • benchmark problems, solvers, and tools we are using for our own SAT related research ... well as a site for collecting SAT problem instances, algorithms, and empirical characterisations...
  • VerICS

  • Referenced in 35 articles [sw02011]
  • satisfiability problem of propositional formulas (SAT-problem) is used. For proving correctness...
  • zChaff

  • Referenced in 37 articles [sw04757]
  • 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...
  • PySAT

  • Referenced in 18 articles [sw25459]
  • prototyping with SAT oracles. Boolean satisfiability (SAT) solvers are at the core of efficient approaches ... solving a vast multitude of practical problems ... Moreover, albeit targeting an NP-complete problem, SAT solvers are increasingly used for tackling problems ... with SAT and more importantly implementing SAT-based problem solving solutions is often a difficult...
  • Zchaff2004

  • Referenced in 21 articles [sw01032]
  • Boolean Satisfiability Problem (SAT) is a well known NP-complete problem. While its complexity remains ... problem has found many practical applications in recent years. The emergence of efficient SAT solvers...
  • NiVER

  • Referenced in 19 articles [sw06958]
  • instances. The original algorithm for the SAT problem, Variable Elimination Resolution, has exponential space complexity ... used in SAT solvers. We present a combination of two techniques: we use NiVER ... then solve the simplified problem using a DPLL SAT solver. NiVER is a strictly formula...
  • CCLS

  • Referenced in 20 articles [sw36049]
  • Maximum Satisfiability. The maximum satisfiability (MAX-SAT) problem, especially the weighted version, has extensive applications...
  • SATenstein

  • Referenced in 19 articles [sw14233]
  • search SAT solvers from components. Designing high-performance solvers for computationally hard problems ... solvers for the propositional satisfiability problem (SAT). We first introduce a generalized, highly parameterized solver...
  • UnitWalk

  • Referenced in 36 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...
  • Sugar

  • Referenced in 27 articles [sw09758]
  • Sugar is a SAT-based Constraint Solver. Constraint Satisfaction Problem (CSP) is encoded ... external SAT solver. Sugar also can solve Constraint Optimization Problems (COP) and Max-CSP. Sugar...
  • Proteus

  • Referenced in 10 articles [sw10080]
  • recent years, portfolio approaches to solving SAT problems and CSPs have become increasingly common. There ... different encodings for representing CSPs as SAT instances. In this paper, we leverage advances ... best to encode a CSP problem instance into SAT, selecting an appropriate encoding ... encodings, and six SAT solvers, evaluated on the most challenging problem instances from...
  • CCASat

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

  • Referenced in 12 articles [sw20690]
  • solve both plan generation and plan adaptation problems. The basic search scheme ... Walksat, an efficient procedure to solve SAT-problems. The search space of LPG consists...
  • SATzilla

  • Referenced in 99 articles [sw06281]
  • constructing per-instance algorithm portfolios for SAT that use so-called empirical hardness models ... approach takes as input a distribution of problem instances and a set of component solvers ... SATzilla was independently verified in the 2007 SAT Competition, where our SATzilla07 solvers won three...
  • ChainSAT

  • Referenced in 10 articles [sw09444]
  • descent prevails in solving random constraint satisfaction problems. We study the performance of stochastic local ... instances of the K-satisfiability (K-SAT) problem. We present a stochastic local search algorithm ... moves in the energy landscape of a problem instance by never going upwards in energy ... other focused algorithms solve large K-SAT instances almost surely in linear time...
  • versat

  • Referenced in 10 articles [sw08417]
  • empirical evaluation that versat can solve SAT problems on the modern scale...
  • Pueblo

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