×
Abstract: Addresses the problem of the detection of symmetries of Boolean functions. To know these symmetries may be important in several stages of logic ...
In this paper an improved method to detect the symmetries of a Boolean function is presented. Before using the naive symmetry check, we try to detect as many ...
The approach presented in this paper uses preprocessing methods to find as many asymmetric pairs of variables as possible to avoid cofactor computations at the ...
Detection of symmetry of Boolean functions represented by ROBDDs · Contents. ICCAD '93: Proceedings of the 1993 IEEE/ACM international conference on Computer- ...
This paper presents an efficient anytime algorithm for detecting symmetries in Boolean functions represented as ROBDDs, that output pairs of symmetric ...
Binary Decision Diagrams (BDDs) are an efficient tree-based data structure for the representation of Boolean functions. A BDD for a Boolean functions f is a ...
Weber, “Detection of Symmetry of. Boolean functions Represented by ROBDDs,” in International Confer- ence on Computer-Aided Design, 1993, pp. 680–684. [13] ...
People also ask
symmetry detection for Boolean functions represented as ROBDDs. The al- gorithm builds upon the techniques used in the anytime algorithm presented in ...
AIGs compactly represent logic functions and can be easily transformed into multi-input gate graphs to detect symmetries structurally, as was shown in [37].
The use of ROBDDs to represent Boolean functions enables not only the efficient computation of co-factors, but also equivalence to be checked in constant time.