A 2-satisfiability (2SAT) problem is a CNF problem with at most two literals in each clause.
Show that 3-resolution, which has polynomial complexity, is complete for 2SAT.
Describe a faster method to check for satisfiability by formulating the problem on a graph.
Create a vertex for every variable and its negation and two directed edges for each clause.