Hi Nicolas! You might want to review #418 then ;-)
http://trac.sagemath.org/sage_trac/ticket/418 On Friday, June 15, 2012 10:25:57 PM UTC+1, Nicolas M. Thiéry wrote: > > Dear all, > > I discussed yesterday with Shalom Eliahou and some other persons that > could be interested in using Sage to have a natural syntax for > constructing complicated propositional logic formulas (boolean > formulas), in order to model and treat some of their hard NP problems > using SAT solvers. They currently write directly files in sat format > which is not necessarily so convenient. > > Looking around sage.logic, it feels like this old module could use > some love. Like being more consistent with SymbolicRing? in the syntax > for constructing formulas, using Parents/Elements?, having interfaces > with the common open source SAT solvers, ... > > I posted some story suggestions on: > > http://trac.sagemath.org/sage_trac/ticket/13120 > > Cheers, > Nicolas > -- > Nicolas M. Thi�ry "Isil" <nthi...@users.sf.net> > http://Nicolas.Thiery.name/ > -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
