模糊/c切换函数个数的上界和下界

Proceedings. 1998 28th IEEE International Symposium on Multiple- Valued Logic (Cat. No.98CB36138) Pub Date : 1998-05-27 DOI:10.1109/ISMVL.1998.679473

H. Tatsumi, Tomoyuki Araki, M. Mukaidono, S. Tokumasu

{"title":"模糊/c切换函数个数的上界和下界","authors":"H. Tatsumi, Tomoyuki Araki, M. Mukaidono, S. Tokumasu","doi":"10.1109/ISMVL.1998.679473","DOIUrl":null,"url":null,"abstract":"This paper describes an estimation on the size of n-variable fuzzy switching functions with arbitrary constants (\"fuzzy/c\" for short). The whole set of fuzzy/c switching functions is divided into equivalence classes called c/sub r/-equivalent. Estimating the number of these functions in each equivalence class can be reduced to enumerating disjunctive forms of a binary switching function, which can be solved by enumerating anti-chains of the partially ordered set composed of simple phrases. Using an improved method for estimating the number of anti-chains, we can get upper and lower bounds on the number of n-variable fuzzy/c switching functions.","PeriodicalId":377860,"journal":{"name":"Proceedings. 1998 28th IEEE International Symposium on Multiple- Valued Logic (Cat. No.98CB36138)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Upper and lower bounds on the number of fuzzy/c switching functions\",\"authors\":\"H. Tatsumi, Tomoyuki Araki, M. Mukaidono, S. Tokumasu\",\"doi\":\"10.1109/ISMVL.1998.679473\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes an estimation on the size of n-variable fuzzy switching functions with arbitrary constants (\\\"fuzzy/c\\\" for short). The whole set of fuzzy/c switching functions is divided into equivalence classes called c/sub r/-equivalent. Estimating the number of these functions in each equivalence class can be reduced to enumerating disjunctive forms of a binary switching function, which can be solved by enumerating anti-chains of the partially ordered set composed of simple phrases. Using an improved method for estimating the number of anti-chains, we can get upper and lower bounds on the number of n-variable fuzzy/c switching functions.\",\"PeriodicalId\":377860,\"journal\":{\"name\":\"Proceedings. 1998 28th IEEE International Symposium on Multiple- Valued Logic (Cat. No.98CB36138)\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-05-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 1998 28th IEEE International Symposium on Multiple- Valued Logic (Cat. No.98CB36138)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.1998.679473\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 1998 28th IEEE International Symposium on Multiple- Valued Logic (Cat. No.98CB36138)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.1998.679473","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文描述了具有任意常数的n变量模糊切换函数(简称“fuzzy/c”)的大小估计。将整组模糊/c切换函数划分为等价类，称为c/sub / r/-等价类。估计每个等价类中这些函数的个数可以简化为枚举二元交换函数的析取形式，这可以通过枚举由简单短语组成的部分有序集合的反链来解决。利用一种改进的估计反链数的方法，得到了n变量模糊/c切换函数个数的上界和下界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Upper and lower bounds on the number of fuzzy/c switching functions

This paper describes an estimation on the size of n-variable fuzzy switching functions with arbitrary constants ("fuzzy/c" for short). The whole set of fuzzy/c switching functions is divided into equivalence classes called c/sub r/-equivalent. Estimating the number of these functions in each equivalence class can be reduced to enumerating disjunctive forms of a binary switching function, which can be solved by enumerating anti-chains of the partially ordered set composed of simple phrases. Using an improved method for estimating the number of anti-chains, we can get upper and lower bounds on the number of n-variable fuzzy/c switching functions.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. 1998 28th IEEE International Symposium on Multiple- Valued Logic (Cat. No.98CB36138)

自引率

0.00%

发文量