Working with propositional formulae in Python

Discussion in 'Python' started by nnp, Feb 10, 2009.

  1. nnp

    nnp Guest

    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?

    Cheers,
    nnp

    --
    http://www.unprotectedhex.com
    http://www.smashthestack.org
     
    nnp, Feb 10, 2009
    #1
    1. Advertising

Want to reply to this thread or ask your own question?

It takes just 2 minutes to sign up (and it's free!). Just click the sign up button to choose a username and then you can ask your own questions on the forum.
Similar Threads
  1. Ratman
    Replies:
    0
    Views:
    668
    Ratman
    Sep 14, 2004
  2. Martin Heuckeroth
    Replies:
    5
    Views:
    687
    JiangZemin
    Apr 1, 2005
  3. Mars
    Replies:
    10
    Views:
    500
  4. Mister B
    Replies:
    8
    Views:
    443
  5. Geeta Sachdeva
    Replies:
    4
    Views:
    136
    bbiker
    Oct 16, 2007
Loading...

Share This Page