Presentation is loading. Please wait.

Presentation is loading. Please wait.

Disjunctive Normal Form CS 680: Formal Methods Jeremy Johnson.

Similar presentations


Presentation on theme: "Disjunctive Normal Form CS 680: Formal Methods Jeremy Johnson."— Presentation transcript:

1 Disjunctive Normal Form CS 680: Formal Methods Jeremy Johnson

2 2 Boolean Expressions  A Boolean expression is a Boolean function  Any Boolean function can be written as a Boolean expression  Disjunctive normal form (sums of products)  For each row in the truth table where the output is true, write a product such that the corresponding input is the only input combination that is true  Not unique  E.G. (multiplexor function) s x 0 x 1 f

3 Disjunctive Normal Form  Theorem. Any boolean expression can be converted to an equivalent boolean exprssion in DNF.  Proof. Any boolean expression defines a boolean function. Construct the truth table for the boolean expression and use the procedure on the previous slide to construct a boolean expression in DNF for the function defined by the truth table.

4 Alternative Proof  A recursive conversion algorithm with corresponding inductive proof of correctness.  Assume that implications and equivalences have been removed  Assume that constants have been eliminated  First convert to Negative Normal Form (NNF)  (not expr) only occurs when expr is a variable  Use DeMorgan’s Law and Double Negation Law  Then convert to DNF  Distribute and over or

5 Is-NNF (defun is-nnf (expr) (cond ( (is-constant expr) t) ( (is-variable expr) t ) ( (is-not expr) (is-variable (op1 expr)) ) ( (is-or expr) (and (is-nnf (op1 expr)) (is-nnf (op2 expr))) ) ( (is-and expr) (and (is-nnf (op1 expr)) (is-nnf (op2 expr))) ) )

6 NNF (mutual-recursion (defun nnf-not (expr) (cond ( (is-constant (op1 expr)) expr ) ( (is-variable (op1 expr)) expr ) ( (is-not (op1 expr)) (nnf (op1 (op1 expr))) ) ( (is-or (op1 expr)) (list 'and (nnf (list 'not (op1 (op1 expr)))) (nnf (list 'not (op2 (op1 expr))))) ) ( (is-and (op1 expr)) (list 'or (nnf (list 'not (op1 (op1 expr)))) (nnf (list 'not (op2 (op1 expr))))) ) )

7 NNF (defun nnf (expr) (cond ( (is-constant expr) expr ) ( (is-variable expr) expr ) ( (is-not expr) (nnf-not expr) ) ( (is-or expr) (list 'or (nnf (op1 expr)) (nnf (op2 expr))) ) ( (is-and expr) (list 'and (nnf (op1 expr)) (nnf (op2 expr))) ) )

8 Correctness  (is-nnf (nnf expr)  Structural induction on expr using De Morgan’s laws and Double Negation law  (not (and p q))  (or (not p) (not q))  (not (or p q))  (and (not p) (not q))  (not (not p))  p  Base case. Expr = var or (not var)  Assume true for expr1 and expr2 and show for (not expr), (or expr1 expr2), and (and expr1 expr2)  and and or are trivial

9 Correctness for (not expr)  (is-nnf (nnf ‘(not expr))  (nnf ‘(not expr))  (nnf-not ‘(not expr))  Case 1. (nnf-not ‘(not (not expr))) = (nnf expr)) which is correct by induction and double negation  Case 2. (nnf-not ‘(not (and expr1 expr2))) = (nnf ‘(or (not expr1) (not expr2))) = (list ‘or (nnf ‘(not expr1)) (nnf ‘(not expr2))) which is correct by induction and De Morgan  Case 3. (nnf-not ‘(not (or expr1 expr2)))

10 Is-DNF (defun is-dnf (expr) (and (is-nnf expr) (no-andor expr)) ) ; no and above or (defun no-andor (expr) (cond ( (is-constant expr) t ) ( (is-variable expr) t ) ( (is-not expr) (no-andor (op1 expr)) ) ( (is-or expr) (and (no-andor (op1 expr)) (no-andor (op2 expr))) ) ( (is-and expr) (and (no-or (op1 expr)) (no-or (op2 expr))) ) )

11 Is-DNF (defun no-or (expr) (cond ( (is-constant expr) t) ( (is-variable expr) t ) ( (is-not expr) (no-or (op1 expr)) ) ( (is-or expr) nil ) ( (is-and expr) (and (no-or (op1 expr)) (no-or (op2 expr))) ) )

12 DNF (defun dnf (expr) (nnf2dnf (nnf expr)) ) ; assume (is-nnf expr) (defun nnf2dnf (expr) (cond ( (is-constant expr) expr ) ( (is-variable expr) expr ) ( (is-not expr) expr ) ( (is-or expr) (list 'or (nnf2dnf (op1 expr)) (nnf2dnf (op2 expr))) ) ( (is-and expr) (distrib-andor (nnf2dnf (op1 expr)) (nnf2dnf (op2 expr))) ) )

13 Distribute And over Or 1.(and E (or F1 F2))  (or (and E F1) (and E F2)) 2.(and (or E1 E2) F)  (or (and E1 F) (and E2 F)) 3.(and (or E1 E2) (or (F1 F2))   (or (and E1 F1) (and E1 F2) (and E2 F1) (and E2 F2))  (or (and E1 F1) (or (and E1 F2) (or (and E2 F1) (and E2 F2))))

14 DNF ; assume (and (is-dnf expr1) (is-dnf expr2)) ; distribute and over or in (and expr1 expr2) (defun distrib-andor (expr1 expr2) (cond ( (and (not (is-or expr1)) (not (is-or expr2))) (list 'and expr1 expr2) ) ( (and (not (is-or expr1)) (is-or expr2)) (list 'or (distrib-andor expr1 (op1 expr2)) (distrib-andor expr1 (op2 expr2))) ) ( (and (is-or expr1) (not (is-or expr2))) (list 'or (distrib-andor (op1 expr1) expr2) (distrib-andor (op2 expr1) expr2)) ) ( (and (is-or expr1) (is-or expr2)) (list 'or (distrib-andor (op1 expr1) (op1 expr2)) (list 'or (distrib-andor (op1 expr1) (op2 expr2)) (list 'or (distrib-andor (op2 expr1) (op1 expr2)) (distrib-andor (op2 expr1) (op2 expr2))))) ) ) )

15 Simplified DNF ; assume (and (is-dnf expr1) (is-dnf expr2)) ; distribute and over or in (and expr1 expr2) (defun distrib-andor (expr1 expr2) (cond ( (is-or expr1) (list 'or (distrib-andor (op1 expr1) expr2) (distrib-andor (op2 expr1) expr2)) ) ( (is-or expr2) (list 'or (distrib-andor expr1 (op1 expr2)) (distrib-andor expr1 (op2 expr2))) ) ( (and (not (is-or expr1)) (not (is-or expr2))) (list 'and expr1 expr2) ) ) )

16 Exponential Blowup  Converting the following expression shows that an exponential increase in the size of the dnf form of a boolean expression is possible  (x 1  y 1 )    (x n  y n )  (x 1    x n )    (y 1    y n )

17 Exercise  Prove that (dnf expr) terminates  Hint show that the size of expr decreases in all recursive calls and that the base case must eventually be reached, where size of an expr is the number of not, and, and or operations.  Use induction to prove  (is-dnf (dnf expr))  Modify (dnf expr) to compute the conjunctive normal form (cnf expr).  Hint cnf is duel to dnf


Download ppt "Disjunctive Normal Form CS 680: Formal Methods Jeremy Johnson."

Similar presentations


Ads by Google