All Questions
3
questions with no upvoted or accepted answers
2
votes
0
answers
254
views
How can I find the CNF of ($A$ and $B$ or $C$) and ($B$ or not $C$) using a Karnaugh map?
$$(A\land B \lor C) \land (B \lor \lnot C)$$
I know how to create the truth table and Karnaugh map of a logic expression. But I couldn't find exactly how to calculate the simplified CNF of it using ...
1
vote
0
answers
1k
views
A reduction of 3-CNF down to 2-CNF for boolean satisfiability
Could you please review the following candidate solution for the boolean satisfiability problem?
It is known that 2-CNF has a polynomial solution.
Now consider we have a 3-CNF (AFAIK, it's proven ...
- 153
0
votes
0
answers
93
views
How to turn this formula into CNF?
This formula
$$(p \land q) \lor ( \neg q \lor r) \land ( \neg p \lor r)$$
has the CNF
$$(\neg p \lor q \lor r) \land ( p \lor \neg q \lor r)$$
I understand how CNF works, but I can't seem to ...
- 101