Superset Generation on Decision Diagrams
- Cite this paper as:
- Toda T., Takeuchi S., Tsuda K., Minato S. (2015) Superset Generation on Decision Diagrams. In: Rahman M.S., Tomita E. (eds) WALCOM: Algorithms and Computation. WALCOM 2015. Lecture Notes in Computer Science, vol 8973. Springer, Cham
Generating all supersets from a given set family is important, because it is closely related to identifying cause-effect relationship. This paper presents an efficient method for superset generation by using the compressed data structures BDDs and ZDDs effectively. We analyze the size of a BDD that represents all supersets. As a by-product, we obtain a non-trivial upper bound for the size of a BDD that represents a monotone Boolean function in a fixed variable ordering.
Keywordssuperset binary decision diagram zero-suppressed binary decision diagram cause-effect relationship Boolean completion
Unable to display preview. Download preview PDF.