中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
On adequate sets of multi-valued logic *

文献类型:期刊论文

作者Cheng, Daizhan1,2; Feng, Jun-E1,3; Zhao, Jianli1; Fu, Shihua3
刊名JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS
出版日期2021-09-01
卷号358期号:13页码:6705-6722
ISSN号0016-0032
DOI10.1016/j.jfranklin.2021.07.003
英文摘要Searching a condensed adequate set of k-valued logic is a challenging problem. Using algebraic expression of logical functions, a normal form for k-valued logic was presented in Cheng et al. [3]. Starting from the normal form, searching adequate set of k-valued logic is converted to searching set of generators of their isomorphic matrix group/semigroup. Two adequate sets of k-valued logic are revealed, which consist of only 4 logical operators: one binary and three unary operators. These two adequate sets are uniformly defined for all k >= 3 . (c) 2021 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
WOS研究方向Automation & Control Systems ; Engineering ; Mathematics
语种英语
出版者PERGAMON-ELSEVIER SCIENCE LTD
WOS记录号WOS:000735658400015
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/59823]  
专题中国科学院数学与系统科学研究院
通讯作者Feng, Jun-E
作者单位1.Liaocheng Univ, Res Ctr Semitensor Prod Matrices Theory & Applica, Liaocheng, Shandong, Peoples R China
2.Chinese Acad Sci, Key Lab Syst & Control, AMSS, Beijing, Peoples R China
3.Shandong Univ, Sch Math, Jinan, Peoples R China
推荐引用方式
GB/T 7714
Cheng, Daizhan,Feng, Jun-E,Zhao, Jianli,et al. On adequate sets of multi-valued logic *[J]. JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS,2021,358(13):6705-6722.
APA Cheng, Daizhan,Feng, Jun-E,Zhao, Jianli,&Fu, Shihua.(2021).On adequate sets of multi-valued logic *.JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS,358(13),6705-6722.
MLA Cheng, Daizhan,et al."On adequate sets of multi-valued logic *".JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS 358.13(2021):6705-6722.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。