my problem is ,Please give the algorithm: how can rewrite an arbitrary propositional formula alfa(α) into a proposional formula beta(β) so that beta does not contain disjunction(∧) and alfa ...
(I have post a question with bounty for several days (Find a best 4-tuple which fulfils a variable boolean formula), but unfortunately got no answer yet. Here I simplify it to a smaller problem and ...
I am looking for an algorithm... I have a kind of boolean formulae which contain $\wedge$, $\vee$, $+$ as arithmetic operator, relational operators ($<, >, \ldots)$, 4 integer constants $c_0, ...