Comment #8 on issue 1545 by christian.muise: Efficient data representation
in logic.satisfiable()
http://code.google.com/p/sympy/issues/detail?id=1545
Well I have just one further question: will the sympy version of DPLL ever
go so far
as to have clause learning ( http://en.wikipedia.org/wiki/Clause_learning
)? If
/not/, we can apply pretty much the same procedure to an arbitrary
propositional
formula rather than converting to CNF first.
Either way I'll spawn off the appropriate issues for discussion, but the
question
is a fundamental decision on the future of the logic module -- especially
when
considering the efficiency of the propositional reasoning.
--
You received this message because you are listed in the owner
or CC fields of this issue, or because you starred this issue.
You may adjust your issue notification preferences at:
http://code.google.com/hosting/settings
--
You received this message because you are subscribed to the Google Groups
"sympy-issues" group.
To post to this group, send email to sympy-iss...@googlegroups.com.
To unsubscribe from this group, send email to
sympy-issues+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/sympy-issues?hl=en.
