I have the boolean expression,
$$(a\not\to b)\lor(c\not\to d)\lor(a\not\to d)\lor(b\not\to d)$$
Can I simplify this to,
$$ (a \vee c \vee b ) \wedge (a \vee \neg d) \wedge (\neg b \vee \neg d) $$
I am trying to create the minimum CNF.
boolean-algebraconjunctive-normal-formlogic
I have the boolean expression,
$$(a\not\to b)\lor(c\not\to d)\lor(a\not\to d)\lor(b\not\to d)$$
Can I simplify this to,
$$ (a \vee c \vee b ) \wedge (a \vee \neg d) \wedge (\neg b \vee \neg d) $$
I am trying to create the minimum CNF.
Best Answer
Hint:
The statement $(a∨c∨b)∧(a∨¬d)∧(¬b∨¬d)$ not equivalent to:$$(a∨c∨b)∧(c∨a)∧(a∨¬d)∧(¬b∨¬d)$$For the minimum CNF, you can draw a k-map, but use Logical equivalence is actually easier in this case, the idea is use Absorption law on $(a \lor c)\land(a\lor c\lor b)$.
Answer:
Update:
Hint:
Use Logical equivalence to find minimum CNF for $(a\not\to b)\lor(c\not\to d)\lor(a\not\to d)\lor(b\not\to d)$, first use conditional equivalence to express the statement with only $\{\lor,\land,\neg\}$, then just try to apply Distributive law, see what would you get.
Answer: