
Chaff
 Referenced in 563 articles
[sw06916]
 Chaff:engineering an efficient SAT solver. Boolean Satisfiability is probably the most studied of combinatorial ... search  especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel...

Walksat
 Referenced in 205 articles
[sw04328]
 local search algorithms to solve Boolean satisfiability problems. Both algorithms work on formulae that...

Quaffle
 Referenced in 63 articles
[sw07278]
 Conflicts And Satisfaction in Quantified Boolean Satisfiability Solver”, Proceedings of 8th International Conference on Principles ... Conflict Driven Learning in a Quantified Boolean Satisfiability Solver”, Proceedings of International Conference on Computer...

MaxSolver
 Referenced in 20 articles
[sw01990]
 Maximum Boolean satisfiability (maxSAT) is the optimization counterpart of Boolean satisfiability (SAT), in which ... sought to satisfy the maximum number of clauses in a Boolean formula. A branch...

QUBE
 Referenced in 29 articles
[sw11381]
 QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability. Deciding the satisfiability of a Quantified ... Boolean Formula (QBF) is an important research issue in Artificial Intelligence. Many reasoning tasks involving ... mapped into the problem of deciding the satisfiability of a QBF. In this paper...

RSat
 Referenced in 22 articles
[sw13117]
 RSat is a complete Boolean satisfiability solver with an exhaustive search interface for applications such...

Zchaff2004
 Referenced in 21 articles
[sw01032]
 Boolean Satisfiability Problem (SAT) is a well known NPcomplete problem. While its complexity remains...

Reveal
 Referenced in 20 articles
[sw00801]
 conflictbased learning in modern Boolean satisfiability solvers. The abstraction/refinement process is iterated until...

Localizer
 Referenced in 19 articles
[sw21238]
 scientific papers. Experimental results on Boolean satisfiability graph coloring, graph partitioning, and jobshop scheduling...

QBFLIB
 Referenced in 17 articles
[sw09581]
 Quantified Boolean formulas satisfiability library (QBFLIB). QBFLIB is a collection of instances, solvers, and tools ... related to Quantified Boolean Formula (QBF) satisfiability. QBFLIB is meant as a service...

UnitWalk
 Referenced in 34 articles
[sw00993]
 algorithm for SAT, i.e., the satisfiability problem for Boolean formulas in conjunctive normal form. Despite...

QUBOS
 Referenced in 24 articles
[sw09580]
 QUBOS: Deciding quantified Boolean logic using propositional satisfiability solvers. We describe QUBOS (QUantified BOolean Solver ... decision procedure for quantified Boolean logic. The procedure is based on nonclausal simplification techniques that ... clausal form after which offtheshelf satisfiability solvers can be employed. We show that...

CCASat
 Referenced in 10 articles
[sw12924]
 Local search for Boolean satisfiability with configuration checking and subscore. This paper presents and analyzes ... efficient local search strategies for the Boolean Satisfiability (SAT) problem. We start by proposing...

ZetaSAT
 Referenced in 7 articles
[sw11459]
 ZetaSAT – Boolean satisfiability solving on desktop grids. ZetaSAT is a research effort to enable efficient ... parallel Boolean satisfiability (SAT) solving on the Desktop Grid. ZetaSAT is based on the Desktop...

Shatter
 Referenced in 6 articles
[sw21225]
 Shatter: efficient symmetrybreaking for boolean satisfiability. Boolean satisfiability (SAT) solvers have experienced dramatic improvements ... work pointed out that symmetries in the Boolean search space are often to blame ... regions of the space without affecting the satisfiability of the CNF formula. For symmetry breaking...

Saturn
 Referenced in 8 articles
[sw01297]
 detection Saturn is a Boolean satisfiability (SAT) based framework for static bug detection. Saturn targets...

EVC
 Referenced in 8 articles
[sw13374]
 then be evaluated by any Boolean satisfiability (SAT) procedure. EVC has been used...

clasp
 Referenced in 90 articles
[sw07095]
 techniques from the area of Boolean constraint solving. The primary clasp algorithm relies on conflict ... technique that proved very successful for satisfiability checking (SAT). Unlike other learning ASP solvers, clasp...

InKreSAT
 Referenced in 5 articles
[sw23448]
 given modal satisfiability problem to a Boolean satisfiability problem, which is then solved using...