#15680: Using SAT solver module from Symbolic Logic module
---------------------------+----------------------------
Reporter: equaeghe | Owner:
Type: enhancement | Status: new
Priority: minor | Milestone: sage-6.1
Component: misc | Keywords:
Merged in: | Authors:
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
---------------------------+----------------------------
It seems (but I am not entirely sure) that currently the Symbolic Logic
module does not (optionally) use the SAT solver module for the
`is_satisfiable()` method. As this can make this method more efficient, it
can be a useful addition. (And allow returning a satisfying instance of
the variables.)
(N.B.: Both modules seem to have a method outputting DIMACS format.)
Links:
* related ticket (concerns efficient CNF encoding):
http://trac.sagemath.org/ticket/15676
* symbolic logic docs:
http://www.sagemath.org/doc/reference/logic/sage/logic/boolformula.html
* SAT solver docs: http://www.sagemath.org/doc/reference/sat
--
Ticket URL: <http://trac.sagemath.org/ticket/15680>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" 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/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.
