Consider this SAT problem: (x1 or x2 or x3) AND (¬x1 or ¬x2) AND (¬x1 or ¬x3 ) AND (¬x2 or ¬x3)
1 1 -Access Control - 2 - Foundational Results. 2 2 Preliminaries Undecidability The Halting Problem The Turing Machine.
