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

915 questions

1k answers

1.4k comments

441 users

0 votes

Question 1 (d) part - https://es.cs.uni-kl.de/teaching/vrs/exams/2019.02.13.vrs/2019.02.13.vrs.solutions.pdf

Out of original ROBDD, why are we considering only subtree with c and d?

Do we always take the True path of variables that we want to quantify (here a and b)? If both the paths have different path for True value, then how do we solve?

Can someone please explain logic behind this step?

Thank you.

in * TF "Vis. and Sci. Comp." by (870 points)

1 Answer

0 votes
We don't just consider that subtree. Read the example solution carefully; it just makes an abbreviation of a subtree first which is used later, and then starts the computation with Exists(e3,b_phi) where e3 is node b, and then it finally explains how to compute Exists(e2,a_phi) where e2 is the given BDD.
by (142k points)
Oh....yes. I am sorry. Thank you.
Imprint | Privacy Policy
...