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

1.1k questions

1.2k answers

1.6k comments

529 users

0 votes

Hello

Please may explain in below exam problem 4.a:

1. in the red highlighted, why does it convert part !b to b? 

2. in the green highlighted, since s5 has s0,s1,s4,s6 as existential predecessors why we select s4?

https://es.cs.uni-kl.de/teaching/vrs/exams/2020.08.25.vrs/2020.08.25.vrs.solutions.pdf

Thanks.

in * TF "Intelligent Systems" by (770 points)

1 Answer

0 votes
Local model checking is a top-down procedure which means that the question whether s5 satisfies !b, i.e., the sequent s5 |- !b is reduced to the question whether s5 satisfies b, i.e., s5 |- b. Once propositional variables are found on the right hand side, we can check the truth value by considering the label of state s5. In this case, s5 is labeled with b, so b holds in s5, and therefore, we have s5 |- b. For this reason, we do not have s5 |- !b and neither do we have s5 |- a&!b, so this result propagates upwards the tree.

About the selection of s4 for the subgoal: That was a matter of luck, the tool stops when the first subgoal of a disjunctive split is satisfied.
by (166k points)
Imprint | Privacy Policy
...