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

912 questions

1k answers

1.4k comments

441 users

0 votes
Can some one please help me with below problem :

Compute the existential predecessors of the state set specified by the propositional logic formula p ∧ ¬q symbolically. Perform the computation on the corresponding Kripke structure. Convert your result to a quantifier-free formula in DNF (recall: ϕR = a ∧ ((p ∧ q) ↔ ¬p 0 ) ∧ (q 0 ↔ (¬p ∧ ¬q))).
in * TF "Emb. Sys. and Rob." by (550 points)

1 Answer

0 votes

I don't see where exactly your problem is. I can tell you the general prodecure:

  • There is a formula for existential predecessors in the lecture notes. Slide 58-59, followed by examples
  • Plug the set and the relation to the formula
  • Do the renaming (here it's changing the formula specifying the set from p ∧ ¬q to p' ∧ ¬q')
  • Unfold the quantification. Let the exists operator become a disjunction of copies of the inner formula where all possible truth values for the quantified variables are plugged in
  • Simplify the formula
The questions looks like an exam question. Maybe you can look at the standard solution to learn from that after trying it on your own.
by (25.6k points)

Related questions

0 votes
1 answer
+1 vote
1 answer
asked May 29, 2020 in * TF "Emb. Sys. and Rob." by sschwarz (1.7k points)
0 votes
1 answer
asked Aug 18, 2020 in * TF "Emb. Sys. and Rob." by maherin (370 points)
Imprint | Privacy Policy
...