In order to study uncertainty reasoning and automatic reasoning with linguistic terms, in this paper, the set of basic linguistic truth values and the set of modifiers are defined, according to common sense; partially...In order to study uncertainty reasoning and automatic reasoning with linguistic terms, in this paper, the set of basic linguistic truth values and the set of modifiers are defined, according to common sense; partially orderings are defined on them. Based on it, a lattice implication algebra model L18 of linguistic terms is built; furthermore, its some basic properties are discussed.展开更多
In this peper, we reseach the following form of approximate reasoning.Ant 1: (If x1 is A1 and x2 is A2and… and xn is An then y is B) is t1.Ant 2: (x1 is A’1 and x2 is A’2 and… and xn is A’n) is t2.Cons: (y is。B...In this peper, we reseach the following form of approximate reasoning.Ant 1: (If x1 is A1 and x2 is A2and… and xn is An then y is B) is t1.Ant 2: (x1 is A’1 and x2 is A’2 and… and xn is A’n) is t2.Cons: (y is。B’) is ts.First we put forward two reasonable approximate reasoning principles, then, accordingg tO the two reasoning principles we construct a new kind of approximate reasoning methods. The bole idea which the new kind of approximate reasoning methods is that according to the strength p(A1(x1), …, An(xn) )→B (y) which A1(x1),…, An(xn) implicate B(y) and the degree of A’(x) approximates to A(x), we determine the upper limit and B’(y), then take a definite value B’(y) in between the upper limit and the lower limit, and make the reasoning method satisfied the two reasoning principles.展开更多
Compared with complementary metal–oxide semiconductor(CMOS), the resonant tunneling device(RTD) has better performances; it is the most promising candidate for next-generation integrated circuit devices. The universa...Compared with complementary metal–oxide semiconductor(CMOS), the resonant tunneling device(RTD) has better performances; it is the most promising candidate for next-generation integrated circuit devices. The universal logic gate is an important unit circuit because of its powerful logic function, but there are few function synthesis algorithms that can implement an n-variable logical function by RTD-based universal logic gates. In this paper, we propose a new concept, i.e., the truth value matrix. With it a novel disjunctive decomposition algorithm can be used to decompose an arbitrary n-variable logical function into three-variable subset functions. On this basis, a novel function synthesis algorithm is proposed, which can implement arbitrary n-variable logical functions by RTD-based universal threshold logic gates(UTLGs), RTD-based three-variable XOR gates(XOR3s), and RTD-based three-variable universal logic gate(ULG3s). When this proposed function synthesis algorithm is used to implement an n-variable logical function, if the function is a directly disjunctive decomposition one, the circuit structure will be very simple, and if the function is a non-directly disjunctive decomposition one, the circuit structure will be simpler than when using only UTLGs or ULG3s. The proposed function synthesis algorithm is straightforward to program, and with this algorithm it is convenient to implement an arbitrary n-variable logical function by RTD-based universal logic gates.展开更多
基金Supported by the National Natural Science Foundation of China ( No.60474022)the Specialized Research Fund for the Doctoral Program of Higher Education of China (No.20060613007)
文摘In order to study uncertainty reasoning and automatic reasoning with linguistic terms, in this paper, the set of basic linguistic truth values and the set of modifiers are defined, according to common sense; partially orderings are defined on them. Based on it, a lattice implication algebra model L18 of linguistic terms is built; furthermore, its some basic properties are discussed.
文摘In this peper, we reseach the following form of approximate reasoning.Ant 1: (If x1 is A1 and x2 is A2and… and xn is An then y is B) is t1.Ant 2: (x1 is A’1 and x2 is A’2 and… and xn is A’n) is t2.Cons: (y is。B’) is ts.First we put forward two reasonable approximate reasoning principles, then, accordingg tO the two reasoning principles we construct a new kind of approximate reasoning methods. The bole idea which the new kind of approximate reasoning methods is that according to the strength p(A1(x1), …, An(xn) )→B (y) which A1(x1),…, An(xn) implicate B(y) and the degree of A’(x) approximates to A(x), we determine the upper limit and B’(y), then take a definite value B’(y) in between the upper limit and the lower limit, and make the reasoning method satisfied the two reasoning principles.
基金supported by the Zhejiang Provincial Natural Science Foundation,China(No.LY15F010011)the National Natural Science Foundation of China(Nos.61771179,61471314,and 61271124)
文摘Compared with complementary metal–oxide semiconductor(CMOS), the resonant tunneling device(RTD) has better performances; it is the most promising candidate for next-generation integrated circuit devices. The universal logic gate is an important unit circuit because of its powerful logic function, but there are few function synthesis algorithms that can implement an n-variable logical function by RTD-based universal logic gates. In this paper, we propose a new concept, i.e., the truth value matrix. With it a novel disjunctive decomposition algorithm can be used to decompose an arbitrary n-variable logical function into three-variable subset functions. On this basis, a novel function synthesis algorithm is proposed, which can implement arbitrary n-variable logical functions by RTD-based universal threshold logic gates(UTLGs), RTD-based three-variable XOR gates(XOR3s), and RTD-based three-variable universal logic gate(ULG3s). When this proposed function synthesis algorithm is used to implement an n-variable logical function, if the function is a directly disjunctive decomposition one, the circuit structure will be very simple, and if the function is a non-directly disjunctive decomposition one, the circuit structure will be simpler than when using only UTLGs or ULG3s. The proposed function synthesis algorithm is straightforward to program, and with this algorithm it is convenient to implement an arbitrary n-variable logical function by RTD-based universal logic gates.
