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

33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.最新文献

筛选
英文 中文
On intervals of partial clones of Boolean partial functions 布尔偏函数的偏克隆的区间
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-05-16 DOI: 10.1109/ISMVL.2003.1201423
L. Haddad, G. Simons
{"title":"On intervals of partial clones of Boolean partial functions","authors":"L. Haddad, G. Simons","doi":"10.1109/ISMVL.2003.1201423","DOIUrl":"https://doi.org/10.1109/ISMVL.2003.1201423","url":null,"abstract":"We describe the interval of all partial clones that contain all monotonic idempotent Boolean partial functions as well as the interval of all partial clones that contain all idempotent self-dual Boolean partial functions.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121221810","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}
引用次数: 18
New logical and complexity results for Signed-SAT sign - sat新的逻辑和复杂性结果
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-05-16 DOI: 10.1109/ISMVL.2003.1201404
C. Ansótegui, F. Manyà
{"title":"New logical and complexity results for Signed-SAT","authors":"C. Ansótegui, F. Manyà","doi":"10.1109/ISMVL.2003.1201404","DOIUrl":"https://doi.org/10.1109/ISMVL.2003.1201404","url":null,"abstract":"We define Mv-formulas as the union of the subclasses of signed CNF formulas known as regular and monosigned CNF formulas, and then define resolution calculi that are refutation complete for Mv-formulas and give new complexity results for the Horn-SAT and 2-SAT problems. Our goal is to use Mv-formulas as a constraint programming language between CSP and SAT, and solve computationally difficult combinatorial problems with efficient satisfiability solvers for Mv-formulas. The results presented in this paper provide evidence that Mv-formulas are a problem modeling language that offers a good compromise between complexity and expressive power.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115802243","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
Efficient minimization of multiple-valued decision diagrams for incompletely specified functions 不完全指定函数的多值决策图的高效最小化
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-05-16 DOI: 10.1109/ISMVL.2003.1201412
D. Popel, R. Drechsler
{"title":"Efficient minimization of multiple-valued decision diagrams for incompletely specified functions","authors":"D. Popel, R. Drechsler","doi":"10.1109/ISMVL.2003.1201412","DOIUrl":"https://doi.org/10.1109/ISMVL.2003.1201412","url":null,"abstract":"This paper addresses the problem of finding a small size Multiple-Valued Decision Diagram (MDD) representation of an incompletely specified multiple-valued function. Optimal MDD representation improves performance and flexibility of many applications in logic design and multiple-valued circuit synthesis. We introduce an algorithm which incorporates a new operation on incompletely specified MDDs, called fusion. The diagram is optimized by dynamic variable ordering, graph compaction and minimization. During the optimization the structure of the underlying MDD is modified in a way that only specified values are represented while don't cares are ignored. The results on multiple-valued as well as binary benchmarks with don't cares are given to demonstrate the efficiency and robustness of the algorithm.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130126640","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}
引用次数: 8
On the average path length in decision diagrams of multiple-valued functions 多值函数决策图的平均路径长度
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-05-16 DOI: 10.1109/ISMVL.2003.1201432
J. T. Butler, Tsutomu Sasao
{"title":"On the average path length in decision diagrams of multiple-valued functions","authors":"J. T. Butler, Tsutomu Sasao","doi":"10.1109/ISMVL.2003.1201432","DOIUrl":"https://doi.org/10.1109/ISMVL.2003.1201432","url":null,"abstract":"We consider the path length in decision diagrams for multiple-valued functions. This is an important measure of a decision diagram, since this models the time needed to evaluate the function. We focus on the average path length (APL), which is the sum of the path lengths over all assignments of values to the variables divided by the number of assignments. First, we show a multiple-valued function in which the APL is markedly affected by the order of variables. We show upper and lower bounds on the longest path length in a decision diagram of a multiple-valued function. Next, we derive the APL for individual functions, the MAX, ALL-MAX, and MODSUM functions. We show that the latter two functions achieve the lower and upper bound on the APL overall n-variable r-valued functions. Finally, we derive the average of the APL for two sets of functions, symmetric functions and all functions.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127035170","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
Several remarks on non-boolean functions over boolean algebras 关于布尔代数上非布尔函数的几点注记
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-05-16 DOI: 10.1109/ISMVL.2003.1201401
D. Simovici
{"title":"Several remarks on non-boolean functions over boolean algebras","authors":"D. Simovici","doi":"10.1109/ISMVL.2003.1201401","DOIUrl":"https://doi.org/10.1109/ISMVL.2003.1201401","url":null,"abstract":"We investigate characterizations of n-argument Boolean functions in the class of functions defined on Boolean algebras and we extend our previous results centered around the approximation of non-Boolean functions by Boolean functions. We also generalize of the notions of upper and lower semi-Boolean functions to the case of n-variable functions.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121552804","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}
引用次数: 3
Characterization of the axiomatizable prenex fragments of first-order godel logics 一阶哥德逻辑的公理化前缀片段的表征
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-03-02 DOI: 10.1109/ISMVL.2003.1201403
M. Baaz, N. Preining, R. Zach
{"title":"Characterization of the axiomatizable prenex fragments of first-order godel logics","authors":"M. Baaz, N. Preining, R. Zach","doi":"10.1109/ISMVL.2003.1201403","DOIUrl":"https://doi.org/10.1109/ISMVL.2003.1201403","url":null,"abstract":"The prenex fragments of first-order infinite-valued Godel logics are classified. It is shown that the prenex Godel logics characterized by finite and by uncountable subsets of [0, 1] are axiomatizable, and that the prenex fragments of all countably infinite Godel logics are not axiomatizable.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128205569","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}
引用次数: 14
Dynamic reliability indices for multi-state system 多状态系统的动态可靠性指标
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-01-01 DOI: 10.1080/1726037X.2003.10698472
E. Zaitseva
{"title":"Dynamic reliability indices for multi-state system","authors":"E. Zaitseva","doi":"10.1080/1726037X.2003.10698472","DOIUrl":"https://doi.org/10.1080/1726037X.2003.10698472","url":null,"abstract":"The Multi-State System reliability is investigated in this paper. The new class of Reliability Indices is obtained. We have called these indices as Dynamic Reliability Indices. These indices estimate influence upon the Multi-State System reliability by the capacity levels of a system component. The Multiple-Valued Logic mathematical tools are used for calculation of Dynamic Reliability Indices.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115639852","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}
引用次数: 19
Proceedings 33rd International Symposium on Multiple-Valued Logic 第33届多值逻辑国际学术研讨会论文集
33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 1900-01-01 DOI: 10.1109/ISMVL.2003.1201374
{"title":"Proceedings 33rd International Symposium on Multiple-Valued Logic","authors":"","doi":"10.1109/ISMVL.2003.1201374","DOIUrl":"https://doi.org/10.1109/ISMVL.2003.1201374","url":null,"abstract":"The following topics are dealt with: multiple-valued logic functions; logic design; functional expressions; fuzzy logic; LSI design; decision diagrams; LSI circuits; nanotechnology; clone theory; spectral transforms; Boolean functions.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129370517","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
首页 上一页
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学术官方微信