Hi All, I've recently written some sage code for manipulating and simplifying propositional calculus statements. The code can be downloaded at http://sage.math.washington.edu/home/goreckc/sage/logic/logic.tgz if anyone is interested in checking it out. Also, I was wondering if anyone knew of a good open source package for converting logical statements to conjunctive or disjunctive normal form (preferably in C[++] or python)? My implementation is effective, but I'm guessing their are heuristic methods available that can be faster. Thanks.
-Chris Gorecki [EMAIL PROTECTED] --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
