Hello sympy users, I am intrigued by the capabilities of sympy, and I was wondering if anyone in the CAS community has implemented (or has interest in) the subject of symbolic boolean algebra? I realize this may seem a bit mundane compared to theoretical physics, but I believe this would be a very compelling feature.
Many simple boolean transforms are analogous to multiplication and addition. Indeed, I believe I read somewhere that boolean algebra is equivalent to a modulo-2 ring, though I admit I have not studied abstract algebra for a while. Here are some possible features of such a package: 1. Canonical representation, both SOP (sum-of-products) and POS (product-of-sums, though occasionally mistaken for another acronym.) 2. Evaluation of an expression, substituting one or more variable values (with True, False) 3. Logic minimization, using Quine-McCluskey, ESPRESSO, etc. 4. Satisfiability (what inputs will produce a certain output) 5. Equivalence: is this equation equivalent to that one? These were the most obvious features off the top of my head. I would love to read thoughts from the community. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sympy?hl=en -~----------~----~----~----~------~----~------~--~---
