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

532 users

0 votes

Hello,

I have the following question,

S=S1=[c WU [b SU a]]
SS2=[c WU [b WU a]]

Here in this case, I am trying to satisfy that S2 is valid but it does not satisfy S1 (S2->!S1)

I have determined the first formula that is G (!a&b&!c) satisfies S2 but not S1.  But I am having problem to determine the 2nd formula. Also is it possible that both the determined  formula have G?

Thanks!

in * TF "Emb. Sys. and Rob." by (360 points)

1 Answer

+2 votes
 
Best answer

There are many ways how to express these formulas, and there is possibly also a second one that starts with a G operator. But I would not insist on that. 

For the general approach on how to solve these kinds of questions algorithmically, consider the related questions and answers. There are now quite many and some even consider very similar formulas than yours:

by (166k points)
selected by
Thanks a lot, it really helped.
Imprint | Privacy Policy
...