DPLL(T)

DPLL(T) is an extension of the DPLL (Davis-Putnam-Logemann-Loveland) algorithm, which is used for solving satisfiability problems in propositional logic. The DPLL algorithm itself is a backtracking-based method primarily focused on deciding the satisfiability of propositional formulas in conjunctive normal form (CNF).