Resolution of fuzzy relation equations (I) based on boolean-type implications
نویسندگان
چکیده
منابع مشابه
A note on "Resolution of fuzzy relation equations (I) based on Boolean-type implications"
This paper shows, by examples, that Lemma 2.1, Lemma 3.1, Corollary 3.1, Corollary 3.2, Theorem 3.1, Corollary 3.3, Theorem 3.3 and Lemma 4.1 in [Y. Luo, Resolution of fuzzy relation equation (I) based on Boolean-type implications, Comput. Math. Appl. 52 (2006) 421–428] about resolution of fuzzy relation equations based on Boolean-type implications, are false. We also point out that the solutio...
متن کاملFuzzy difference equations of Volterra type
In this work we introduce the notion of fuzzy volterra dierence equations and study the dynamicalproperties of some classes of this type of equations. We prove some comparison theorems for theseequations in terms of ordinary volterra dierence equations. Using these results the stability of thefuzzy nonlinear volterra dierence equations is investigated.
متن کاملFuzzy relation equations (I): the general and specialized solving algorithms
In this article, we develop a new method and an algorithm to solve a system of fuzzy relation equations. We first introduce a solution-base-matrix and then give a tractable mathematical logic representation of all minimal solutions. Next, we design a new universal algorithm to get them. Two simplification rules are found to simplify the solution-base-matrix. We show that a polynomial time algor...
متن کاملdesigning unmanned aerial vehicle based on neuro-fuzzy systems
در این پایان نامه، کنترل نرو-فازی در پرنده هدایت پذیر از دور (پهپاد) استفاده شده است ابتدا در روش پیشنهادی اول، کنترل کننده نرو-فازی توسط مجموعه اطلاعات یک کنترل کننده pid به صورت off-line آموزش دیده است و در روش دوم یک کنترل کننده نرو-فازی on-line مبتنی بر شناسایی سیستم توسط شبکه عصبی rbf پیشنهاد شده است. سپس کاربرد این کنترل کننده در پهپاد بررسی شده است و مقایسه ای ما بین کنترل کننده های معمو...
On the Resolution of Resultant Type Equations
Given an irreducible polynomial P ∈ Z[X] of degree at least three and 0 = a ∈ Z we are going to determine all those monic quadratic polynomials Q ∈ Z[X] satisfying Res(P, Q) = a. This is the first attempt for the complete resolution of resultant type equations. We illustrate our algorithm with a detailed example.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2006
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2006.03.023