By Topic

Proceedings. The Nineteenth International Symposium on Multiple-Valued Logic

29-31 May 1989

Filter Results

Displaying Results 1 - 25 of 69
  • Proceedings. The Nineteenth International Symposium on Multiple-Valued Logic (Cat. No.89CH2751-6)

    Publication Year: 1989
    Request permission for commercial reuse | PDF file iconPDF (74 KB)
    Freely Available from IEEE
  • The probabilistic foundations of logic

    Publication Year: 1989
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (30 KB)

    Summary form only given, as follows. A conditional version of the Komolgoroff axioms for probability theory is developed, and it is shown that the resulting theory can serve as a formal semantics for any logic in which the notion of maximally consistent set is definable, provided the probability functions are defined over the power set of the maximally consistent sets. It is shown that the functio... View full abstract»

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

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

    A new type of algebra called medium algebra is introduced. The equational class M of all medium algebras is characterized. The relationships between medium algebras and other algebras are studied View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the application perspective of medium logic calculus (ML) and medium axiomatic set theory (MS)

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

    The author contends that the fifth generation of computers must be based on a new logic, i.e. intelligent logic which takes medium states into account. It is argued that medium logic calculus (ML) and medium axiomatic set theory (MS) can provide this foundation. It is suggested that ML and MS can provide a theoretical foundation for expert systems and advance the techniques of pattern recognition,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Medium algebra MA and medium propositional calculus MP*

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

    The author establishes an algebraic system, which is equivalent to the propositional calculus system of medium logic MP*, for research in algebraic characteristics of MP*. The algebraic system is called medium algebra (MA). It is derived from Boolean algebra and possesses many similar properties. Several properties possessed by MA are presented and used to show that MA is essentially a three-value... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Foundations of fuzzy logic programming and debugging

    Publication Year: 1989, Page(s):172 - 178
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    A theoretical foundation is provided for programming in fuzzy Horn logic and declarative debugging in fuzzy Horn logic programming. Particular emphasis is placed on the study of the soundness and completeness for both View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On basic groups in partial many-valued logics

    Publication Year: 1989, Page(s):284 - 287
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    Necessary and sufficient conditions are given for basic groups in partial many-valued logics, and all r-degree basic groups, r=0, . . ., k, are determined View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VLSI chip-architecture selection using reasoning based on fuzzy logic

    Publication Year: 1989, Page(s):165 - 171
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    A knowledge-based system is presented which carries out a design step in very large-scale integration (VLSI) chip synthesis, namely, VLSI chip-architecture selection. The system decides which VLSI chip-architecture scheme (i.e. a general architectural principle representing a class of chip architectures) best fits a list of architectural properties given as input to the system. However, the input ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved m-valued carry look-ahead adder

    Publication Year: 1989, Page(s):280 - 282
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    An m-valued version of H. Ling's (see IBM J. Res. Dev., vol.25, p.156-66 (1981)) adder is described. It is shown that the m -valued version shares the advantages of the original binary adder View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lattice valued pair-lattice valued logic theory and its applications to AI

    Publication Year: 1989, Page(s):146 - 149
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (136 KB)

    Lattice-valued pairs and lattice-valued pair statements are defined. Ordered pairs are used to portray the strength of rules, and suitable renewal formulas are given. Lattice-valued pairs and logic theory provide a new tool for imprecise inference View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hardware implementations of inference mechanisms in expert systems using continuous logic

    Publication Year: 1989, Page(s):210 - 215
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    The authors discuss hardware implementation of inference mechanisms in expert systems. Logic circuits performing certain forward chaining and approximate reasoning realized by using DYL, a multicell-type continuous logic, circuits are presented. The inference speed can be greatly improved using such inference engines, making real-time applications of expert systems possible. A successful applicati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The spectral technique in controllability/observability measures of digital circuits

    Publication Year: 1989, Page(s):100 - 106
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    With the rapid increase of IC size, the testability of ICs must be taken into account in their design phase, so that the testability measure of the circuit under design can be kept as low as possible before test generation. The problem of how to determine the testability measure of a circuit is discussed. Circuits are analyzed on a module level rather than a gate level. A technique is then given b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scales in `Zhou Yi' and `Tai Xuan'

    Publication Year: 1989, Page(s):160 - 162
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    `Zhou Yi' and `Tai Xuan' are two classic Chinese books, respectively containing two symbolic systems, Gua and Shou. Gua was judged by G.W. Leibniz to be a binary scale. It is claimed that Shou is a ternary digital symbolic system, and proofs demonstrating this are given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A proof of an omitting types theorem in lattice valued model theory

    Publication Year: 1989, Page(s):231 - 234
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    A proof is presented for an omitting types theorem in lattice-valued model theory. The theorem was announced by the author previously (see Proc. 18th Symposium on Multiple-value Logic, Palma de Mallorca (1988)) with proof View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prime and non-prime implicants in the minimization of multiple-valued logic functions

    Publication Year: 1989, Page(s):272 - 279
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    Minimal sum-of-products expressions for multiple-valued logic functions for realization by programmable logic arrays are investigated. The focus is on expressions where product terms consist of the MIN of interval literals on input variables and are combined using one of two operations, SUM or MAX. In binary logic, the question of whether or not prime implicants are sufficient to realize all funct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A P-ternary threshold element network-an application of ternary logic to a neural system treating ambiguity

    Publication Year: 1989, Page(s):137 - 143
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    An application of ternary logic to a neural system treating ambiguity is considered. A method to find a threshold function (a learning method) is proposed. Ternary logic functions with no information loss concerning ambiguity, called P-functions, are introduced. A neural element representing a P-function is considered, using the above learning method. A neural system using the P-type elements is d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Switched capacitor circuits in the implementation of multiple-valued logic

    Publication Year: 1989, Page(s):202 - 209
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    The discretized-analog nature of switched-capacitor (SC) technology has not been associated with multiple-valued logic (MVL) designs in any publication heretofore. The possibility of using SC technology for MVL circuit implementation is investigated, and attendant potential benefits are discussed. The circuit design of a novel SC MVL multiplier is proposed, and the direct realization of general MV... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fuzzy reasoning is the inverse of fuzzy implication

    Publication Year: 1989, Page(s):252 - 254
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    A fuzzy implication operation that is right intersection preserving and left anti-intersection is defined. The fuzzy reasoning operation is shown to be the right inverse operation of the fuzzy implication. Part of the approximate reasoning theory is given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • λ=paramodulation in operator logic

    Publication Year: 1989, Page(s):31 - 35
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    A λ-paramodulation to handle fuzzy equality is proposed. In conjunction with λ-resolution, λ-paramodulation can be used to prove fuzzy theorems in operator fuzzy logic. It is proved that λ-paramodulation is complete for the λ-inconsistent set of clauses, using λ-resolution View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ternary logic circuit for error detection and error correction

    Publication Year: 1989, Page(s):94 - 99
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    The binary logic system formed by a ternary logic circuit has error-detecting and error-correcting functions. A three-valued polar code and a ternary-logic error-detecting and error-correcting circuit for the data transmission system are presented. This data transmission system has powerful capability for detecting and correcting error, so the reliability of the data transmission improves greatly ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lattice valued model theory and its forcing

    Publication Year: 1989, Page(s):155 - 159
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    This is a continuation of a survey of results on the model theory of lattice-valued logic begun by S. Wang (see Int. Symp. Multivalued Logic, 1987). It covers finite forcing in lattice-valued model theory View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some brief considerations on the associativity degree of binary operators

    Publication Year: 1989, Page(s):228 - 230
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB)

    The associativity degree of a binary operator on [0,1] is defined, and some aspects of it are studied for a class of operators satisfying a Lipschitz condition. In particular, several results in the case of convex linear combination of a t-norm and its dual t-conorm are obtained View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of window comparator to majority operation

    Publication Year: 1989, Page(s):114 - 121
    Cited by:  Papers (5)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    A fail-safe majority operation circuit capable of immediately reporting faults by utilizing multiple-valued signals is proposed, and the concrete configuration of the fail-safe majority operation circuit is clarified. The fail-safe majority operation circuit is defined as a circuit that has majority operation output signals and fault inspection output signals, never produces an output signal 1 in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of multiple-valued logic to a serial decomposition of PLAs

    Publication Year: 1989, Page(s):264 - 271
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    A decomposition of a programmable logic array (PLA) into two cascaded PLAs is considered. The problem is divided into two subproblems: a partition problem, which finds the partition of the input variables, and an encoding problem, which finds an encoding of signals between two PLAs. Multiple-valued decomposition theory is used to find a good partition of the input variables. Experimental results s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Programmable realization of multi-valued multi-threshold functions using CCDs

    Publication Year: 1989, Page(s):42 - 53
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    An investigation is conducted of PLA (programmable logic array) structures for implementation of multivalued multithreshold functions using CCD (charge-coupled device) technology. A new PLA structure is introduced for this purpose. The structure is fully programmable at the user level. The relative merits of this PLA, with respect to the existing structures, are evaluated View full abstract»

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