> Dear Chris and William:
>
> Chris has writen a new version of the symbolic logic code for Sage
> (seee #545), implementing all my previous suggestions.
>
> I didn't have much time to review this patch, but it seems that AlexGhitza has
> been working on this. I think that it is important than thi
Hi!
You might want to look for the zeroesIn method to the
new section "Reinterpretation of Boolean sets as subsets of the vector
space"
in the PolyBoRi tutorial.
http://polybori.sourceforge.net/doc/tutorial/index.html
Best regards,
Michael
On 7 Mrz., 10:14, Chris Gorecki <[EMAIL PROTECTED]> wrote
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 op
Hi!
You could wrap that functionality around PolyBoRi
Using the mapping:
False -> 1
True->0
or -> *
not x -> 1+x
You can map logical expressions to Boolean polynomials.
Having such a polynomial f, you calculates its zeroes, which gives the
DNF.
Example:
In [1]:f=(x(1)+x(2))
In [2]:(x(1)*x(2)).
