Question: Given a boolean formula : The above formula can be stated : 1. Satisfiable : If the variable can be assigned a value (T/F) in

Given a boolean formula :

Given a boolean formula : The above formula can be stated :

The above formula can be stated :

1. Satisfiable : If the variable can be assigned a value (T/F) in such a way that the result of the formula TRUE

2. Unsatisfiable : If the variable is assigned a value (T/F) the result of the formula is FALSE

a. Change the formula to a directed graph and determine whether it is satisfiable or unsatisfiable using strongly connected component (SCC) search! (If there is a variable and its complement, for example: a and a', in one SCC it can be concluded that the formula is unsatisfiable)

b. Create a pseudocode to solve the problem above and analyze the time complexity based on your pseudocode

F = (a vb) A (a' v b') ^ (c V b') A (a' vb)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!