[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic最新文献

筛选
英文 中文
Proposed CMOS VLSI implementation of an electronic neuron using multivalued signal processing 提出了采用多值信号处理的CMOS VLSI实现电子神经元
B. Taheri
{"title":"Proposed CMOS VLSI implementation of an electronic neuron using multivalued signal processing","authors":"B. Taheri","doi":"10.1109/ISMVL.1991.130730","DOIUrl":"https://doi.org/10.1109/ISMVL.1991.130730","url":null,"abstract":"Several approaches to the hardware implementation of an electronic neuron are presented and compared. A hardware implementation of a neuron that uses a voltage-controlled input weights is introduced, and its simulated performance presented. This electronic neuron circuit is ideal for CMOS VLSI implementations of neural networks, because it merges, the advantages of analog and digital techniques. In addition, this pseudoanalog technique utilizes low power, high speed, and small area requirements for variety of applications.<<ETX>>","PeriodicalId":127974,"journal":{"name":"[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123134296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Topological soft algebra for the S5-modal fuzzy logic 5-模态模糊逻辑的拓扑软代数
A. Nakamura
{"title":"Topological soft algebra for the S5-modal fuzzy logic","authors":"A. Nakamura","doi":"10.1109/ISMVL.1991.130709","DOIUrl":"https://doi.org/10.1109/ISMVL.1991.130709","url":null,"abstract":"A topological fuzzy algebra is defined as a special case of topological soft algebra. This algebra system is obtained from the S5-modal fuzzy logic, which had been previously proposed. The soundness and completeness of this axiomatic system are proved.<<ETX>>","PeriodicalId":127974,"journal":{"name":"[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123801980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Improving tableau deductions in multiple-valued logics 改进多值逻辑中的表推理
Neil V. Murray, Erik Rosenthal
{"title":"Improving tableau deductions in multiple-valued logics","authors":"Neil V. Murray, Erik Rosenthal","doi":"10.1109/ISMVL.1991.130735","DOIUrl":"https://doi.org/10.1109/ISMVL.1991.130735","url":null,"abstract":"Path dissolution is an efficient generalization of the method of analytic tableaux. Both methods feature (in the propositional case) strong completeness, the lack of reliance upon conjunctive normal form (CNF), and the ability to produce a list of essential models (satisfying interpretations) of a formula. Dissolution can speed up every step in a tableau deduction in classical logic. The authors consider means for adapting both techniques to multiple-valued logics, and show that the speed-up theorem applies in this more general setting. These results are pertinent for modeling uncertainty and commonsense reasoning.<<ETX>>","PeriodicalId":127974,"journal":{"name":"[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124392801","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Spectral techniques for multiple valued logic circuits 多值逻辑电路的频谱技术
T. Damarla, Fiaz Hossain
{"title":"Spectral techniques for multiple valued logic circuits","authors":"T. Damarla, Fiaz Hossain","doi":"10.1109/ISMVL.1991.130753","DOIUrl":"https://doi.org/10.1109/ISMVL.1991.130753","url":null,"abstract":"Canonical representation of multiple valued logic (MVL) functions in any polarity k, k in (0, 1,. . .,p/sup n/ -1), where p is the radix and n denotes the number of variables in a function, was previously presented. The coefficients in a canonical representation are called the spectral coefficients. It is shown that for some MVL functions realizing them as sum of products may not be economical, especially if very few minterms can be combined. Such functions can be efficiently realized as mod-p sum of products in a polarity which provides fewer coefficients. Realization of MVL functions as mod-p sum of products is done using a set of gates which are functionally complete. Implementation of these gates is shown both in I/sup 2/L and CCD technologies. The computation complexity for estimating all the coefficients in the canonical representation is presented.<<ETX>>","PeriodicalId":127974,"journal":{"name":"[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132181986","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multiple-valued generalized Reed-Muller forms 多值广义Reed-Muller形式
Ingo Schäfer, M. Perkowski
{"title":"Multiple-valued generalized Reed-Muller forms","authors":"Ingo Schäfer, M. Perkowski","doi":"10.1109/ISMVL.1991.130703","DOIUrl":"https://doi.org/10.1109/ISMVL.1991.130703","url":null,"abstract":"The concept of canonical multiple-valued input generalized Reed-Muller forms (MIGRM), a direct extension of the well-known generalized Reed-Muller (GRM) forms for the logic with multiple-valued inputs, is introduced. Code normalization of single multiple-valued literals (MV-literal) to perform a final transformation is developed. The code normalization is used to make the transformation of the complete function independent on the polarity chosen. This simplifies and speeds up the main transformation step to the final restricted MIGRM form for the transformed single MV-literal. A computer program to realize the MIGRM transform for Boolean functions has been implemented. The direct circuit realization of MIGRMs as AND- EXOR programmable logic arrays with input decoders has excellent testability properties; they have applications to synthesis of other kinds of circuits with EXOR gates, such as the exclusive sums of products (ESOP), and they have image processing capabilities.<<ETX>>","PeriodicalId":127974,"journal":{"name":"[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127704166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
On the complexity of enumerations for multiple-valued Kleenean functions and unate functions 多值Kleenean函数和单值函数枚举的复杂性
Y. Hata, Masaharu Yuhara, F. Miyawaki, K. Yamato
{"title":"On the complexity of enumerations for multiple-valued Kleenean functions and unate functions","authors":"Y. Hata, Masaharu Yuhara, F. Miyawaki, K. Yamato","doi":"10.1109/ISMVL.1991.130705","DOIUrl":"https://doi.org/10.1109/ISMVL.1991.130705","url":null,"abstract":"Multiple-valued Kleenean functions are represented by multiple-valued AND, OR, NOT, variables and constants. In their previous work (see proc. of 20th Int. Symp. Multiple Valued Logic, IEEE, p.410-17, 1990), the authors pointed out that both mapping from Kleenean functions to some (3,p)-functions and mapping from unate functions to some (2,p)-functions are bijections. In this paper, by using the above relations, 3-up-to-7 valued Kleenean functions of 3-or-less variables are enumerated on a computer. Their exact numbers are tabulated. The results show that as p becomes larger, the number of p-valued Kleenean functions increases stepwise, and that of p-valued unate functions increases smoothly.<<ETX>>","PeriodicalId":127974,"journal":{"name":"[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115050027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Multiple peak resonant tunneling diode for multi-valued memory 用于多值存储器的多峰谐振隧道二极管
Sen Jung Wei, H. Lin
{"title":"Multiple peak resonant tunneling diode for multi-valued memory","authors":"Sen Jung Wei, H. Lin","doi":"10.1109/ISMVL.1991.130728","DOIUrl":"https://doi.org/10.1109/ISMVL.1991.130728","url":null,"abstract":"Several designs for a high-speed static random access multivalued memory using the folding characteristics of multiple peak resonant tunneling diodes (RTDs) are presented. The different designs are described and studied by comparing their power consumption under different conditions of device parameters and the switching speed. It is shown that the proposed memory cell using a pair of multiple-peak RTDs yields the best result from the standpoint of size, power dissipation, and speed.<<ETX>>","PeriodicalId":127974,"journal":{"name":"[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132109553","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Fundamental properties of Kleene-Stone logic functions Kleene-Stone逻辑函数的基本性质
N. Takagi, M. Mukaidono
{"title":"Fundamental properties of Kleene-Stone logic functions","authors":"N. Takagi, M. Mukaidono","doi":"10.1109/ISMVL.1991.130706","DOIUrl":"https://doi.org/10.1109/ISMVL.1991.130706","url":null,"abstract":"Kleene-Stone algebras have been proposed as an algebra with the properties of both Kleene algebra and Stone algebra. Therefore, they have connections with ambiguity and modality. A Kleene-Stone logic function is defined as a function F:","PeriodicalId":127974,"journal":{"name":"[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114664719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
An equational logic approach for mapping/multiple-valued rule-based expert systems into hardware specification rules 将/多值基于规则的专家系统映射到硬件规范规则的方程逻辑方法
D. Rine
{"title":"An equational logic approach for mapping/multiple-valued rule-based expert systems into hardware specification rules","authors":"D. Rine","doi":"10.1109/ISMVL.1991.130748","DOIUrl":"https://doi.org/10.1109/ISMVL.1991.130748","url":null,"abstract":"This research extends techniques for mapping rule-based expert systems into VLSI hardware design notation and provides design procedures for performing the mapping from expert system' production rules to hardware specification rules. Results from this work enhance the applicability of the rule-based expert system approach to a larger class of real-time and control applications.<<ETX>>","PeriodicalId":127974,"journal":{"name":"[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123833032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A multiple-valued logic array VLSI based on two-transistor delta literal circuit and its application to real-time reasoning systems 基于双晶体管增量文字电路的多值逻辑阵列VLSI及其在实时推理系统中的应用
T. Hanyu, Yasushi Kojima, T. Higuchi
{"title":"A multiple-valued logic array VLSI based on two-transistor delta literal circuit and its application to real-time reasoning systems","authors":"T. Hanyu, Yasushi Kojima, T. Higuchi","doi":"10.1109/ISMVL.1991.130699","DOIUrl":"https://doi.org/10.1109/ISMVL.1991.130699","url":null,"abstract":"A multiple-valued logic array VLSI for high-speed pattern matching is presented. Both input data and rules are represented by a single multiple-valued digit, so that pattern matching can be described by a multiple-valued delta-literal, in which thresholds correspond to content of a rule. Moreover, a multiple-valued pattern-matching cell can be implemented by only a pair of an NMOS and a PMOS transistors whose threshold voltages are programmed by multiple ion implants. It is demonstrated that the chip area and power dissipation of 8-valued logic array can be reduced to 30% and 50%, respectively, compared with corresponding binary implementation.<<ETX>>","PeriodicalId":127974,"journal":{"name":"[1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131503976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信