i need to use sat solver for checking satisfiability of boolean expressions..
I have complex boolean expression like this
is there any automatic cnf file converter so that i can give it straight to sat solver?
I read the cnf format file.. but how to express this expression in .cnf file? i get confused when there is a conjunction inside the paranthesis and how to express --> and <-> ? please help me