In this paper the notion of rational fuzzy language is introduced, and a theorem is obtained: a fuzzy subset of Σ* is recognizable if and only if it′s rational. The result connects the rational fuzzy language with f...In this paper the notion of rational fuzzy language is introduced, and a theorem is obtained: a fuzzy subset of Σ* is recognizable if and only if it′s rational. The result connects the rational fuzzy language with fuzzy finite-state automaton language.展开更多
How to verify that a given fuzzy set A∈F(X *) is a fuzzy code? In this paper, an algorithm of test has been introduced and studied with the example of test. The measure notion for a fuzzy code and a precise form...How to verify that a given fuzzy set A∈F(X *) is a fuzzy code? In this paper, an algorithm of test has been introduced and studied with the example of test. The measure notion for a fuzzy code and a precise formulation of fuzzy codes and words have been discussed. sification:90K20,94D05.展开更多
Some concepts in Fuzzy Generalized Automata （FGA） are established. Then an important new algorithm which would calculate the minimal FGA is given. The new algorithm is composed of two parts： the first is called E-r...Some concepts in Fuzzy Generalized Automata （FGA） are established. Then an important new algorithm which would calculate the minimal FGA is given. The new algorithm is composed of two parts： the first is called E-reduction which contracts equivalent states, and the second is called RE-reduction which removes retrievable states. Finally an example is given to illuminate the algorithm of minimization.展开更多
The capability requirements of the command, control, communication, computing, intelligence, surveillance, reconnaissance （C41SR） systems are full of uncertain and vague information, which makes it difficult to mode...The capability requirements of the command, control, communication, computing, intelligence, surveillance, reconnaissance （C41SR） systems are full of uncertain and vague information, which makes it difficult to model the C41SR architecture. The paper presents an approach to modeling the capability requirements with the fuzzy unified modeling language （UML） and building domain ontologies with fuzzy description logic （DL）. The UML modeling constructs are extended according to the meta model of Depart- ment of Defense Architecture Framework to improve their domain applicability, the fuzzy modeling mechanism is introduced to model the fuzzy efficiency features of capabilities, and the capability requirement models are converted into ontologies formalized in fuzzy DL so that the model consistency and reasonability can be checked with a DL reasoning system. Finally, a case study of C41SR capability requirements model checking is provided to demonstrate the availability and applicability of the method.展开更多
A new algorithm for the knowledge discovery based on statistic inductionlogic is proposed, and the validity of the methods is verified by examples. The method is suitablefor a large range of knowledge discovery applic...A new algorithm for the knowledge discovery based on statistic inductionlogic is proposed, and the validity of the methods is verified by examples. The method is suitablefor a large range of knowledge discovery applications in the studying of causal relation,uncertainty knowledge acquisition and principal factors analyzing. The language filed description ofthe state space makes the algorithm robust in the adaptation with easier understandable results,which are isomotopy with natural language in the topologic space.展开更多
Fuzzy Turing machines are the formal models of fuzzy algorithms or fuzzy computations. In this paper we give several different formulations of fuzzy Turing machine, which correspond to nondeterministic fuzzy Turing ma...Fuzzy Turing machines are the formal models of fuzzy algorithms or fuzzy computations. In this paper we give several different formulations of fuzzy Turing machine, which correspond to nondeterministic fuzzy Turing machine using max-＊ composition for some t-norm＊ （or NFTM＊, for short）, nondeterministic fuzzy Turing machine （or NFTM）, deterministic fuzzy Turing machine （or DFTM）, and multi-tape versions of fuzzy Turing machines. Some distinct results compared to those of ordinary Turing machines are obtained. First, it is shown that NFTM＊, NFTM, and DFTM are not necessarily equivalent in the power of recognizing fuzzy languages if the t-norm＊ does not satisfy finite generated condition, but are equivalent in the approximation sense. That is to say, we can approximate an NFTM＊ by some NFTM with any given accuracy; the related constructions are also presented. The level characterization of fuzzy recursively enumerable languages and fuzzy recursive languages are exploited by ordinary r.e. languages and recursive languages. Second, we show that universal fuzzy Turing machine exists in the approximated sense. There is a universal fuzzy Turing machine that can simulate any NFTM＊ on it with a given accuracy.展开更多
Description logics （DLs） are widely employed in recent semantic web application systems. However, classical description logics are limited when dealing with imprecise concepts and roles, thus providing the motivatio...Description logics （DLs） are widely employed in recent semantic web application systems. However, classical description logics are limited when dealing with imprecise concepts and roles, thus providing the motivation for this work. In this paper, we present a type-2 fuzzy attributive concept language with complements （ALC） and provide its knowledge representation and reasoning algorithms. We also propose type-2 fuzzy web ontology language （OWL） to build a fuzzy ontology based on type- 2 fuzzy ALC and analyze the soundness, completeness, and complexity of the reasoning algorithms. Compared to type-1 fuzzy ALC, type-2 fuzzy ALC can describe imprecise knowledge more meticulously by using the membership degree interval. We implement a semantic search engine based on type-2 fuzzy ALC and carry out experiments on real data to test its performance. The results show that the type-2 fuzzy ALC can improve the precision and increase the number of relevant hits for imprecise information searches.展开更多
基金This subject is supported by National Natural Sciences Foundation of China ( 6980 30 0 7) and theYouth Science and Technology Foundation of UESTC( YF0 2 0 1 0 1 )
文摘In this paper the notion of rational fuzzy language is introduced, and a theorem is obtained: a fuzzy subset of Σ* is recognizable if and only if it′s rational. The result connects the rational fuzzy language with fuzzy finite-state automaton language.
基金Supported by National Natural Science Foundation of China(6980 30 0 7)
文摘How to verify that a given fuzzy set A∈F(X *) is a fuzzy code? In this paper, an algorithm of test has been introduced and studied with the example of test. The measure notion for a fuzzy code and a precise formulation of fuzzy codes and words have been discussed. sification:90K20,94D05.
基金Supported by Supported by National Natural Science Foundation of China (No.60074014)
文摘Some concepts in Fuzzy Generalized Automata （FGA） are established. Then an important new algorithm which would calculate the minimal FGA is given. The new algorithm is composed of two parts： the first is called E-reduction which contracts equivalent states, and the second is called RE-reduction which removes retrievable states. Finally an example is given to illuminate the algorithm of minimization.
文摘The capability requirements of the command, control, communication, computing, intelligence, surveillance, reconnaissance （C41SR） systems are full of uncertain and vague information, which makes it difficult to model the C41SR architecture. The paper presents an approach to modeling the capability requirements with the fuzzy unified modeling language （UML） and building domain ontologies with fuzzy description logic （DL）. The UML modeling constructs are extended according to the meta model of Depart- ment of Defense Architecture Framework to improve their domain applicability, the fuzzy modeling mechanism is introduced to model the fuzzy efficiency features of capabilities, and the capability requirement models are converted into ontologies formalized in fuzzy DL so that the model consistency and reasonability can be checked with a DL reasoning system. Finally, a case study of C41SR capability requirements model checking is provided to demonstrate the availability and applicability of the method.
基金[This work was financially supported by the National Natural Science Foundation of China (No. 69835001).]
文摘A new algorithm for the knowledge discovery based on statistic inductionlogic is proposed, and the validity of the methods is verified by examples. The method is suitablefor a large range of knowledge discovery applications in the studying of causal relation,uncertainty knowledge acquisition and principal factors analyzing. The language filed description ofthe state space makes the algorithm robust in the adaptation with easier understandable results,which are isomotopy with natural language in the topologic space.
基金the National Natural Science Foundation of China (Grant No.10571112)"TRAPOYT" of China and the National 973 Foundation Research Program (Grant No.2002CB312200)
文摘Fuzzy Turing machines are the formal models of fuzzy algorithms or fuzzy computations. In this paper we give several different formulations of fuzzy Turing machine, which correspond to nondeterministic fuzzy Turing machine using max-＊ composition for some t-norm＊ （or NFTM＊, for short）, nondeterministic fuzzy Turing machine （or NFTM）, deterministic fuzzy Turing machine （or DFTM）, and multi-tape versions of fuzzy Turing machines. Some distinct results compared to those of ordinary Turing machines are obtained. First, it is shown that NFTM＊, NFTM, and DFTM are not necessarily equivalent in the power of recognizing fuzzy languages if the t-norm＊ does not satisfy finite generated condition, but are equivalent in the approximation sense. That is to say, we can approximate an NFTM＊ by some NFTM with any given accuracy; the related constructions are also presented. The level characterization of fuzzy recursively enumerable languages and fuzzy recursive languages are exploited by ordinary r.e. languages and recursive languages. Second, we show that universal fuzzy Turing machine exists in the approximated sense. There is a universal fuzzy Turing machine that can simulate any NFTM＊ on it with a given accuracy.
基金Acknowledgements This work was supported by the National Natural Science Foundation of China （Grant Nos. 60873225, 60873083, and 70771043）, the National High Technology Research and Development Program of China （2007AA01Z403）, the Natural Science Foundation of Hubei Province （2009CDB298）, the Natural Science Foundation of Hubei Province for Distinguished Young Scholars （2008CDB351）, the Wuhan Youth Science and Technology Chenguang Program （200950431171）, the Open Foundation of State Key Laboratory of Software Engineering （SKLSE20080718）, the Innovation Fund of Huazhong University of Science and Technology （2010MS068, Q2009021）.
文摘Description logics （DLs） are widely employed in recent semantic web application systems. However, classical description logics are limited when dealing with imprecise concepts and roles, thus providing the motivation for this work. In this paper, we present a type-2 fuzzy attributive concept language with complements （ALC） and provide its knowledge representation and reasoning algorithms. We also propose type-2 fuzzy web ontology language （OWL） to build a fuzzy ontology based on type- 2 fuzzy ALC and analyze the soundness, completeness, and complexity of the reasoning algorithms. Compared to type-1 fuzzy ALC, type-2 fuzzy ALC can describe imprecise knowledge more meticulously by using the membership degree interval. We implement a semantic search engine based on type-2 fuzzy ALC and carry out experiments on real data to test its performance. The results show that the type-2 fuzzy ALC can improve the precision and increase the number of relevant hits for imprecise information searches.
