Hi Sven,

Unhapply I cannot found any solution, in fact, I solved the trouble without
the CNF reduction.

But, if you find some way to manipulate logical propositions in PERL it will
be nice to have this capacibility in PERL.

I was looking for Prolog, and some way to glue it with PERL, but I am
currently studing it without  an answer to you.

PS: If you find some way, please tell me !

[]s
Slepetys

----- Original Message ----- 
From: "Sven Hilbert" <fuzzySH@[...].de> 
To: "Roberto Slepetys Ferreira" <slepetys@[...].br> ;
<perl-ai@[...].org> 
Sent: Monday, April 19, 2004 6:44 PM
Subject: Re: reduction to 3-CNF


>  Hi Roberto,
> 
>  I have the same problem right now.
>  Did you find a solution?
> 
>  (I'd prefere Perl-only-scripts...)
> 
>  >
>  > I am looking for some way to do the same of LogicalExpand function of
>  > Wolfran Mathematica. It get's a logical expression in input and returns
a
>  > CNF of the logical expression.
>  >
>  > Ex:
>  > IN: LogicalExpand [  a && b && ! ( c || ( d && ! e))]
>  > OUT: a && b && e && (! c || a) && b && ! c && ! d
>  >
> 
>  regards
>  Sven
> 
> 
>