By Topic

Multiple-Valued Logic, 1994. Proceedings., Twenty-Fourth International Symposium on

25-27 May 1994

Filter Results

Displaying Results 1 - 25 of 51
  • Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94)

    Publication Year: 1994
    Request permission for commercial reuse | PDF file iconPDF (21 KB)
    Freely Available from IEEE
  • Computing prime implicants/implicates for regular logics

    Publication Year: 1994, Page(s):115 - 123
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    Prime implicant/implicate generating algorithms for multiple-valued logics are introduced. Techniques from classical logic not requiring large normal forms or truth tables are adapted to certain “regular” multiple-valued logics. This is accomplished by means of signed formulas, a meta-logic for multiple valued logics; the formulas are normalized in a way analogous to negation normal fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of multiple-valued linear digital circuits for highly parallel k-ary operations

    Publication Year: 1994, Page(s):223 - 230
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    To design highly parallel digital circuits such as an adder and a multiplier, it is difficult to find the optimal code assignment in the nonlinear digital system. On the other hand, the use of the linear concept in digital systems seems to be very attractive because analytical methods can be utilized. For unary operations, the design method of locally computable circuits have been discussed. In th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A field programmable analog array for continuous, fuzzy, and multi-valued logic applications

    Publication Year: 1994, Page(s):148 - 155
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    We propose a novel approach to the realization of continuous, fuzzy, and multi-valued logic (mvl) circuits. We demonstrate how a general-purpose field programmable analog array (FPAA), with cells realizing simple arithmetic operations on signals, can be used for this purpose. The FPAA, which is being implemented in a bipolar transistor array technology, operates from ±3.3 V or ±5 V p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Calculation of Reed-Muller-Fourier coefficients of multiple-valued functions through multiple-place decision diagrams

    Publication Year: 1994, Page(s):82 - 88
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    We extend the method for the calculation of Walsh transform of binary switching functions through the binary decision diagrams to the calculation of Reed-Muller-Fourier transform of p-valued through multiple-place decision diagrams functions through multiple-place decision diagrams. The calculation of Reed-Muller coefficients of binary switching functions is involved as a special case for p=2 View full abstract»

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

    Publication Year: 1994, Page(s):124 - 131
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    Since the concept of fuzzy sets is proposed by L.A. Zadeh, as the extensions of Boolean functions many multiple-valued logic functions permitted to take truth values besides 0 and 1 have been investigated. Each one of multiple-valued logic functions motivated by the concept of fuzzy sets is one of the models of Kleene algebras, which have almost of the properties holding in Boolean algebras exclud... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of multiplex interconnection networks for massively parallel computing systems

    Publication Year: 1994, Page(s):231 - 238
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    The concept of multiplex interconnection networks is proposed to attack the communication crisis in massively parallel computing in the next generation. In the multiplex interconnection network, multiplexable information carriers, such as optical wavelengths, are employed so that large-scale communication topologies can be embedded in the virtual space of multiplexable carriers with reduced interc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-peak resonant tunneling diodes based fuzzifiers

    Publication Year: 1994, Page(s):156 - 161
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    In contrast to conventional CMOS and bipolar implementations for fuzzifier hardwares, the newly proposed fuzzifier circuits take advantage of the unique folding characteristic of one class of quantum well device, namely, the resonant tunneling diode (RTD). Three different types of RTD based fuzzifiers are proposed depending on the kinds of intrinsic I-V characteristics available. For fuzzy logic p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complete test set for multiple-valued logic networks

    Publication Year: 1994, Page(s):289 - 296
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    A complete test set (CTS) is defined and derived for multiple-valued logic (MVL) Min/Max networks. The CTS can detect any single and multiple stuck-at faults of the MVL Min/Max network regardless of its implementation. Two splitting algorithms to generate the CTS or a given MVL function are proposed. One algorithm demonstrates over 2 orders speed improvement and 3 orders memory savings and the oth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The completeness problem on the product of algebras of finite-valued logic

    Publication Year: 1994, Page(s):184 - 186
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    Gives a general completeness criterion for the arity-calibrated product PkxPm of the algebras of all functions of the k-valued and m-valued logics (k,m⩾2). The Galois connection between the lattice of subalgebras PkxPm and the lattice of subalgebras of the double-base invariant relations algebra (with operations of restricted first order calculus) is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Several remarks on algebraic entropy

    Publication Year: 1994, Page(s):319 - 322
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    Following our previous results on axiomatization of entropy of finite functions we introduce an axiomatization of the notion of entropy for equivalence relations. Also, we examine entropic properties of several classes of functions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A design method for look-up table type FPGA by pseudo-Kronecker expansion

    Publication Year: 1994, Page(s):97 - 106
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    In FPGA design, interconnections are often more expensive than logic. FPGAs using 3-input lookup tables (LUTs) require many logical levels and complex interconnections. On the other hand, FPGAs using 6-input LUTs require fewer interconnections and fewer logical levels. We show a method to represent logic functions by using pseudo-Kronecker diagrams (PKDD's). Experimental results show that 2-valued... View full abstract»

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

    Publication Year: 1994, Page(s):276 - 281
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    Soft computing stands for methods and techniques in fuzzy logic, probabilistic reasoning, neural networks, genetic algorithms, chaos or other approaches related to cognitive modelling. These overlapping domains can reinforce each other, thus offering suitable tools to represent and solve real world problems. Genetic algorithms and classifier systems are introduced in the framework of soft computin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Searching for complete functions over E(3) with small radii

    Publication Year: 1994, Page(s):172 - 176
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    Recent advances in laser and fiber optic technology have made it feasible to build optical processors which are based upon value systems larger than E(2)={0,1}. The problem of designing a transistor which can be used as the basis for the circuits of such a processor involves a detailed study of functions which are either complete or complete with constants over E(3) and E(4). The radii of all comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel processing of fuzzy inferences

    Publication Year: 1994, Page(s):134 - 140
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    Rule based systems are computationally very demanding, since a large number of rules has to be evaluated every time new input data are observed in order to undertake a corresponding action. The authors study the possible improvements in performance by using parallel processing. Both fine grade algorithms and standard multiprocessor architectures for Mamdani-type fuzzy systems with two inputs and o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient deduction in many-valued logics

    Publication Year: 1994, Page(s):240 - 249
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    This paper tries to identify the basic problems encountered in automated theorem proving in many-valued logics and demonstrates to which extent they can be currently solved. To this end a number of recently developed techniques are reviewed. We list the avenues of research in many-valued theorem proving that are in our eyes the most promising View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CML current mode full adders for 2.5-V power supply

    Publication Year: 1994, Page(s):10 - 14
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    We present the basic structure and performance of CML current mode full adders, that are used as carry save adders (CSA) in combinatorial multipliers. A 1.2 μm BiCMOS technology is used for simulations but the schematic assumes a 2.5-V power supply. Compared with binary voltage mode CSAs, the multivalued current mode CSAs have chip area and power dissipation advantage, but speed disadvantage. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of fault-tolerant cellular arrays on multiple-valued logic

    Publication Year: 1994, Page(s):297 - 304
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    This paper discusses the problems of the design and the fault tolerance in multiple-valued cellular arrays by considering the single-level array, the two-level array and the three-level array. These arrays are constructed by some cells that have the unique switch operation. It assumes the stuck-at-0 fault and the stuck-at-(k-1) fault of the switch cells on k-valued cellular arrays. The fault-toler... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximating propositional calculi by finite-valued logics

    Publication Year: 1994, Page(s):257 - 263
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    The problem of approximating a propositional calculus is to find many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible. This has potential applications for representing (computationally complex) logics used in AI by (computationally easy) many-valued logics. It is investigated how far this method can be carried ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resonant tunneling diodes for multi-valued digital applications

    Publication Year: 1994, Page(s):188 - 195
    Cited by:  Papers (31)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    Resonant tunneling diodes (RTD) have unique folding V-I characteristics, which lend themselves to multi-valued applications, The negative differential resistance of RTDs renders the operating points self-latching and stable. Any positive resistance in series with an RTD can give rise to hysteresis, especially at high frequencies, The hysteresis effect limits the operation of some multi-valued circ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multiple-valued logic synthesis using the Kleenean coefficients

    Publication Year: 1994, Page(s):52 - 57
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    This paper presents a new multiple-valued sum-of-products expression structure and shows its minimization to reduce the number of implicants needed in the minimal sum-of-products expressions. The new expression is introduced as the MAX-of-MIN's expression of Kleenean coefficients and one or more literals, where Kleenean coefficients are defined as the logic formulas built from MIN, constants and v... View full abstract»

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

    Publication Year: 1994, Page(s):15 - 18
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    A new quaternary multiplier circuit is presented. This current-mode CMOS circuit multiplies the values of two quaternary-valued input currents and adds a ternary-valued carry input current to generate the two-quaternary-digit output: a most-significant-digit ternary-valued CARRY output current and a quaternary-valued PRODUCT output current. This multiplier circuit uses 49 MOS transistors and gener... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification of linear ternary logic functions and its algorithms

    Publication Year: 1994, Page(s):324 - 327
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    A new approach to identify the linear ternary logic functions is introduced. It is easy to know if a ternary function is linear using its truth-valued vector and three-three compression algorithm presented in this paper. The algebraic expression of the linear logic function given by its truth-valued vector can be derived from the three-three compression algorithm View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lattices of resolution logics

    Publication Year: 1994, Page(s):108 - 114
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    We study classes of logical calculi which have the same inconsistent sets of formulas. We investigate the algebraic structure of these classes as well as general properties of logical calculi in these classes in the context of the search for efficient resolution based automated reasoning methods View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of multiwave computing circuits based on a model of integrated opto-electronic devices

    Publication Year: 1994, Page(s):215 - 222
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    A new computing architecture based on multiwavelength opto-electronic integrated circuits (multiwave OEICs) is proposed to overcome the communication bottleneck in highly parallel systems. In this paper, we present a possible model of multiwave OEICs to evaluate areas of multiwave computing circuits as a function of the number of available wavelength components and other key parameters. Also, the ... View full abstract»

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