Efficient Caching Mechanism in BDD Compilation

Abstract

We improve an existing OBDD-based method of computing all total satisfying assignments of a Boolean formula. To do this, we introduce a technique to reduce frequent cache operations in a systematic way. Furthermore, we introduce an alternative cutset caching that uses information provided by unit propagation. We implement our methods on top of a modern SAT solver, and evaluate their efficiency in experiments.