I would use a separate function (solve_boolean() or something like that). The problem with using solve is that there's no way to tell if a Symbol is supposed to be a boolean Symbol, other than that it lives in a boolean expression (see http://code.google.com/p/sympy/issues/detail?id=1887#c26). So something like solve(x) would be ambiguous.
Also, solve() currently accepts boolean expressions as assumptions, so there may be some ambiguity there. Actually, if all you're doing is simplifying them, wouldn't simplify() be better than solve()? Can you give an explicit example of what you are suggesting? Aaron Meurer On Sat, Sep 29, 2012 at 10:38 PM, Sachin Joglekar <[email protected]> wrote: > Something that I suggested as a comment on my CustomFunction pull request- > Can 'solve' function be extended to be able to solve boolean functions to > convert them to the simplest form? initially thought of adding a separate > function for this, but then thought that extending 'solve' would be a better > idea. > > As I am able to generate the simplest form of a function (SOP) from its > truth table, I could go one step further by finding out the truth table of a > function and using it to find its simplest form. If there are any better > ways to do it, I could look it up too. > > -- > You received this message because you are subscribed to the Google Groups > "sympy" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/sympy/-/132XAqK9qcoJ. > 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. -- 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.
