By Topic

Multiple-Valued Logic, 1996. Proceedings., 26th International Symposium on

Date 29-31 May 1996

Filter Results

Displaying Results 1 - 25 of 52
  • Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96)

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (410 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (58 KB)
    Freely Available from IEEE
  • An algebraic approach to hyperalgebras

    Publication Year: 1996, Page(s):203 - 207
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    In the past 6 decades the theory of hypergroups and other concrete hyperalgebras has fairly developed but there is still no coherent universal-algebra type theory of hyperalgebras. We represent hyperalgebras on a universe A as special universal algebras on the set P*(A) (of all nonvoid subsets of A), define hyperclones on A and for A finite, study the relationship between the hyperclones on A and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interband RTDs with nanoelectronic HBT-LED structures for multiple-valued computation

    Publication Year: 1996, Page(s):80 - 85
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    For future nanoelectronic arrays, complex signal processing methods and highly efficient computation are required. A proposed new family of HBT-LED-RTD circuitry chiefly addresses the latter with multiple-valued logic. We use internal optical methods of signal summation in otherwise electronic circuitry. Precision photon streams are generated and summed that are equivalent to electron currents in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weight structures for approximate reasoning with weighted expressions

    Publication Year: 1996, Page(s):178 - 183
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    One method of constructing an `approximate reasoning' system is to use a `classical' system of many-valued logic and attach to each logical expression a `weight' which assesses the validity of this expression. Several such systems have been described in the literature, with varying interpretations concerning structure and semantics of weights. In this paper, a `canonical' principle for defining th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New interpolation algorithms for multiple-valued Reed-Muller forms

    Publication Year: 1996, Page(s):16 - 23
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    This paper presents new algorithms for the sparse multivariate polynomial interpolation over finite fields, which can be used for optimizing Reed-Muller forms for MVL functions. Starting with a quadratic time interpolation algorithm for Boolean functions, we develop a method that decomposes the problem into several smaller problems for the MVL case. We then show how each of these problems can be s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multiple-valued ferroelectric content-addressable memory

    Publication Year: 1996, Page(s):74 - 79
    Cited by:  Papers (8)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    A novel architecture for a multiple-valued ferroelectric content-addressable memory (FCAM) is proposed. An FCAM employs ferroelectric capacitors as storage elements to provide a nonvolatile content-addressable memory. A 2-bit search operation is performed by a simultaneous access to a 4-level polarization, hence reducing the total number of search operations to half. Four FCAM structures are discu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficiently irreducible bases in multiple-valued logic

    Publication Year: 1996, Page(s):296 - 301
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    Basis is a functionally complete set of multiple-valued logic functions that is irreducible, i.e. contains no complete proper subsets. Functional completeness of a set means that for any function in MVL there exists a formula over this set that implements it. However, this classical definition of basis does not consider the efficiency of implementation, particularly, it does not guarantee the exis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault diagnosis system based on sensitivity analysis and fuzzy logic

    Publication Year: 1996, Page(s):50 - 55
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (348 KB)

    This paper describes three ways of building a decision system for model-based fault diagnosis. The aim is the management of uncertain and redundant information provided by a parity equation fault diagnosis method. Although any residual generation method may be considered, the input-output parity equation approach has been used. Sensitivity analysis is the key point in the evaluation of fault sympt... View full abstract»

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

    Publication Year: 1996, Page(s):10 - 15
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    A method for verification of Multi-Valued Logic Networks (MVLNs) using Ordered Multi-Valued Decision Diagrams (OMDDs) is presented. For tree-like MVLNs an upper bound on the OMDD size can be proven. Thus, heuristics known for OBDDs can also be used for OMDDs. A large set of experiments is presented that underlines the efficiency of the approach View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A literal gate using resonant-tunneling devices

    Publication Year: 1996, Page(s):68 - 73
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    We propose a novel literal gate consisting of one resonant-tunneling diode (RTD) and two resonant-tunneling transistors (RTTs). Logic operation is based on the control of the switching sequence of these devices through the modulation of their peak currents by the input signal. By using an integrated RTD-HEMT pair as an RTT, we implement literal gates and successfully obtain the literal function. A... View full abstract»

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

    Publication Year: 1996, Page(s):154 - 159
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    Fuzzy connectives used to be assumed associative. In this way, key operational difficulties are solved by means of a single binary operator. In this paper we point out that the main property in order to assure operativeness should be recursiveness, which is weaker than associativity. If calculus can be obtained by means of a recursive application of a sequence of binary connectives, we still can d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logic expressions of monotonic multiple-valued functions

    Publication Year: 1996, Page(s):290 - 295
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    This paper presents some fundamental properties of multiple-valued logic functions monotonic with respect to a partial-ordering relation which is introduced in the set of truth values and does not necessarily have the greatest or least element. Two kinds of necessary and sufficient conditions for monotonic p-valued functions are given with the proofs. Their logic formulas using unary operators def... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximative conjunctions processing by multi-valued logic

    Publication Year: 1996, Page(s):130 - 135
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    We study a knowledge base composed of facts and rules of a linguistic nature. We attribute a linguistic degree to each proposition which represents its veracity. A problem encountered is the following: “When the premise part of a production rule is a conjunction of several propositions and when we observe each of these propositions with some degree, what global degree should we attribute to ... View full abstract»

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

    Publication Year: 1996, Page(s):43 - 48
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    A non-commutative propositional logic is described. A Hilbert-style axiomatisation is given for the logic, and a multiple-valued interpretation is constructed. The logic is shown to be sound and complete with respect to this interpretation. We also show that the logic has no finite complete models. An application includes the specification and design of multiple-valued switching circuits View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Planarity in ROMDDs of multiple-valued symmetric functions

    Publication Year: 1996, Page(s):236 - 241
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    We show that a multiple-valued symmetric function has a planar ROMDD (reduced ordered multiple-valued decision diagram) if and only if it is a pseudo-voting function. We show that the number of such functions is (r-1)(n+r, n+1) where r is the number of logic values and n is the number of variables. It follows from this that the fraction of symmetric multiple-valued functions that have planar ROMDD... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complex spectral decision diagrams

    Publication Year: 1996, Page(s):255 - 260
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    Different decision diagrams for representations of binary and multiple-valued functions in the form of Complex Hadamard Transforms and Spectra are introduced in this paper. Since Complex Hadamard Transform matrix can be recursively expanded through Kronecker products, complex hybrid decision diagrams can be easily derived. Other types of decision diagrams introduced are: complex multi-terminal dec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A ternary systolic product-sum circuit for GF(3m) using neuron MOSFETs

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

    In this paper, we present a ternary systolic product-sum computation circuit for GF(3m) using voltage-mode neuron MOSFETs. The required subcircuits are discussed which together form a basic cell. The overall design which connects basic cells in a systolic manner, thereby making effective use of pipelining, is shown. SPICE simulations of the central part of the basic cell are presented w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • As you like them: connectives in fuzzy logic

    Publication Year: 1996, Page(s):2 - 7
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    We review the question of which connectives (conjunctions, disjunctions and negations) may be of interest in fuzzy logic. Several alternative structures to the classical Boolean algebras are presented and discussed. We show how techniques from the theory of functional equations may help to clarify the problem of choosing appropriate connectives or refusing inadequate operations View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of one-vector testable binary systems based on ternary logic

    Publication Year: 1996, Page(s):62 - 66
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    A new concept, one-vector testability, is defined. Design method to achieve one-vector testability of binary systems based on ternary logic is proposed. Some techniques for designing testable binary systems based on ternary circuits are re-examined by using the proposed design method View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Several remarks on the complexity of set-valued switching functions

    Publication Year: 1996, Page(s):166 - 170
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    We explore the complexity of circuits that implement set-valued logic functions on a complete basis that we propose in this paper. This basis is related to the bases used in the main sources on this subject, as we show in Section 2. After discussing properties of the constituents of this basis (which consist of both Boolean and non-Boolean components) we prove that almost all set-valued functions ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Helena Rasiowa-a view of the academic trajectory and the influence upon Polish and international scientific community

    Publication Year: 1996, Page(s):144 - 146
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    The death of H. Rasiowa was a big loss for both, the Polish and the international scientific community. The life of Professor Rasiowa was passionately devoted to the development of logic, algebra and computer science and brought the fruits already reckoned among the results of the highest importance. The influence of her personality goes far beyond Poland and the group of logicians, mathematicians... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logical not polynomial forms to represent multiple-valued functions

    Publication Year: 1996, Page(s):302 - 307
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    The synthesis of logical not polynomial forms to represent completely and incompletely defined multiple-valued logic functions is proposed. To compute these forms, discrete orthogonal transforms are used. The matrix and vector procedures are the foundation of the logic not polynomial form synthesis to represent multiple -valued functions. The main advantage of this forms is the possibility to inve... View full abstract»

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

    Publication Year: 1996, Page(s):148 - 152
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    Helena Rasiowa could be described as an atypical mathematician since, being a pure theoretician in the first part of her scientific life (1945-70), she changed course swiftly, around 1970, by applying her own abstract methods to practically-motivated theoretical problems arising in computer science (the analysis of computer programs) and artificial intelligence (the logic of approximations). The r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DT-an automated theorem prover for multiple-valued first-order predicate logics

    Publication Year: 1996, Page(s):284 - 289
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    We describe the automated theorem prover “Deep Thought” (DT). The prover can be used for arbitrary multiple-valued first-order logics, provided the connectives can be defined by truth tables and the quantifiers are generalizations of the classical universal resp. existential quantifiers. DT has been tested with many interesting multiple-valued logics as well as classical first-order pr... View full abstract»

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