Scheduled System Maintenance
On Saturday, October 21, single article sales and account management will be unavailable until 6 PM ET.

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

Filter Results

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

Publication Year: 1996
| PDF (410 KB)
• Author index

Publication Year: 1996
| PDF (58 KB)
• From pure to approximate logic

Publication Year: 1996, Page(s):148 - 152
| | PDF (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»

• Family of fast mixed arithmetic logic transforms for multiple-valued input binary functions

Publication Year: 1996, Page(s):24 - 29
Cited by:  Papers (3)
| | PDF (488 KB)

A family of mixed arithmetic logic whose transform matrices possess fast algorithms is introduced. The mixed arithmetic transforms are applied to multiple-valued input binary functions. The paper describes basic properties and lists those mixed arithmetic transforms which have fast forward and easily defined inverse transforms. Finally, the advantages of mixed arithmetic logic spectra for some mul... View full abstract»

• Multiple-valued decision diagrams with symmetric variable nodes

Publication Year: 1996, Page(s):242 - 247
Cited by:  Papers (8)
| | PDF (520 KB)

Symmetry is an important property of logic functions. In this paper, we introduce symmetric variable nodes, and investigate how they can be used to advantage in decision diagrams. We consider totally-symmetric and partially-symmetric functions as well as functions with partial symmetries. The identification of symmetric variable nodes is investigated as is the uniqueness of the resulting represent... View full abstract»

• On the contributions of Helena Rasiowa to mathematical logic

Publication Year: 1996
| | PDF (96 KB)

Summarizes the central aspects of the contributions of Helena Rasiowa (1917-1994) to the more traditional or classical part of Mathematical Logic. One could reasonably argue that all her original research properly belongs to Mathematical Logic, more precisely to the sub-field of Algebraic Logic. As a natural consequence of her previous work on non-classical logics, in the seventies she began to st... View full abstract»

• New interpolation algorithms for multiple-valued Reed-Muller forms

Publication Year: 1996, Page(s):16 - 23
Cited by:  Papers (1)
| | PDF (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»

• Design of highly parallel linear digital circuits based on symbol-level redundancy

Publication Year: 1996, Page(s):104 - 109
Cited by:  Papers (3)
| | PDF (436 KB)

In the non-linear digital system, it is difficult to design systematically highly parallel digital circuits whose output digit depends on a small number of input digits. On the other hand, the concept of linearity in digital systems is very attractive because analytical methods can be utilized to design highly parallel circuits. One of the most important problems in the design is to transform an o... View full abstract»

• Multi-valued decoder based on resonant tunneling diodes in current tapping mode

Publication Year: 1996, Page(s):230 - 234
Cited by:  Papers (8)
| | PDF (364 KB)

A multiple valued decoder based on RTDs is proposed and the functionality is verified via both simulation and experiment. The proposed circuit is simulated and tested with several single peaked RTD sections connected in series (stacked RTDs). The design uses current tapping techniques to switch on only one RTD section exclusively in order to create a single literal function. The number of RTD sect... View full abstract»

• Approximative conjunctions processing by multi-valued logic

Publication Year: 1996, Page(s):130 - 135
Cited by:  Papers (1)
| | PDF (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»

• An algebraic approach to hyperalgebras

Publication Year: 1996, Page(s):203 - 207
Cited by:  Papers (18)
| | PDF (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»

• A literal gate using resonant-tunneling devices

Publication Year: 1996, Page(s):68 - 73
Cited by:  Papers (7)
| | PDF (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»

• Polynomial completeness criteria in finite Boolean algebras

Publication Year: 1996, Page(s):262 - 266
| | PDF (424 KB)

For a given finite Boolean algebra with r(r⩾2) atoms we consider the set BF(r) of all polynomials produced by superpositions of the main operations and r atomic constants. Using the isomorphism between BF(r) and P, the arity-calibrated product of r two-valued logic algebras P2, and also the description of all maximal subalgebras of P2r, we establish a general c... View full abstract»

• Helena Rasiowa-a view of the academic trajectory and the influence upon Polish and international scientific community

Publication Year: 1996, Page(s):144 - 146
| | PDF (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»

• Verification of multi-valued logic networks

Publication Year: 1996, Page(s):10 - 15
Cited by:  Papers (10)
| | PDF (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»

• New MVL-PLA structures based on current-mode CMOS technology

Publication Year: 1996, Page(s):98 - 103
Cited by:  Papers (5)
| | PDF (440 KB)

Programmable logic arrays (PLAs) are being used to implement complex multi-valued logic (MVL) circuits. In this paper we introduce three new current-mode CMOS MVL-PLA structures for the implementation of MVL functions. These PLA structures use four current-mode CMOS building blocks namely, cycle, min, tsum and constants. Comparison between the introduced architectures is made based on their respec... View full abstract»

• Quaternary universal-literal CAM for cellular logic image processing

Publication Year: 1996, Page(s):224 - 229
Cited by:  Papers (3)
| | PDF (416 KB)

A new quaternary content-addressable memory (CAM) is proposed for cellular logic image processing. A universal literal in CAM cell is used to compare a quaternary input value with various template patterns simultaneously. The universal-literal cell circuit with quaternary data storage capability can be implemented by just four floating-gate MOS transistors, since the cell function is performed by ... View full abstract»

• The incidence propagation method

Publication Year: 1996, Page(s):124 - 129
| | PDF (476 KB)

Incidence calculus is a probabilistic logic developed from propositional logic which associates probabilities with sets of possible worlds rather than with formulae directly. The probability of a formula is defined as the probability of the set of possible worlds in which this formula is true. This set of possible worlds is named as the incidence set of this formula. So the task of calculating pro... View full abstract»

• Low-energy logic circuit techniques for multiple valued logic

Publication Year: 1996, Page(s):86 - 90
Cited by:  Papers (2)  |  Patents (1)
| | PDF (452 KB)

Multiple valued logic (MVL) has been proposed as a means for reducing the power, improving the speed, and increasing the packing density of VLSI circuits. These performance improvements are achieved by designers who identify signal processing functions that can benefit from the design tradeoffs possible with MVL. Since advocates of MVL are accustomed to incorporating the possible tradeoffs of MVL ... View full abstract»

• Weight structures for approximate reasoning with weighted expressions

Publication Year: 1996, Page(s):178 - 183
Cited by:  Papers (1)
| | PDF (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»

• Petri net representation of fuzzy reasoning under incomplete information

Publication Year: 1996, Page(s):172 - 177
Cited by:  Papers (1)
| | PDF (400 KB)

In this paper we present an algorithm that performs reasoning processes on fuzzy knowledge bases with chaining between rules. The algorithm we propose permits obtaining valid inferences even in situations where part of the variables in the knowledge base are unknown. The support for the description of the execution algorithm is provided by the Petri net formalism, which organizes in a convenient w... View full abstract»

• Wave-parallel computing technique for neural networks based on amplitude-modulated waves

Publication Year: 1996, Page(s):210 - 215
Cited by:  Papers (3)
| | PDF (444 KB)

Wave-parallel computing (WPC) technique is proposed to address the interconnection problem in massively interconnected VLSI architectures required for implementing artificial neural networks. The fundamental concepts are frequency multiplexing of signals on a single line, and their wave-parallel processing without decomposition. This paper discusses the realization of a Hopfield-type fully connect... View full abstract»

• Design of one-vector testable binary systems based on ternary logic

Publication Year: 1996, Page(s):62 - 66
| | PDF (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»

• DT-an automated theorem prover for multiple-valued first-order predicate logics

Publication Year: 1996, Page(s):284 - 289
| | PDF (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»

• Associativeness versus recursiveness

Publication Year: 1996, Page(s):154 - 159
Cited by:  Papers (1)
| | PDF (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»