A BDD-Based Simplification and Skolemization Procedure

We introduce a new technique to simplify and skolemize rst-order formulas, based on binary decision diagrams, or BDDs. This technique is more computation-intensive than previously known ones, but in general provides better skolemized forms that attempt to reduce the number of false dependencies. This technique can also be seen as a practical way of simplifying rst-order formulas before feeding them to an automated theorem prover.