bugfix in slide

satlecture · Aug 12, 2024 · da49d9d · da49d9d
1 parent bb2f5a7
commit da49d9d
Show file tree

Hide file tree

Showing 2 changed files with 1 addition and 1 deletion.
diff --git a/slides/l12-proofs.pdf b/slides/l12-proofs.pdf
diff --git a/slides/l12-proofs.tex b/slides/l12-proofs.tex
@@ -154,7 +154,7 @@
 \begin{frame}{Autarkies}
 Let a formula $F$ and a partial assignment $A$ be given.\\[1ex]
 \begin{itemize}\setlength{\itemsep}{1ex}
-    \item A clause $C \in F$ is \highlo{touched} by $A$ if it contains the negation of a literal assigned in $A$
+    \item A clause $C \in F$ is \highlo{touched} by $A$ if it contains a variable assigned in $A$
     \item A clause $C \in F$ is \highlo{satisfied} by $A$ if it contains a literal assigned to $\true$ by $A$
 \end{itemize}
 An autarky is a partial assignment $A$ such that \highlo{all touched clauses are satisfied}.