The $\ell_{i,j}$ are so called *literals* and have either the form $x_u$ or $\bar{x}_u := \neg x_u$, i.e., they are either a variable or a negation of it.
...
...
@@ -26,7 +26,7 @@ And example for such a formula would be
The boolean satisfiability problem asks if a given formula $\phi$ is *satisfiable$.
A formula is satisfiable if there is a *satifying assignment*,
i.e., a mapping $a: \{x_1,\ldots,x_n\}\to \{\texttt{wahr}, \texttt{falsch}\}$,
i.e., a mapping $a: \{x_1,\ldots,x_n\}\to \{\texttt{true}, \texttt{false}\}$,
that assignes every variable a boolean value, such that the formula evaluates to true.
For a formula $\phi$ is conjunctive normal form, this implies that every clause needs to be satisfied, i.e.,
at least on of its literals has been satisfied.
...
...
@@ -46,7 +46,7 @@ with Gluecard4(with_proof=False) as gc4: