Sciweavers

141 search results - page 6 / 29
» Boolean Function Representation Using Parallel-Access Diagra...
Sort
View
MST
2006
120views more  MST 2006»
13 years 6 months ago
Exploiting Regularities for Boolean Function Synthesis
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure...
Anna Bernasconi, Valentina Ciriani, Fabrizio Lucci...
ISMVL
1997
IEEE
134views Hardware» more  ISMVL 1997»
13 years 11 months ago
Functional Decomposition of MVL Functions Using Multi-Valued Decision Diagrams
In this paper, the minimization of incompletely specified multi-valued functions using functional decomposition is discussed. From the aspect of machine learning, learning sample...
Craig M. Files, Rolf Drechsler, Marek A. Perkowski
DATE
2003
IEEE
85views Hardware» more  DATE 2003»
14 years 5 hour ago
Set Manipulation with Boolean Functional Vectors for Symbolic Reachability Analysis
Symbolic techniques usually use characteristic functions for representing sets of states. Boolean functional vectors provide an alternate set representation which is suitable for ...
Amit Goel, Randal E. Bryant
ATVA
2010
Springer
154views Hardware» more  ATVA 2010»
13 years 7 months ago
Lattice-Valued Binary Decision Diagrams
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...
Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall,...
EJC
2010
13 years 6 months ago
Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
Each clone C on a fixed base set A determines a quasiorder on the set of all operations on A by the following rule: f is a C-minor of g if f can be obtained by substituting operati...
Erkko Lehtonen, Jaroslav Nesetril