Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

769 questions

886 answers


424 users

0 votes

Let a⪯b⪯c⪯da⪯b⪯c⪯d be the variable ordering.
ϕ= a&!b&!c&!d|b&!a&!c&!d|c&d|c&!d|d&!a&!c
X={c,d} is the set of quantified variables. Compute the ROBDD of the existential quantification formula ∃X..¬ϕ using the Exists algorithm, and convert the result to Shannon normal form.

How to calculate ¬ϕ?

Is it using the truth table? do we take the DNF?

in # Study-Organisation (Bachelor) by (290 points)

1 Answer

0 votes
Best way to solve this is to first compute the BDD for the given formula Phi. The BDD of its negation is obtained from that BDD by switching the leaf nodes.
by (117k points)
Imprint | Privacy Policy