Treats propositional satisfiability as both a logical problem and a computational task. Learners use DPLL, conflict-driven clause learning, watched literals, and modern SAT solvers to encode and solve constraint problems.
