Working with propositional formulae in Python

nnp version5 at
Tue Feb 10 20:46:54 CET 2009


I'm currently working with propositional boolean formulae of the type
'A & (b -> c)' (for example). I was wondering if anybody knows of a
Python library to create parse trees and convert such formulae to
conjunctive, disjunctive and Tseitin normal forms?



More information about the Python-list mailing list