461 search results - page 14 / 93 » An Algorithm for Bi-Decomposition of Logic Functions |
ENTCS
2007
14 years 9 months ago
2007
Logical connectives familiar from the study of hybrid logic can be added to the logical framework LF, a constructive type theory of dependent functions. This extension turns out t...
EMSOFT
2011
Springer
13 years 9 months ago
2011
Springer
Given a multi-modal dynamical system, optimal switching logic synthesis involves generating conditions for switching between the system modes such that the resulting hybrid system...
DAC
2005
ACM
15 years 10 months ago
2005
ACM
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
CDES
2008
14 years 11 months ago
2008
In this paper an algorithm is proposed for the synthesis and exact minimization of ESCT (Exclusive or Sum of Complex Terms) expressions for Boolean functions of up to seven comple...
INTEGRATION
2008
14 years 9 months ago
2008
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...