By Topic

Multiple-Valued Logic, 1990., Proceedings of the Twentieth International Symposium on

Date 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
  • HAMLET-an expression compiler/optimizer for the implementation of heuristics to minimize multiple-valued programmable logic arrays

    Publication Year: 1990, Page(s):144 - 152
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    A description is given of HAMLET, a CAD tool written in C, that translates a user specification of a multiple-valued expression into a layout of a multiple-valued programmable logic array (MVL-PLA) which realizes that expression. It is modular to accommodate future minimization heuristics and future MVL-PLA technologies. At present, it implements two heuristics and one MVL-PLA technology, current-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Free three-valued Lukasiewicz, Post and Moisil algebras over a poset

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

    A construction of the free three-valued Lukasiewicz algebra L (L) over a poset L is given. The number of elements of L(L) for some particular cases of finite posets L is determined. The free (three-valued) Post and Moisil algebras over a poset are determined 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.
  • RCM-MVI: a recursive consensus MVL minimization algorithm

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

    A heuristic minimization algorithm based on the recursive application of the familiar consensus operation is presented. Unlike traditional consensus-based algorithms, it allows for the early detection of essential and pseudoessential prime implicants. This means that a solution is usually determined without all prime implicants being generated. The only heuristic in the algorithm deals with the br... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-valued neural logic networks

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

    Two types of networks that are useful in developing expert systems are proposed. The probabilistic network can be used for predictive types of expert systems, whereas the fuzzy network is more suitable for expert systems that help in decision-making. In both cases, the expert system can operate in two modes. In the normal mode, rules are given by experts and weights are assigned values. In the lea... 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.
  • 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.
  • Comparison look-ahead and design of fast fuzzy operation units

    Publication Year: 1990, Page(s):121 - 125
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    Several hardware structures for realizing fuzzy operations are investigated from the point of view of faster operation. First, a bit-cascaded structure based on ripple comparison propagation is designed. To reduce the time delay during propagation of comparison results in the bit-cascaded structure, a comparison look-ahead circuit and a block-sliced structure are introduced. The fastest bit sliced... 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.
  • 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.
  • Minimization of functions with multiple-valued outputs: theory and applications

    Publication Year: 1990, Page(s):308 - 315
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    A theoretical framework for the minimization of logic functions with symbolic or multiple-valued outputs is presented. By use of this framework, efficient, exact algorithms for the problems of output encoding and finite-state-machine (FSM) state assignment are developed. All previous automatic approaches to these encoding problems have involved the use of heuristic techniques. A notion of generali... 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.
  • 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.
  • A four-valued modal logic arising from Monteiro's last algebras

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

    The class of abstract logics projectively generated by the class of logics defined on tetravalent modal algebras by the family of their filters is studied. These logics are four-valued in the sense that they can be characterized by a generalized matrix on the four-element tetravalent modal algebra which generates this variety together with a family of homomorphisms. They can be called modal since ... 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.
  • Strength of the rule of inference

    Publication Year: 1990, Page(s):336 - 338
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    The authors investigate a logical operator contained in a rule of inference as an unknown operator. It is shown that the function of the operator can be partially determined by solving the equation obtained from the rule of inference. The function can also be completely determined by this rule and an axiom system applied. This method makes clear the way in which a rule of inference restricts the f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Goal-oriented control of VLSI design processes based on fuzzy sets

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

    A formalism for goal-oriented control of VLSI design processes based on fuzzy sets is presented. The formalism solves the problem of inferring relationships between goals, which is an important problem in artificial-intelligence-based design. The focus of attention-a set of design actions which when performed move the design process in a direction consistent with the goals and their priorities-is ... 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.
  • 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.
  • 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.
  • Some relationships between multiple-valued Kleenean functions and ternary input multiple-valued output functions

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

    The multiple-valued Kleenean functions discussed are multiple-valued-logic functions represented by multiple-valued AND, OR, NOT, constants, and variables. First, when p=odd, ternary input p-valued output functions (or (3, p)-functions for short) are defined, and when p=even, ternary input (p+1)-valued output functions ((3, p+1)-functions for s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Step-wise synthesis of CCD MVL functions

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

    A new approach for synthesis of single-variable functions in CCD (charge-coupled-device) technology is presented. It is based on primitive functions that rely heavily on the functions realizable with single overflow gates. Positive and negative steps in logic levels are decomposed into patterns realizable with the primitive functions. The resultant decomposition leads directly to a circuit realiza... View full abstract»

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

    Publication Year: 1990, Page(s):54 - 60
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB)

    It is shown that the Robbins problem can be fruitfully investigated by using a simplified notation for formal algebras. In this notation a nonstandard model for Robbins algebra in terms of the language itself is conjectured. The results show that any algebra satisfying the Robbins axioms is very close to being Boolean. Finiteness, or an instance of absorption (a+b=a ), o... 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.