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

In the solution for the VRS exam 08/2018 in task 1 b)

it seems like a rule for <-> was used to split !d<->a&c, but we had no such rule in the slides. Would it be allowed in the exam to write it down like this? So are we allowed to use such "intuitive" rules?

Or do we have to write down all intermediate steps, so for example first rewriting a<->b = (a->b)&(b->a), second rewriting (a->b)&(b->a) = (!a | b) & (!b | a) and then using and/or/negation rules, since we just had these rules in the slides? Would cost more time that's why I am asking..

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

1 Answer

+1 vote
Best answer
You can directly use a rule for eliminating xor or equivalence that you worked out aside. That will be fine! (Just make sure that it is correct). There are also at least two versions.

There was already a related question; please refer to that ones answer:
by (166k points)
selected by
Imprint | Privacy Policy