of a good open source package for
converting logical statements to conjunctive or disjunctive normal
form (preferably in C[++] or python)? My implementation is effective,
but I'm guessing their are heuristic methods available that can be
faster.
Thanks.
-Chris Gorecki
[EMAIL
Wow, I had no idea that was even a possibility:)
Thanks for pointing that out to me.
-Chris Gorecki
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more
ested that would be great.
-Chris Gorecki
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-
a('(x&y) | z')
sage: a.equivlant(b)
True
One way to do this would be to examine the truth tables of each for
every possible mapping of the variable, but the run time would be
exponential plus some. Does anyone know of a better way to implement
> Btw. shouldn't that be
>>sage: a == b
>not for *formulas*, since say also involve the syntax.
Currently '==' compares parse trees. Is this the desired behavior?
-Chris Gorecki
--~--~-~--~~~---~--~~
To post to this group, send email to
