SATISFIABILITY

By Bhavna Singh And Sweta Choudhary

 1. COMPLEXITY CLASSES
2. STASFIABILITY
PROBLEM

AGENDA 3. EXAMPLE
4. CNF
5. 2-SAT PROBLEM
6.3-SAT PROBLEM
7. WHY SAT IS IMPORTANT
Computational
Complexity
Problems
 A formula φ is satisfiable
What is if there exists an
assignment of values to
Satisfiability its variables that makes φ
true.
 1. F = A^~B
is satisfiable, because A =
TRUE and B = FALSE makes F
EXAMPLES = TRUE
2. G= A ^ ~A
is unsatisfiable
 CNF : CNF is a conjunction
Conjuctive (AND) of clauses, where every
clause is a disjunction (OR).
Normal Form Example :
F = (A1 v B1) ^ (A2 v B2)^.....
(Am v Bm)
 In the 2-SAT problem,
every clause has two
What is 2-SAT literals and is solvable in a
Problem polynomial-time. 2-SAT
problem is also known as
2-CNF problem.
 1. F = (X1 v X2) ^ (X2 V ~X1) ^
(~X1 v ~X2)
The given expression is
satisfiable.
(for x1 = FALSE, x2 = TRUE)

EXAMPLE 2. F = (X1 v X2) ^ (X2 V ~X1) ^

(X1 v ~X2) ^ (~X1 v ~X2)
The given expression is
unsatisfiable.
(For all possible
combinations of x1 and x2)
 A SAT problem is a problem which
takes a Boolean formula S in CNF
from with each clause having exactly
three literals and cheack whether s is
3-SAT Problem satisfied or not .

3sat problem :
(a’+ b+ g’)(c +e’ +f )(b’+ d +f’ )(a +e + h’)
 There are a bunch of teddy bears A, B, C,
D and so on that are red on one side and
blue on the other! (You choose how to
color them)
AND there are a bunch of 3 armed aliens
Explanation with really long arms. Each alien grabs 3
teddy bear hands! (A teddy bear hand can
be grabbed by more than one alien.)
3-SAT is the problem of whether you can
color the teddy bears such that every alien
is holding at least one blue hand!
 Proof : Let S be the Boolean
formula having 3 literals in each
clause for which we can
3-SAT is NP- construct a simple non-
Complete deterministic algorithm which
can guess an assignment of
Boolean values to S is evaluated
as 1 then S is satisfied. Thus we
can prove that 3SAT is in NP-
complete.
 • Theoretical importance:

– First NP-complete problem (Cook, 1971)

• Many practical applications:

Why SAT is – Model Checking

important – Automatic Test Pattern Generation

– Combinational Equivalence Checking

– Planning in AI

– Automated Theorem Proving

– Software Verification