By Topic

Proceedings of the Twentieth International Symposium on Multiple-Valued Logic

23-25 May 1990

Filter Results

Displaying Results 1 - 25 of 58
  • Proceedings of the Twentieth International Symposium on Multiple-Valued Logic (Cat. No.90CH2886-0)

    Publication Year: 1990
    Request permission for commercial reuse | PDF file iconPDF (16 KB)
    Freely Available from IEEE
  • Approximate reasoning in strength logic

    Publication Year: 1990, Page(s):262 - 269
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    The author defines a modal logic SL (strength logic) to reason about beliefs in an AI system. SL is a refinement of J. Halpern and M. Rabin's likelihood logic (LL) (1987). As in LL, the powers of a modal operator S are used in SL to denote various degrees of certainty of beliefs. However, the axiomatization of SL is different from that of LL. Formulas in SL admit normal forms, and decisio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Differential multiple-valued logic using resonant tunneling diodes

    Publication Year: 1990, Page(s):189 - 195
    Cited by:  Papers (17)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    Differential multiple-valued logic (MVL) based on resonant tunneling diodes (RTDs) and heterojunction bipolar transistors is described. The novel gates are of the emitter-coupled current-switch type and can implement a wide range of MVL functions, including sums of products and multiple-threshold elements. One of the gates consists of diodes performing the input-thresholding functions and current ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the structure of maximal closed sets of Pk2

    Publication Year: 1990, Page(s):254 - 261
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    The set functions of a clone of Pk2 (mapping the set {0, 1, . . ., k-1}n into {0,1}, n=1, 2, . . .) is divided into equivalence classes so that two functions are in the same class if their membership in the maximal subclones of the clone coincides. This also leads to a natural classification of the set of bases (i.e. irredundant complete subsets) of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient multi-level multi-wire differential interface

    Publication Year: 1990, Page(s):181 - 188
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    The authors introduce a multilevel, multiwire interface that, while retaining the differential properties of the signal, can transmit information at higher rates than would be possible through a binary differential interface with the same number of wires. Besides being rather insensitive to external electromagnetic noise sources, such an interface generates very little electromagnetic radiation. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intersections of isotone clones on a finite set

    Publication Year: 1990, Page(s):248 - 253
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    Let ⩽ be a fixed order of height at least 2 on a set A (i.e. contains a chain a<b<c). It is shown that all the isotone clones preserving orders on A isomorphic to ⩽ intersect in the clone KA of trivial functions (i.e. all the projections and all the constant operations on A). It is further shown that for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary to quaternary encoding in clocked CMOS circuits using weak buffer

    Publication Year: 1990, Page(s):174 - 180
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    A binary-to-quaternary encoder is presented for four-valued signaling of buses in clocked CMOS integrated circuits. It uses a new CMOS circuit called the weak buffer. A weak buffer takes a conventional binary input and produces two stable output voltage levels of intermediate magnitudes that lie between the conventional 0 and 1 levels for binary circuits. Thus, the conventional binary voltage leve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bilattices in logic programming

    Publication Year: 1990, Page(s):238 - 246
    Cited by:  Papers (26)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    Bilattices are a family of multiple-valued logics. Those meeting certain natural conditions have provided the basis for the semantics of a family of logic programming languages. Consideration is given to further restrictions on bilattices in order to narrow things down to logic programming languages that can, at least in principle, be implemented. Appropriate bilattice background information is pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A CMOS quaternary threshold logic full adder circuit with transparent latch

    Publication Year: 1990, Page(s):168 - 173
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    A circuit that realizes the quaternary threshold logic full adder function with transparent latching has been realized in a standard polysilicon-gate CMOS technology. In its FOLLOW mode, the quaternary full adder accepts two quaternary inputs and a binary CARRY input, and develops a two-quaternary-digit output word that is the base-four sum of the inputs. In the HOLD mode, these output states are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theory and uses of Post algebras of order ω+ω*. I

    Publication Year: 1990, Page(s):42 - 47
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    A monotonic system of Post algebras of the order ω+ω*, whose chain of Post constants is isomorphic with 0⩽1⩽2⩽ . . . ⩽-3⩽-2⩽-1, is presented. Besides monotonic operations, other unary operations are considered, namely disjoin operations, the quasi-complement, successor and predecessor operations. The successor and predecessor operations are basic for number theo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Alleviating memory bottlenecks using multi-level memory

    Publication Year: 1990, Page(s):102 - 109
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    Limited primary memory and slow secondary memory device speeds are bottlenecks in many modern computer systems. They lead to drastic reduction in the throughput of such computer systems (thrashing) as the degree of multiprogramming (DMP) is increased. Alleviation of the problem by using a multilevel mass storage between the primary and the secondary memory systems is proposed. Analytic techniques ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The analysis of one dimensional multiple-valued linear cellular automata

    Publication Year: 1990, Page(s):402 - 409
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    The authors present an analysis of multiple-valued linear cellular automata (CA) and their properties over GF(q). An application for pseudorandom pattern generation over a finite alphabet is discussed. For these cellular automata, the legal computational rules are defined and classified. The desired cellular automata must also have a maximal-length cycle in their state transition graph. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The learning aspects of the FAULT FINDER expert system

    Publication Year: 1990, Page(s):378 - 385
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    The FAULT FINDER expert system implements fault isolation decisions for any target system or equipment that is modeled by lowest replaceable units (LRUs). This expert system utilizes a database to represent each LRU, a status interface to obtain LRU status, and a knowledge base to store the rules of fault isolation for the target system. The expert system has learning capabilities in the database,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Many-valued tense logic and the problem of determination

    Publication Year: 1990, Page(s):228 - 236
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    A three-valued tense logic based on the three-valued Lukasiewiczian propositional logic is constructed. The aim of the construction is formalization of the argument from the principle of causality in favor of the thesis of determinism. It is shown that, if density of time is assumed, the argument fails. The time is divided into real and possible time. Facts which take place in real time are determ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward the age of beyond-binary electronics and systems

    Publication Year: 1990, Page(s):162 - 166
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    The key issue in MVL (multiple-valued-logic) systems is the development of superior multiple-valued hardware algorithms and appropriate devices. From this point of view, several chips that are superior to the corresponding binary ones have been developed. These advantages will be greatly enhanced in the submicron geometry because performance depends on the interconnection resistance and capacitanc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on finite clones containing all permutations

    Publication Year: 1990, Page(s):34 - 41
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    Let A be a finite set with |A|>2. The authors describe all clones on A containing the set SA of all permutations of A among its unary operations. (A clone on A is a composition closed set of finitary operations on A containing all projections.) With a few exceptions such a clone C is either essentially unary or ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Kleene-Stone logic functions

    Publication Year: 1990, Page(s):93 - 100
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    Kleene algebra has correspondence with fuzzy sets or fuzzy logic and has recently been studied as an algebraic system treating ambiguity or fuzziness. In contrast, Stone algebra, which has connections with modality, has properties different from Kleene algebra. Kleene-Stone algebra has been proposed as an algebra that is both a Kleene algebra and a Stone algebra. A set of Kleene-Stone logic functi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general fuzzy logical operator set

    Publication Year: 1990, Page(s):279 - 283
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    A general basic fuzzy logical operator set is introduced. This set reserves many properties existing in binary logic. The set consists of four abstract operators: negation, conjunction, disjunctions, and implication. The authors discuss the fact that conjunction and implication are a pair of inverse operators, which is the foundation of the general set. By using this set in approximate reasoning, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the diagnosability of systems with three valued test results: diagnosis by comparison strategy

    Publication Year: 1990, Page(s):115 - 120
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    A model of self-diagnosable multiprocessor systems, in which the faulty processors are determined by comparing the results of identical tasks performed by a pair of processors in the system, was introduced by J. Maeng and M. Malek (1981). An analysis is presented of the diagnosability problems for such a model when the result of comparison is three-valued. A set of criteria is given for determinin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A design of multiple-valued logic neuron

    Publication Year: 1990, Page(s):418 - 425
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    A design for a multiple-valued-logic (MVL) neuron model, in which MVL operations are used to produce analog responses to be fed to a quantizer, is presented. The proposed MVL neuron model can be trained to classify the input pattern vectors according to the special inputs called `desired responses'. The advantages of the MVL neuron model over the ordinary linear neuron model are a robust separatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A CMOS current-mode high speed fuzzy logic microprocessor for a real-time expert system

    Publication Year: 1990, Page(s):394 - 400
    Cited by:  Papers (6)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    The design of a CMOS current-mode, high-speed, fuzzy logic microprocessor on a chip is described. The design has the advantage of simple circuit structure and high processing speed. The chip consists of approximately 2500 transistors and can process in parallel 40 rules of two antecedents and one conclusion each, at a speed of 1,000,000 FLIPS (fuzzy logic inferences per second) with a 30-MHz clock... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concerning the maximum size of the terms in the realization of symmetric functions

    Publication Year: 1990, Page(s):292 - 299
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    One method for realizing symmetric functions uses terms which consist of sums of fundamental symmetric functions. In many situations these sums simplify considerably. It is shown that, in the worst case, the size of these sums could approach half the number of possible fundamental symmetric functions without any simplification being possible. An expression for the number of fundamental symmetric f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-recovery and intelligent distributed system

    Publication Year: 1990, Page(s):372 - 377
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    A site of a distributed system can acquire new knowledge through learning from its closest neighbors. This new knowledge, stored at that site, is in a compressed form and is presented in the form of rules. In this way each site of the distributed system has some picture about the knowledge kept by its neighbors. The proposed scheme is characterized by fault-recovery and fault-tolerance capabilitie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modular design of multiple-valued arithmetic VLSI system using signed-digit number system

    Publication Year: 1990, Page(s):355 - 362
    Cited by:  Papers (10)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    A modular arithmetic circuit using a radix-4 minimum-redundant signed-digit number system is proposed. Any arithmetic circuit can be constructed using a single kind of module with a high degree of parallelism. This modularity is very useful for realizing high-performance semicustom VLSI such as a data-driven arithmetic circuit. The module is composed of an adder, a partial product generator, and a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the synthesis of MVMT functions for PLA implementation using CCDs

    Publication Year: 1990, Page(s):316 - 323
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    A new programmable logic array (PLA) for implementation of multivalued multithreshold (MVMT) functions using charge-coupled-device (CCD) technology is introduced. It is shown that the number of functions realized using the proposed structure is larger than those realized using the authors' previously reported PLA structure. For example, all 256 four-valued three-threshold functions can be synthesi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.