Comment #7 on issue 4075 by [email protected]: More efficient to_cnf
http://code.google.com/p/sympy/issues/detail?id=4075
Is it a bad idea for satisfiable() to always recurse across an Or (even
ones that are easy to flatten)? It seems to me like the analogue of solve()
always recursing across a Mul. One disadvantage I can think of is that you
will no longer be guaranteed to get a full model, as DPLL2 seems to do.
Could it ever be far less efficient than converting to CNF first and
running the normal solver, as it currently does?
--
You received this message because this project is configured to send all
issue notifications to this address.
You may adjust your notification preferences at:
https://code.google.com/hosting/settings
--
You received this message because you are subscribed to the Google Groups
"sympy-issues" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sympy-issues.
For more options, visit https://groups.google.com/groups/opt_out.
