Algorithms for the Satisfiability Problem
Jun Gu, Paul Walton Purdom, John V. Franco, Benjamin Wan-Sang Wah · 2018
An instance of the satisfiability (SAT) problem is a Boolean formula that has three components [102, 191]: A set of n variables: x 1, x 2, x n . A set of literals. A literal is a variable (Q = x) or a negation of a variable \( \left( {Q = \bar x} \right)\). A set of m distinct clauses: C 1, C 2, ..., C m. Each clause consists of only literals combined by just logical or (V) connectives.