sage: B. = 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]
sag
sage: import sage.logic.propcalc as propcalc
sage: f = propcalc.formula("a^(b&c)")
sage: f.convert_cnf()
sage: f
(a|b|c)&(a|b|~c)&(a|~b|c)&(~a|~b|~c)
Le samedi 20 avril 2013 20:39:47 UTC+2, Santanu a écrit :
>
> Dear all,
> I want to convert the polynomial f into Conjunctive Normal Form (CNF)
Dear all,
I want to convert the polynomial f into Conjunctive Normal Form (CNF)
in Sage. How can I do this?
B. = BooleanPolynomialRing()
f=a+b*c
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receivin
On 04/18/2013 03:13 AM, Gary McConnell wrote:
I am very keen to help - my problem is utter incompetence at following
the high-level instructions in the manual for developers. Also I am on
the VM and I cannot access the sage directories directly. Is there a way
you could send me a manual file that
thnx,
this looks nice. I'll have a deeper look at it in the next days.
bg,
Johannes
On 19.04.2013 17:53, Simon King wrote:
> Hi Johannes,
>
> On 2013-04-18, Johannes wrote:
>> Hi guys,
>>
>> I have the following setting: Given a finite subgroup G of GL_\C(n) of
>> order k, acting on C[x_1,...,x