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
  • 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.
  • Enumeration of function and bases of three-valued set logic under compositions with Boolean functions

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

    This paper discusses some classification and enumeration problems in r-valued set logic, which is the logic of functions mapping n-tuples of subsets into subsets over r values. Boolean functions are convenient choice as building blocks in the design of set logic functions. Weak maximal sets are these containing all Boolean functions. The authors give the number of n-ary functions in each weak maxi... 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 (32)  |  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.
  • 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.
  • 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.
  • 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.
  • Interband-tunneling III-V semiconductor structures for multiple-valued literal and arithmetic functions

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

    Earlier MVL circuits used resonant tunneling devices based on intraband tunneling. Recently device concepts were explored in the AlSb/InAs system based on interband tunneling. Here non-resonant tunneling discharge from the 2DEG is effected into p+ doped InAs gates, whereas the 2DEG current is controlled with a Schottky gate as in the conventional HEMT. A wide range of physical and funct... 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.
  • Decomposition-based synthesis of multiple-valued functions for threshold logic network realization

    Publication Year: 1994, Page(s):58 - 64
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    In this paper, a sub-optimal algorithm for reducing the number of threshold elements required to realize a given binary function is presented. The algorithm uses a matching-count matrix to obtain the input-output pairing that results the maximum total matching count, thus minimizing the number of switching operations required. The concept of output phase assignment is used to extend the approach t... 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.
  • Multiple-valued combinational circuits with feedback

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

    We consider the use of feedback loops in the realization of multiple-valued combinational circuits. We show that the number of purely combinational configurations in an r-valued system is 1/r of the total number. Thus, as the radix increases, the fraction of combinational configurations decreases. We also show that, for every radix value r, there is a circuit with feedback realizing a combinationa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On T-quantifiers and S-quantifiers

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

    We show how the “classical” theory of T-norms and S-norms of fuzzy logic can be generalized to a theory of T-quantifiers and S-quantifiers, respectively. The key idea leading to this generalization is the fact that the (infinite) iteration of the two-valued conjunction and disjunction gives the two-valued all-quantifier and ex-quantifier, respectively. In the framework of fuzzy logic t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On scheduling in multiprocessor systems using fuzzy logic

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

    Proposes an algorithm for processor partitioning in multiprocessor systems. The algorithm is based on fuzzy logic. It takes crisp inputs that represent the remaining amount of work and the efficiency of an application and produces the output that determines the number of processors that are to be allocated to the application during a given reallocation period. Simulation results are presented that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Completeness criteria in many-valued set logic under compositions with Boolean functions

    Publication Year: 1994, Page(s):177 - 183
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    Discusses the functional completeness problems in r-valued set logic, which is the logic of functions mapping n-tuples of subsets into subsets over r values. Boolean functions are convenient choice as building blocks in the design of set logic functions. A set of functions F is Boolean complete if any set logic function can be composed from F once all Boolean functions are added to F. The paper pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of wave-parallel computing circuits for densely connected architectures

    Publication Year: 1994, Page(s):207 - 214
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    Investigates new architecture LSIs based on wave-parallel computing (WPC) to address the interconnection problems in highly parallel VLSI systems. The underlying concept is frequency multiplexing of digital signals, which enables the utilization of the parallelism of electrical (or optical) waves for parallel processing. The key to success with WPC architecture lies in finding efficient implementa... 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.
  • 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.
  • Algebraic division for multilevel logic synthesis of multi-valued logic circuits

    Publication Year: 1994, Page(s):44 - 51
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    Presents the concept of algebraic division for multilevel logic synthesis of multi-valued logic (MVL). At first, an MVL algebraic division procedure is developed based on a basic set of gates. By introducing two MVL Boolean properties: “identical” and “complementary” into the division operation, the procedure is further improved to be a mix-algebraic division procedure, whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hereditary clones of multiple valued logic algebra

    Publication Year: 1994, Page(s):306 - 313
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    We discuss relationships between properties and operations over the set Ω of MVL functions. Closed properties are those invariant under the classical closure operation. A new type of properties, called hereditary, is defined, as well as hereditary closure. We calculate the ratio of hereditary properties, describe the families of maximal hereditary clones, and give a formula for their enumera... 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.
  • 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.
  • Efficient graph based representation of multi-valued functions with an application to genetic algorithms

    Publication Year: 1994, Page(s):65 - 72
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    We present a new general data structure for representation of multi-valued input, multi-valued output functions, called function graphs (FG). Ordered FGs are shown to be a canonical form. We investigate read-once FGs and show that type-restricted FGs are also canonical. We use FGs for multi-valued set representation and manipulation. They allow efficient manipulation algorithms for set operations,... 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.