- Automated reasoning
- >
- Automated theorem proving
- >
- Satisfiability problems
- >
- SAT solvers

- Complex systems theory
- >
- Computational complexity theory
- >
- NP-complete problems
- >
- SAT solvers

- Computational complexity theory
- >
- Computational problems
- >
- NP-complete problems
- >
- SAT solvers

- Computational complexity theory
- >
- Computational problems
- >
- Satisfiability problems
- >
- SAT solvers

- Computational mathematics
- >
- Automated theorem proving
- >
- Satisfiability problems
- >
- SAT solvers

- Formal methods
- >
- Automated theorem proving
- >
- Satisfiability problems
- >
- SAT solvers

- Logic in computer science
- >
- Automated theorem proving
- >
- Satisfiability problems
- >
- SAT solvers

- Logic programming
- >
- Automated theorem proving
- >
- Satisfiability problems
- >
- SAT solvers

- Mathematical logic
- >
- Automated theorem proving
- >
- Satisfiability problems
- >
- SAT solvers

- Mathematical problems
- >
- Computational problems
- >
- NP-complete problems
- >
- SAT solvers

- Mathematical problems
- >
- Computational problems
- >
- Satisfiability problems
- >
- SAT solvers

- Mathematical proofs
- >
- Automated theorem proving
- >
- Satisfiability problems
- >
- SAT solvers

- Mathematical tools
- >
- Mathematical software
- >
- Formal methods tools
- >
- SAT solvers

- Mathematics of computing
- >
- Formal methods
- >
- Formal methods tools
- >
- SAT solvers

- Mathematics of computing
- >
- Formal methods
- >
- Satisfiability problems
- >
- SAT solvers

- Mathematics of computing
- >
- Mathematical software
- >
- Formal methods tools
- >
- SAT solvers

- Theoretical computer science
- >
- Formal methods
- >
- Formal methods tools
- >
- SAT solvers

- Theoretical computer science
- >
- Formal methods
- >
- Satisfiability problems
- >
- SAT solvers

- Theory of computation
- >
- Computational complexity theory
- >
- NP-complete problems
- >
- SAT solvers

Conflict-driven clause learning

In computer science, conflict-driven clause learning (CDCL) is an algorithm for solving the Boolean satisfiability problem (SAT). Given a Boolean formula, the SAT problem asks for an assignment of var

GRASP (SAT solver)

GRASP is a well known SAT instance solver. It was developed by João Marques Silva, a Portuguese computer science researcher. It stands for Generic seaRch Algorithm for the Satisfiability Problem.

DPLL(T)

In computer science, DPLL(T) is a framework for determining the satisfiability of SMT problems. The algorithm extends the original SAT-solving DPLL algorithm with the ability to reason about an arbitr

Satz (SAT solver)

SatZ is a well known SAT instance solver. It was developed by Prof. , a computer science researcher. The Z stands for the last version of SAT solvers.

WalkSAT

In computer science, GSAT and WalkSAT are local search algorithms to solve Boolean satisfiability problems. Both algorithms work on formulae in Boolean logic that are in, or have been converted into c

Chaff algorithm

Chaff is an algorithm for solving instances of the Boolean satisfiability problem in programming. It was designed by researchers at Princeton University, United States. The algorithm is an instance of

DPLL algorithm

In logic and computer science, the Davis–Putnam–Logemann–Loveland (DPLL) algorithm is a complete, backtracking-based search algorithm for deciding the satisfiability of propositional logic formulae in

© 2023 Useful Links.