Advancements in Mixed BDD and SAT Techniques

摘要: This chapter covers mutual interactions between Boolean Satisfiability (SAT) solvers and Binary Decision Diagrams (BDDs). More precisely, the presentation is focused on approaches mixing methodologies, techniques, ideas coming from both research domains. First of all, it gives some preliminary definitions presents main differences affinities SAT BDD manipulation algorithms. After that, overviews most notable efforts to integrate two technologies either in a loose or tight way. It eventually provides evaluations hints for open problems possible future work.