Machine-translated by Google. Questions are authored in English.
Top

Discussion

What is the Tseitin transformation?

  • A.A method of eliminating quantifiers from first order formulas
  • B.A technique for simplifying a formula before proving it
  • C.A procedure for checking whether two formulas are equivalent
  • D.A linear conversion to clausal form using auxiliary variables

Answer: D

Naming each subformula with a new variable and asserting the equivalence gives a clause set linear in the original size, equisatisfiable though not equivalent. Every practical satisfiability tool uses it. Quantifier elimination, simplification and equivalence checking are different procedures. A transformation whose output is larger in variables but linear in clauses, and which preserves exactly the property being tested, is a good illustration of choosing the right notion of correctness.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.