发布求助
文献互助 智能选刊 最新文献

Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96)最新文献

筛选
英文 中文
Approximative conjunctions processing by multi-valued logic 多值逻辑的近似连词处理
Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96) Pub Date : 1996-01-19 DOI: 10.1109/ISMVL.1996.508348
H. Akdag, M. Mokhtari
{"title":"Approximative conjunctions processing by multi-valued logic","authors":"H. Akdag, M. Mokhtari","doi":"10.1109/ISMVL.1996.508348","DOIUrl":"https://doi.org/10.1109/ISMVL.1996.508348","url":null,"abstract":"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 the observation, so that we can infer via the rule? We propose a method in order to express the neighbourhood degree between a rule and an observation evaluated on the same scale or on two different scales.","PeriodicalId":403347,"journal":{"name":"Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123813209","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
Polynomial completeness criteria in finite Boolean algebras 有限布尔代数中的多项式完备性准则
Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96) Pub Date : 1996-01-19 DOI: 10.1109/ISMVL.1996.508377
B. A. Romov
{"title":"Polynomial completeness criteria in finite Boolean algebras","authors":"B. A. Romov","doi":"10.1109/ISMVL.1996.508377","DOIUrl":"https://doi.org/10.1109/ISMVL.1996.508377","url":null,"abstract":"For a given finite Boolean algebra with r(r/spl ges/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 P/sub 2/, and also the description of all maximal subalgebras of P/sub 2//sup r/, we establish a general completeness criterion in BF(r), a Sheffer criterion for a single Boolean function to be a generating element in BF(r), and Slupecki type criterion in BF(r) as well.","PeriodicalId":403347,"journal":{"name":"Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130769223","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
On isomorphisms between the lattice of tolerance relations and lattices of clusterings 关于容差关系格与聚类格之间的同构
Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96) Pub Date : 1996-01-19 DOI: 10.1109/ISMVL.1996.508359
H. Thiele
{"title":"On isomorphisms between the lattice of tolerance relations and lattices of clusterings","authors":"H. Thiele","doi":"10.1109/ISMVL.1996.508359","DOIUrl":"https://doi.org/10.1109/ISMVL.1996.508359","url":null,"abstract":"By \"mathematical foundations of cluster analysis\" we understand the study of (one-to-one) correspondences between \"similarity relations\" on a given universe U and \"clusterings\" an U. From classical set theory such correspondences are well-known as bijections and lattice isomorphisms between the set and the lattice of all equivalence relations on a universe U and the set and the lattice of all partitions of U, respectively. In this paper we show that the lattice (even the complete atomistic boolean algebra) of all (crisp!) tolerance relations on U is isomorphic to the lattice (even the complete atomistic boolean algebra) of all subset closed strongly model-compact coverings of U, on the one hand, and to the lattice (even the complete atomistic boolean algebra) of all tolerance coverings, on the other hand.","PeriodicalId":403347,"journal":{"name":"Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131200228","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}
引用次数: 10
Propositional skew Boolean logic 命题偏斜布尔逻辑
Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96) Pub Date : 1996-01-19 DOI: 10.1109/ISMVL.1996.508334
R. Bignall, M. Spinks
{"title":"Propositional skew Boolean logic","authors":"R. Bignall, M. Spinks","doi":"10.1109/ISMVL.1996.508334","DOIUrl":"https://doi.org/10.1109/ISMVL.1996.508334","url":null,"abstract":"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.","PeriodicalId":403347,"journal":{"name":"Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128239763","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}
引用次数: 12
From pure to approximate logic 从纯逻辑到近似逻辑
Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96) Pub Date : 1996-01-19 DOI: 10.1109/ISMVL.1996.508352
Ton Sales
{"title":"From pure to approximate logic","authors":"Ton Sales","doi":"10.1109/ISMVL.1996.508352","DOIUrl":"https://doi.org/10.1109/ISMVL.1996.508352","url":null,"abstract":"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 reasons behind such a shift of emphasis and the invariant motivations she kept along her whole life are explored in this homage-rendering contribution.","PeriodicalId":403347,"journal":{"name":"Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129120027","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
The incidence propagation method 入射传播法
Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96) Pub Date : 1996-01-19 DOI: 10.1109/ISMVL.1996.508347
Weiru Liu
{"title":"The incidence propagation method","authors":"Weiru Liu","doi":"10.1109/ISMVL.1996.508347","DOIUrl":"https://doi.org/10.1109/ISMVL.1996.508347","url":null,"abstract":"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 probabilities of formulae relies on the task of obtaining incidence sets for formulae. In this paper, we present an approach for manipulating incidences in extended incidence calculus in the situation that, the language set is large. We will show how to decompose this large set into small, but coherent sets and then how to propagate incidences among these sets. In this way incidence sets can be calculated efficiently.","PeriodicalId":403347,"journal":{"name":"Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123345718","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
An algebraic approach to hyperalgebras 超代数的代数方法
Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96) Pub Date : 1996-01-19 DOI: 10.1109/ISMVL.1996.508374
I. Rosenberg
{"title":"An algebraic approach to hyperalgebras","authors":"I. Rosenberg","doi":"10.1109/ISMVL.1996.508374","DOIUrl":"https://doi.org/10.1109/ISMVL.1996.508374","url":null,"abstract":"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 the inclusion-isotone clones on P* (A). We introduce new notions of subuniverses, congruences and homomorphisms of hyperalgebras. Finally we raise a few natural problems concerning the lattice of inclusion-isotone clones on P*(A); in particular for the boolean case A={0, 1}.","PeriodicalId":403347,"journal":{"name":"Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114252555","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}
引用次数: 29
Quaternary universal-literal CAM for cellular logic image processing 元胞逻辑图像处理的第四元通用文字CAM
Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96) Pub Date : 1996-01-19 DOI: 10.1109/ISMVL.1996.508362
T. Hanyu, M. Arakaki, M. Kameyama
{"title":"Quaternary universal-literal CAM for cellular logic image processing","authors":"T. Hanyu, M. Arakaki, M. Kameyama","doi":"10.1109/ISMVL.1996.508362","DOIUrl":"https://doi.org/10.1109/ISMVL.1996.508362","url":null,"abstract":"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 simple threshold operations together with logic-value conversion. As a result, the effective cell area in the proposed CAM array is reduced to 32 percent in comparison with that in a corresponding binary CAM-based implementation.","PeriodicalId":403347,"journal":{"name":"Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128782838","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}
引用次数: 4
Testability of generalized multiple-valued Reed-Muller circuits 广义多值里德-穆勒电路的可测试性
Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96) Pub Date : 1996-01-19 DOI: 10.1109/ISMVL.1996.508336
E. Dubrova, J. Muzio
{"title":"Testability of generalized multiple-valued Reed-Muller circuits","authors":"E. Dubrova, J. Muzio","doi":"10.1109/ISMVL.1996.508336","DOIUrl":"https://doi.org/10.1109/ISMVL.1996.508336","url":null,"abstract":"The testability of generalized Reed-Muller circuits realizing m-valued functions in module m sum-of-product form, with m being a prime greater than two, is investigated. Two aspects of the problem are considered-the number of tests required for fault detection, and the generation of tests. We prove that just four tests are sufficient to detect all single stuck-at faults on internal lines in the circuit. Furthermore, this set of tests is independent of the function being realized and therefore universal. We give two alternative techniques for testing primary inputs-one by generating a test set of maximum length 2n, where n is the number of primary inputs and the other by adding to the circuit an extra multiplication mod m gate with an observable output to ensure that the four tests for internal lines also detect all single stuck-at faults on primary inputs.","PeriodicalId":403347,"journal":{"name":"Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126016938","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}
引用次数: 9
Several remarks on the complexity of set-valued switching functions 关于集值交换函数复杂性的几点注记
Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96) Pub Date : 1996-01-19 DOI: 10.1109/ISMVL.1996.508355
D. Simovici, C. Reischer
{"title":"Several remarks on the complexity of set-valued switching functions","authors":"D. Simovici, C. Reischer","doi":"10.1109/ISMVL.1996.508355","DOIUrl":"https://doi.org/10.1109/ISMVL.1996.508355","url":null,"abstract":"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 require a large number of Boolean components.","PeriodicalId":403347,"journal":{"name":"Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131406063","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}
引用次数: 2
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信