Binary decision diagrams by shared rewriting

Authors:
J. C. Pol;Hans Zantema
Affiliations:
-;-
Venue:
Binary decision diagrams by shared rewriting
Year:
2000

Citing 0
Cited 1

Binary Decision Diagrams by Shard Rewriting

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

BDDs provide an established technique for propositional formula manipulation. In this paper we re-develop the basic BDD theory using standard rewriting techniques. Since a BDD is a DAG instead of a tree we need a notion of shared rewriting and develop appropriate theory. A rewriting system is presented by which canonical ROBDDs can be obtained. For this rewriting system a {\em layerwise} strategy is proposed having the same time complexity as the traditional algorithm, and a {\em lazy} strategy sometimes performing much better than the traditional algorithm.