503 search results - page 67 / 101 » Interpolative Boolean Logic |
74
Voted
ICCAD
2007
IEEE
15 years 9 months ago
2007
IEEE
—We present an implementation of an algorithm for constructing provably fast circuits for a class of Boolean functions with input signals that have individual starting times. We ...
104
Voted
ETFA
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper presents a new approach to modelling and verification of function block applications of the IEC 61499 standard. The approach uses the language of logic programming Prol...
94
Voted
ISMIS
2005
Springer
15 years 6 months ago
2005
Springer
A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operate...
123
click to vote
ASM
2010
ASM
15 years 3 months ago
2010
ASM
Abstract. Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments therefore depends direct...
INTEGRATION
2008
15 years 23 days 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...