In computer science 2satisfiability is a computational probl

In computer science, 2-satisfiability is a computational problem of assigning values to variables

PLEASE SHOW STEPS AND COMPLETE PROBLEM FULLY THANKS

Show the steps in solving the following 2SAT instance, by reducing it an SCC decomposition

Solution

2-SAT or 2SAT tries to prove that some problems has Polynomial time algorithm.

Here we are supposed to set a value(one value or two values) for litterals so that whole caluse is TRUE by that all the clauses are become true.

>>> to Make first clause true I am setting x1 to TRUE.

>>> to Make second clause true I am setting x3 to TRUE.

>>> to Make third clause true I am setting x2 to FALSE

>>> to Make fourth clause true I am setting x4 to FALSE

so all the assignments above makes individual clauses true and final whole expression also TRUE.