Many. Boolean functions are efficiently represented as. Ordered. Binary. Decision. Diagrams. (OBDDS). How- ever, the order in which variables.

Several ordering heuristics for shared, reduced and ordered binary decision diagrams (ROBDDs) are described to provide a fast way to generate shared ROBDDs ...

M. Ray Mercer, Rohit Kapur, Don E. Ross: Functional Approaches to Generating Orderings for Efficient Symbolic Representations. DAC 1992: 624-627.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev. Hosted as a part of SLEBOK on ...

This work presents an efficient symbolic design verification method for very large circuits which exploits the properties of OPDDs (ordered partial decision ...

We present a symbolic representation approach using ordered function templates to exploit such regularity. Templates specify functionality without being bound ...

First, unlike deep learning approaches, the representations are not learned from images associated with states but from the structure of the state space. Second ...

In this paper we discuss efficient symbolic representations for infinite-state systems specified using linear arithmetic constraints. We give algorithms for ...

In this paper we undertake a systematic study of this spectrum of representation approaches: purely symbolic representation (with or without top ordering), ...

Symbolic regression (SR) poses a significant challenge for randomized search heuristics due to its reliance on the synthesis of expressions for input-output ...