Memristors have become interesting to many research areas within the last years. This paper discusses memristors in the context of digital logic synthesis. Giving a brief overview about memristor characteristics it is explained how they can be used in digital logic. It will be explained how memristors map to digital logic operations and how this can be used with common synthesis methods to turn...

This paper presents a discrete device for neural network realized on field-programmable gate arrays (FPGA). A basic element of the implemented neural network is new type of neuron, called Boolean neuron that may be mapped directly to configurable logic blocks (CLB) or to look up table (LUT) of FPGAs. The structure and logic of the Boolean neuron allows a direct representation of the Boolean neu...

Traditional formal methods are based on a Boolean satisfaction notion: a reactive system satisfies, or not, a given specification. We generalize formal methods to also address the quality of systems. As an adequate specification formalism we introduce the linear temporal logic LTL[F ]. The satisfaction value of an LTL[F ] formula is a number between 0 and 1, describing the quality of the satisf...

The algebra of logic developed by Boole was not Boolean algebra. In this article we give a natural framework that allows one to easily reconstruct his algebra and see the difficulties it created for his successors. It is well known that modern Boolean algebra is connected with the work of George Boole [1815–1864], namely with his two books on a mathematical treatment of logic: • The Mathematica...

Boolean networks are a simple but efficient model for describing gene regulatory systems. A number of algorithms have been proposed to infer Boolean networks. However, these methods do not take full consideration of the effects of noise and model uncertainty. In this paper, we propose a full Bayesian approach to infer Boolean genetic networks. Markov chain Monte Carlo algorithms are used to obt...

In this paper, we present a new type of neuron, called Boolean neuron that may be mapped directly to configurable logic blocks (CLBs) of field-programmable gate arrays (FPGAs). The structure and logic of Boolean neuron allow a direct representation of the Boolean neural network architecture to FPGAs. Our approach solves digital design problems especially with respect of the performance and gate...

The Teleo-Reactive (T-R) paradigm for computing and organizing actions for autonomous agents in dynamic environments can be viewed as having a foundation triplet of durative actions, circuit semantics, and boolean logic. This foundation is intended to enable the construction of semantic circuitry for the continuous computation of parameters and conditions on which agent action is based. Drawing...

Implementing a quantum computer at the circuit level has emerged as an important field of research recently. An important topic of building a general-purpose quantum computer is to implement classical Boolean logic using quantum gates and devices. Since the Toffoli gate is universal in classical Boolean logic, any classical combinational circuit can be implemented by the straightforward replace...

AND-INV graphs (AIGs) are Boolean networks composed of twoinput AND-gates and inverters. In the known applications, such as equivalence checking and technology mapping, AIGs are used to represent and manipulate Boolean functions. AIGs powered by simulation and Boolean satisfiability lead to functionally reduced AIGs (FRAIGs), which are “semi-canonical” in the sense that each FRAIG node has uniq...