On the Relative Efficiency of DPLL and OBDDs with Axiom and Join

@inproceedings{Jrvisalo2011OnTR,
  title={On the Relative Efficiency of DPLL and OBDDs with Axiom and Join},
  author={Matti J{\"a}rvisalo},
  booktitle={CP},
  year={2011}
}
This paper studies the relative efficiency of ordered binary decision diagrams (OBDDs) and the Davis-Putnam-Logemann-Loveland proced ure (DPLL), two of the main approaches to solving Boolean satisfiability instances. Espec ially, we show that OBDDs, even when constructed using only the rather weak a xiom and join rules, can be exponentially more efficient… CONTINUE READING