In this video we focus on binary constraints: clauses with two literals. A 2-SAT problem is a conjunction of binary constraints. We will represent it as a partial ordering on literals.

In this video we look at the simplest example, a single clause, and see how we can use the ordering to count the satisfying valuations.