We prove that binary decision diagrams [R. Bryant, Symbolic Boolean manipulation with ordered binary decision diagrams, ACM Comput. Surveys 23 (3) (1992)] can be polynomially simulated by the extended resolution rule of [G.S. Tseitin, On the complexity of derivation in propositional calculus, in: A. Slisenko (Ed.), Studies in Constructive Mathematics and Mathematical Logics, 1968]. More precisely, for any unsatisfiable formula phi, there exists an extended resolution refutation of phi where the number of steps is polynormially bounded by the maximal size of the BDDs built from the formulae occurring in phi. (C) 2007 Elsevier B.V. All rights reserved.
展开▼
