The design of a I-input and a ?-input 4-valued logic gate is described. These gatcs can be used to implement cells of a gate array, with the benefit of having prograrnriiabk functionality and multiple-valued logic input and output lincs. Programmable fimctionality allows any or the four billion functions of a '-input 4-valued logic gate to be implemented by thc samc cell, and multiplc-valucd hg...

Recently, negative differential resistance devices have attracted considerable attention due to their folded current-voltage characteristic, which presents multiple threshold voltage values. Because of this remarkable property, studies associated with the negative differential resistance devices have been explored for realizing multi-valued logic applications. Here we demonstrate a negative dif...

In Philosophical Logic, the Liar Paradox has been used to motivate the introduction of both truth value gaps and truth value gluts. Moreover, in the light of “revenge Liar” arguments, also higherorder combinations of generalized truth values have been suggested to account for so-called hypercontradictions. In the present paper, Graham Priest’s treatment of generalized truth values is scrutinize...

Kleene’s well-known strong three-valued logic is shown to be one of a family of logics with similar mathematical properties. These logics are produced by an intuitively natural construction. The resulting logics have direct relationships with bilattices. In addition they possess mathematical features that lend themselves well to semantical constructions based on fixpoint procedures, as in logic...

We introduce a family of partial stable model semantics for logic programs with arbitrary aggregate relations. The semantics are parametrized by the interpretation of aggregate relations in three-valued logic. Any semantics in this family satisfies two important properties: (i) it extends the partial stable semantics for normal logic programs and (ii) total stable models are always minimal. We ...

The coincidence of the declarative and procedural interpretations of logic programs does not apply to Prolog programs, due to the depth-rst left-to-right evaluation strategy of Prolog interpreters. We propose a semantics for Prolog programs based on a four-valued logic. The semantics is based on a new concept of completion analogous to Clark's and it enjoys the nice properties of the declarativ...

−A number of heuristic algorithms for producing near minimal sum-of products realization of multiple valued logic (MVL) functions have been introduced in the literature. In particular, the direct cover (DC) algorithms have been used effectively for synthesis of MVL functions for implementation using 2-level programmable logic arrays (PLAs). In this paper, a hybrid ant colony (ACO) algorithm and...

A novel methodology designing for Multiple-Valued Logic voltage-mode storage circuits is introduced. Using the proposed inverter-based unit, uni-signal controlled pass gates and True Single-Phase Clocked Logic-based output units, efficient r-ary (where r is the radix) dynamic and pseudo-static latches can be designed. They exhibit regular, modular, and iterative structure, which means that the ...

We give a classification of dual functions, they are m -al functions. We call a function m-al with respect to an operator if the operator lives any function unchanged after m times of using the operator. And 2 ≤ m ≤ k. Functions with different m have very different properties. We give theoretical results for clones of self-dual (m = 2) and selfk -al (m = k) functions in k -valued logic at k ≤ 3...

Computing certain answers is the preferred way of answering queries in scenarios involving incomplete data. This, however, is computationally expensive, so practical systems use efficient techniques based on a particular three-valued logic, although this often leads to