sage: B.<a,b,c> = BooleanPolynomialRing()
sage: f=a+b*c
sage: from sage.sat.converters.polybori import CNFEncoder
sage: from sage.sat.solvers.dimacs import DIMACS
sage: solver = DIMACS()
sage: ce = CNFEncoder(solver, B)
sage: ce([f])
[None, a, b, c]
sage: solver.clauses()
[((-2, -3, 1), False, None), ((3, -1), False, None), ((2, -1), False, None)]
Cheers,
Martin
--
name: Martin Albrecht
_pgp:
http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www:
http://martinralbrecht.wordpress.com/
_jab:
martinr...@jabber.ccc.de