On the Relative Efficiency of DPLL and OBDDs with Axiom and Join
This paper studies the relative efficiency of ordered binary decision diagrams (OBDDs) and the Davis-Putnam-Logemann-Loveland procedure (DPLL), two of the main approaches to solving Boolean satisfiability instances. Especially, we show that OBDDs, even when constructed using only the rather weak axiom and join rules, can be exponentially more efficient than DPLL or, equivalently, tree-like resolution. Additionally, by strengthening via simple arguments a recent result—stating that such OBDDs do not polynomially simulate unrestricted resolution—we also show that the opposite holds: there are cases in which DPLL is exponentially more efficient out of the two considered systems. Hence DPLL and OBDDs constructed using only the axiom and join rules are polynomially incomparable. This further highlights differences between search-based and compilation-based approaches to Boolean satisfiability.
Unable to display preview. Download preview PDF.
- 4.Segerlind, N.: On the relative efficiency of resolution-like proofs and ordered binary decision diagram proofs. In: Proc. CCC, pp. 100–111. IEEE Computer Society, Los Alamitos (2008)Google Scholar
- 11.Tseitin, G.S.: On the complexity of derivation in propositional calculus. In: Slisenko, A.O. (ed.) Studies in Constructive Mathematics and Mathematical Logic, Part II. Seminars in Mathematics, V.A.Steklov Mathematical Institute, Leningrad, vol. 8, pp. 115–125. Consultants Bureau (1969) (originally in Russian)Google Scholar