A method of using non-volatile and fast ferroelectric field-effect transistor (FeFET) devices to realize Boolean logic is proposed. First, the internal states are initialized. Then, gate body function as input terminals, which used write device, based on voltage. Finally, output signals can be easily read through drain current. Of 10 Institute Electrical Electronics Engineers (IEEE) standard ga...

Dependency Quantified Boolean Formulas (DQBF) comprise the set of propositional formulas which can be formulated by adding Henkin quantifiers to Boolean logic. We are not aware of any published attempt in solving this class of formulas in practice. However with DQBF being NEXPTIME-complete, efficient ways of solving it would have many practical applications. In this paper we describe a DPLL-sty...

Multiple-valued logics [2] provide an interesting alternative to classical boolean logic for modeling and reasoning about systems. By allowing additional truth values, they support the explicit modeling of uncertainty and disagreement. In order to do temporal reasoning over multiple-valued systems, we must extend a classical temporal logic to the multiple-valued case. For instance, the branchin...

Boolean networks (and more general logic models) are useful frameworks to study signal transduction across multiple pathways. Logic models can be learned from a prior knowledge network structure and multiplex phosphoproteomics data. However, most efficient and scalable training methods focus on the comparison of two time-points and assume that the system has reached an early steady state. In th...

During the past decade, there has been an extensive investigation of the computational complexity of the consistent answers of Boolean conjunctive queries under primary key constraints. Much of this investigation has focused on self-join-free Boolean conjunctive queries. In this paper, we study the consistent answers of Boolean conjunctive queries involving a single binary relation, i.e., we co...

Interestingly, boolean reasoning the logic of boolean equations that you really wait for now is coming. It's significant to wait for the representative and beneficial books to read. Every book that is provided in better way and utterance will be expected by many peoples. Even you are a good reader or not, feeling to read this book will always appear when you find it. But, when you feel hard to ...

I. Classical Logic Gates A. Irreversible Logic (1940-) ---------------------------------------------------p. 2 1. Two-bit NAND gates simulate all Boolean functions 2. Efficiency and the need for minimization techniques. B. Reversible Logic (1970s) ----------------------------------------------------p. 4 1. Minimizing energy-dissipation in a computation 2. Three-bit Toffoli gates simulate all re...

It is well-known that all Boolean functions of n variables can be computed by a logic circuit with o(2n/n) gates (Lupanov's theorem) and that there exist Boolean functions of n variables which require logic circuits of this size (Shannon's theorem). We present corresponding results for Boolean functions computed by VLSI circuits, using Thompson's model of a VLSI chip. We prove that all Boolean ...