2:50 PM - 3:10 PM
[2I4-OS-9a-04] On construction of decision diagrams representing Boolean functions given as monadic second-order logic formulas
Keywords:Decision diagram, Data structure, Monadic second-order logic
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.
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.
Authentication for paper PDF access
A password is required to view paper PDFs. If you are a registered participant, please log on the site from Participant Log In.
You could view the PDF with entering the PDF viewing password bellow.