نتایج جستجو برای: implication operator

تعداد نتایج: 128694  

1999
O. Cordón F. Herrera A. Peregrín

This paper deals with the problem of looking for the set of defuzzification method features allowing us to generate the most accurate fuzzy models in combination with each fuzzy implication operator. Hence, we try to find fuzzy inference engines that are appropriate from the practical engineering point of view. To do so, the three basic properties for fuzzy implication operators presented in [C...

Journal: :journal of linear and topological algebra (jlta) 0
m rashidi-kouchi young researchers and elite club kahnooj branch, islamic azad university, kerman, iran.

in this paper, we investigate duality of modular g-riesz bases and g-riesz basesin hilbert c*-modules. first we give some characterization of g-riesz bases in hilbert c*-modules, by using properties of operator theory. next, we characterize the duals of a giveng-riesz basis in hilbert c*-module. in addition, we obtain sucient and necessary conditionfor a dual of a g-riesz basis to be again a g...

Journal: :Axioms 2023

Three-way fuzzy inference is the theoretical basis of three-way control. The proposed TCRI method based on a Mamdani implication operator and uses one simple composition operation. In order to effectively improve method, this paper proposes full triple I algorithm for gives solution TFMP problem. emphasis our research R0 Go¨del solution, which related residual implication, as well Zadeh’s Mamda...

Journal: :Inf. Sci. 2010
Xiaohong Zhang Yiyu Yao Hong Yu

The role of topological De Morgan algebra in the theory of rough sets is investigated. The rough implication operator is introduced in strong topological rough algebra that is a generalization of classical rough algebra and a topological De Morgan algebra. Several related issues are discussed. First, the two application directions of topological De Morgan algebras in rough set theory are descri...

Journal: :The Journal of the Korean Institute of Information and Communication Engineering 2012

Journal: :Int. J. Approx. Reasoning 1998
Ignacio Rojas Olga Valenzuela Mancia Anguita Alberto Prieto

This paper analyzes the performance of some fuzzy implications proposed in the bibliography together with the operators needed for their definition and for the fuzzy inference process, Examining the specialized literature, it is clear that the selection of the best fuzzy implication operator has become one of the main question in the design of a fuzzy system, being occasionally contradictory (a...

Journal: :Fuzzy Sets and Systems 2012
Huawen Liu

In this paper, we study the relationships between left (right) semi-uninorms and implications on a complete lattice. We firstly discuss the residual operations of left and right semi-uninorms and show that the right (left) residual operator of a conjunctive right (left) ∨-distributive left (right) semi-uninorm is a right ∧-distributive implication that satisfies the neutrality principle. Then, ...

2017
Wanda Niemyska Michal Baczynski Szymon Wasowicz

A new family of fuzzy implications, motivated by classic Sheffer stroke operator, is introduced. Sheffer stroke, which is a negation of a conjunction and is called NAND as well, is one of the two operators that can be used by itself, without any other logical operators, to constitute a logical formal system. Classical implication can be presented just by Sheffer stroke operator in two ways whic...

Journal: :Fuzzy Sets and Systems 2000
Oscar Cordón Francisco Herrera Antonio Peregrín

This paper deals with the problem of searching basic properties for robust implication operators in fuzzy control. We use the word “robust” in the sense of good average behavior in different applications and in combination with different defuzzification methods. We study the behavior of the two main families of implication operators in the fuzzy control inference process. These two families are...

2009
Alexis Goyet Masami Hagiya Yoshinori Tanabe

In our previous study, we defined the semantics of modal μ-calculus on minplus algebra N∞ and developed a model-checking algorithm. N∞ is the set of all natural numbers and infinity (∞), and has two operations min and plus. In the semantics, disjunctions are interpreted by min and conjunctions by plus. This semantics allows interesting properties of a Kripke structure, such as the shortest path...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید