期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
An Improved GA for Combinational Logic Expressions
1
作者 Kang Lishan He Wei 《Wuhan University Journal of Natural Sciences》 CAS 1998年第1期17-20,共4页
This paper discusses complete binary trees as chromosomes of Genetic Algorithm (GA), and proposes the concept of dominant and recessive genes. On the base of it, a new crossover operator with the selective ability was... This paper discusses complete binary trees as chromosomes of Genetic Algorithm (GA), and proposes the concept of dominant and recessive genes. On the base of it, a new crossover operator with the selective ability was designed. Finally experimental results are presented. 展开更多
关键词 GA dominant gene recessive gene combinational logic expression
下载PDF
Logic and logic-based control 被引量:6
2
作者 Hongsheng QI Daizhan CHENG 《控制理论与应用(英文版)》 EI 2008年第1期26-36,共11页
This paper gives a matrix expression of logic. Under the matrix expression, a general description of the logical operators is proposed. Using the semi-tensor product of matrices, the proofs of logical equivalences, im... This paper gives a matrix expression of logic. Under the matrix expression, a general description of the logical operators is proposed. Using the semi-tensor product of matrices, the proofs of logical equivalences, implications, etc., can be simplified a lot. Certain general properties are revealed. Then, based on matrix expression, the logical operators are extended to multi-valued logic, which provides a foundation for fuzzy logical inference. Finally, we propose a new type of logic, called mix-valued logic, and a new design technique, called logic-based fuzzy control. They provide a numerically computable framework for the application of fuzzy logic for the control of fuzzy systems. 展开更多
关键词 Semi-tensor product Matrix expression of logic Mix-valued logic Logic-based fuzzy control
下载PDF
The Expressibility of First Order Dynamic Logic
3
作者 付斌 李琼章 《Journal of Computer Science & Technology》 SCIE EI CSCD 1992年第3期268-273,共6页
This paper resolved an open problem proposed by A .P. Stolboushkin and M .A. Taitslin. We studied the expressibility of first order dynamic logic, and constructed infinite recursive program classes K_1 , K_2, …, RG ... This paper resolved an open problem proposed by A .P. Stolboushkin and M .A. Taitslin. We studied the expressibility of first order dynamic logic, and constructed infinite recursive program classes K_1 , K_2, …, RG K_1 K_2 … RF, such that L (RG)<L (K_1)<L (K_2) < … < L (RF), where RG, RF are regular program class and finitely generated recursively enumerable program class respectively, and L (K) is the first order dynamic logic of program class K. 展开更多
关键词 CASE The Expressibility of First Order Dynamic Logic
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部