1 The function level evolvable hardware approach to synthesize the combinational multiple-valued and binary logic functions is proposed in rst time. The new representation of logic gate in extrinsic EHW allows us to describe behaviour of any multi-input multi-output logic function. The circuit is represented in the form of connections and functionalities of a rectangular array of building block...

Modular programs are built as a combination of separate modules, which may be developed and veriied separately. Therefore, in order to reason over such programs, compositionality plays a crucial role: the semantics of the whole program must be obtainable as a simple function from the semantics of its individual modules. In the eld of logic programming, the need for a compositional semantics has...

This paper presents arithmetic operations, including addition and multiplication, in the ternary Galois field through carbon nanotube field-effect transistors (CNTFETs). Ternary logics have received considerable attention among all the multiple-valued logics. Multiple-valued logics are an alternative to common-practice binary logic, which mostly has been expanded from ternary (three-valued) log...

The genetic algorithm which determines the good functional decomposition of multiple-valued logic functions is presented. The algorithm expands the range of searching for a best decomposition, providing the optimal column multiplicity. The possible solutions are evaluated using the gain of decomposition for multiple-valued function.

In this paper we compare the expressive power of elementary representation formats for vague, incomplete or conflicting information. These include Boolean valuation pairs introduced by Lawry and Gonzalez-Rodriguez, orthopairs of sets of variables, Boolean possibility and necessity measures, three-valued valuations, supervaluations. We make explicit their connections with strong Kleene logic and...

We investigate admissible rules of Lukasiewicz multi-valued propositional logic. We show that admissibility of multiple-conclusion rules in Lukasiewicz logic, as well as validity of universal sentences in free MV -algebras, is decidable (in PSPACE ).

Several interpretations can be given to the third truth value in three-valued logics. Here, we consider the case when it refers to the epistemic notion of contradictory, or both true and false at the same time. We study several paraconsistent threevalued logics that carry this concern and show that they can be translated into a fragment of a simple epistemic logic where modalities can only appe...

This paper addresses the problem of probabilistic reasoning as it applies to Truth Maintenance Systems. A Belief Maintenance System hal! been constructed which manages a current set of probabilistic beliefs in much the same way that a TMS manages a set of true/false beliefs. Such a system may be thought of as a generalization of a. Truth Maintenance System. It enables one to reason using normal...