nnp wrote:
Hey,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?
You would probably do better with Google. "Python conjunctive normal form" gave some potentially interesting hits. -- http://mail.python.org/mailman/listinfo/python-list
