On construction of decision diagrams representing Boolean functions given as monadic second-order logic formulas

Abstract

In this paper, we propose a method to represent logical functions given by Monadic Second-Order (MSO) logic formulas as Binary Decision Diagrams (BDDs). BDDs are data structures that represent logic functions in a compressed form. They can perform various operations on them in a compressed representation. We propose a method for constructing BDDs from MSO logic formulas. Through computer experiments, we construct BDDs from MSO logic formulas for several graph problems and confirm the performance of the method.