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


546 users

0 votes


I don't understand the explanation in the screenshot. Could you please explain it in a beginner-friendly way.

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

1 Answer

+2 votes
Best answer

I do not really see where I can help here; which of the following sentences of the solution troubles you?

  • E[a WU false] is equivalent to EGa
  • EGa does not hold in any state since all states that satisfy a, i.e., {s1, s6} have only successor states which do not satisfy a. 
  • EGa reduces to false
  • the entire formula reduces to (false → ...) which is true, and therefore holds in all states.
by (166k points)
selected by
EGa -> AXb
= false -> AXb
= true.
Hence holds in all states.

Got it.

Related questions

0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
Imprint | Privacy Policy