By Topic

37th International Symposium on Multiple-Valued Logic (ISMVL'07)

Date 13-16 May 2007

Filter Results

Displaying Results 1 - 25 of 70
  • 37th International Symposium on Multiple-Valued Logic - Cover

    Publication Year: 2007, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (255 KB)
    Freely Available from IEEE
  • 37th International Symposium on Multiple-Valued Logic - Title page

    Publication Year: 2007, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (255 KB)
    Freely Available from IEEE
  • 37th International Symposium on Multiple-Valued Logic - Copyright notice

    Publication Year: 2007, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (119 KB)
    Freely Available from IEEE
  • 37th International Symposium on Multiple-Valued Logic - TOC

    Publication Year: 2007, Page(s): v
    Request permission for commercial reuse | PDF file iconPDF (252 KB)
    Freely Available from IEEE
  • Message from the Chair

    Publication Year: 2007, Page(s): vi
    Request permission for commercial reuse | PDF file iconPDF (27 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Program Chair

    Publication Year: 2007, Page(s): vii
    Request permission for commercial reuse | PDF file iconPDF (27 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Committee

    Publication Year: 2007, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (26 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2007, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (25 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2007, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (20 KB)
    Freely Available from IEEE
  • Grand Challenges of Nanoelectronics and Possible Architectural Solutions: What Do Shannon, von Neumann, Kolmogorov, and Feynman Have to do with Moore

    Publication Year: 2007, Page(s): a
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (595 KB) | HTML iconHTML

    This presentation discuss the many challenges faced by the design of future tera-scale integrated circuits that result from the use of nano-scale electronic devices. The relations among these challenges was studied, and a relative ranking was proposed. Afterwards, we shall delve into the most difficult challenges. Finally, possible solutions was also be suggested. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Ternary Calculating Machine of Thomas Fowler

    Publication Year: 2007, Page(s): b
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1358 KB) | HTML iconHTML

    In 1840, Thomas Fowler, a self-taught English mathematician and inventor, created a unique ternary calculating machine. Until recently, all detail of this machine was lost. A research project begun in 1997 uncovered sufficient information to enable the recreation of a physical concept model of Fowler's machine. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated Reasoning in Some Local Extensions of Ordered Structures

    Publication Year: 2007, Page(s): 1
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (193 KB) | HTML iconHTML

    We give a uniform method for automated reasoning in several types of extensions of ordered algebraic structures (definitional extensions, extensions with boundedness axioms or with monotonicity axioms). We show that such extensions are local and, hence, efficient methods for hierarchical reasoning exist in all these cases. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reading the Sampling Theorem in Multiple-Valued Logic: A Journey from the (Shannong) Sampling Theorem to the Shannon Decomposition Rule

    Publication Year: 2007, Page(s): 2
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB) | HTML iconHTML

    Signals described by functions of continuous and discrete variables can be uniformly studied in a group theoretic framework. This paper presents a consideration which shows that in the case of multiple-valued (MV) functions, the notion of bandwidth relates to the concept of essential variables. Sampling conditions convert into requirements for periodicity and regularity in the truth-vectors of MV ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-Characterizing Formulas and Normal Forms in Godel Logics

    Publication Year: 2007, Page(s): 3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    This paper focuses on three kinds of normal forms: the weak conjunctive normal form, the weak disjunctive normal form and the weak implicational normal form. The existence of these normal forms in Godel logics is investigated, and two kinds of reduction methods for them are presented, one of which is based on model-characterizing formulas and the other on rewriting systems. As byproducts of these ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectral Analysis of Special Properties of Ternary Functions

    Publication Year: 2007, Page(s): 4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (357 KB) | HTML iconHTML

    This paper shows that particular classes of linear combinations of the coefficients of the circular Chrestenson-Vilenkin spectrum of ternary functions characterize whether cofactors of the function are constant or balanced. These results may be applied to take decisions related to hardware implementations or to simplify ternary decision diagrams. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representations of Elementary Functions Using Edge-Valued MDDs

    Publication Year: 2007, Page(s): 5
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (219 KB) | HTML iconHTML

    This paper proposes a method to represent elementary functions such as trigonometric, logarithmic, square root, and reciprocal functions using edge-valued multi-valued decision diagrams (EVMDDs). We introduce a new class of integer functions, Mp-monotone increasing functions, and derive an upper bound on the number of nodes in an edge-valued binary decision diagram (EVBDD) for the Mp-monotone incr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experimental Studies on SAT-Based ATPG for Gate Delay Faults

    Publication Year: 2007, Page(s): 6
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (190 KB) | HTML iconHTML

    The clock rate of modern chips is still increasing and at the same time the gate size decreases. As a result, already slight variations during the production process may cause a functional failure. Therefore, dynamic fault models like the gate delay fault model are becoming more important. Meanwhile classical algorithms for test pattern generation reach their limits regarding run time and memory n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomials as Generators of Minimal Clones

    Publication Year: 2007, Page(s): 7
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (150 KB) | HTML iconHTML

    A minimal clone is an atom of the lattice of clones. A minimal function is a function which generates a minimal clone. We consider the base set with k elements, for a prime k, as a finite field and treat functions as polynomials. Starting from binary minimal functions over GF(3), we generalize some of them and obtain binary minimal functions, as polynomials, over GF(k) for any prime k ges 3. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Restriction-Closed Hyperclones

    Publication Year: 2007, Page(s): 8
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (226 KB) | HTML iconHTML

    The sets of multi-valued operations closed with respect to compositions and restrictions, called restriction- closed hyperclones, defined on the finite set E(k)={0, 1,..., k-1} (kges2) are investigated. The set of all maximal restriction-closed pre-hyperclones (composition without projections) is obtained. Based on it the analogue of Slupecki completeness criteria in restriction-closed pre-hypercl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monoidal Intervals of Partial Clones

    Publication Year: 2007, Page(s): 9
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB) | HTML iconHTML

    Let 2 = {0,1} and let M be a monoid on 2. The monoidal interval determined by M is the set of all partial clones on 2 whose foundation is M. We study monoidal intervals determined by several monoids on 2. Among other things, we show that if M is a monoid of total functions and contains a non-trivial unary function on 2, then the monoidal interval determined by M consists of total clones on 2. More... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variable Reordering and Sifting for QMDD

    Publication Year: 2007, Page(s): 10
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (227 KB) | HTML iconHTML

    This paper considers variable reordering for quantum multiple-valued decision diagrams (QMDD) used to represent the matrices describing reversible and quantum gates and circuits. An efficient method for adjacent variable interchange is presented and this method is employed to implement sifting of QMDDs. Experimental results are presented showing the effectiveness of the proposed techniques. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GF(4) Based Synthesis of Quaternary Reversible/Quantum Logic Circuits

    Publication Year: 2007, Page(s): 11
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB) | HTML iconHTML

    Galois field sum of products (GFSOP) has been found to be very promising for reversible/quantum implementation of multiple-valued logic. In this paper, we show ten quaternary Galois field expansions, using which quaternary Galois field decision diagrams (QGFDD) can be constructed. Flattening of the QGFDD generates quaternary GFSOP (QGFSOP). These QGFSOP can be implemented as cascade of quaternary ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Generalization of the Deutsch-Jozsa Algorithm to Multi-Valued Quantum Logic

    Publication Year: 2007, Page(s): 12
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (203 KB) | HTML iconHTML

    We generalize the binary Deutsch-Jozsa algorithm to n- valued logic using the quantum Fourier transform. Our algorithm is not only able to distinguish between constant and balanced Boolean functions in a single query, but can also find closed expressions for classes of affine functions in quantum oracles, accurate to a constant term. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Genetic Code as a Multiple-Valued Function and Its Implementation Using Multilayer Neural Network Based on Multi-Valued Neurons

    Publication Year: 2007, Page(s): 13
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (257 KB) | HTML iconHTML

    The genetic code is the four-letter nucleic acid code, and it is translated into a 20-letter amino acid code from proteins (each of 20 amino acids is coded by the triplet of four nucleic acids). Thus, it is possible to consider the genetic code as a partially defined multiple-valued function of a 20-valued logic. It is shown in the paper that a model of multiple-valued logic over the field of comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-deterministic Multi-valued Matrices for First-Order Logics of Formal Inconsistency

    Publication Year: 2007, Page(s): 14
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (183 KB) | HTML iconHTML

    Paraconsistent logic is the study of contradictory yet non-trivial theories. One of the best-known approaches to designing useful paraconsistent logics is da Costa's approach, which has led to the family of logics of formal inconsistency (LFIs), where the notion of inconsistency is expressed at the object level. In this paper we use non- deterministic matrices, a generalization of standard multiva... View full abstract»

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