Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Moataz El-Zekey"'
Publikováno v:
Circulation in Computer Science. 2:40-52
In this paper, we prove that all odd sequential graphs are mean graphs, but not all mean graphs are an odd sequential graph. We show that some new families generated by some graph operations on some standard graphs are admitting mean labeling and odd
Publikováno v:
Fuzzy Sets and Systems. 292:215-241
EQ-algebras are meet semilattices endowed with two additional binary operations: fuzzy equality and multiplication. These algebras serve as a basic algebraic structure of truth values for many-valued logics based on (fuzzy) equality instead of implic
Publikováno v:
International Journal of Approximate Reasoning. 54:132-148
There is no established formal framework for expert systems based on weighted IF-THEN rules. We discuss three mathematical models that have been recently proposed by the authors for CADIAG-2-a well-known system of this kind. The three frameworks are
Publikováno v:
Fuzzy Sets and Systems. 178:1-23
A special algebra called EQ-algebra has been recently introduced by Vilem Novak. Its original motivation comes from fuzzy type theory, in which the main connective is fuzzy equality. EQ-algebras have three binary operations - meet, multiplication, an
Autor:
Moataz El-Zekey
Publikováno v:
Soft Computing. 14:1011-1023
Recently, a special algebra called EQ-algebra (we call it here commutative EQ-algebra since its multiplication is assumed to be commutative) has been introduced by Novak (Proceedings of the Czech-Japan seminar, ninth meeting, Kitakyushu and Nagasaki,
Publikováno v:
Soft Computing. 13:1089-1097
We study the computational complexity of some axiomatic extensions of the monoidal t-norm based logic (MTL), namely NM corresponding to the logic of the so-called nilpotent minimum t-norm (due to Fodor in Fuzzy Sets Syst 69:141–156, 1995); and SMTL
Publikováno v:
Fuzzy Sets and Systems. 157:2030-2057
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at the construction of a complete predicate logic for prelinear tied adjoint
Publikováno v:
Fuzzy Sets and Systems. 157:647-669
A conjunction T ties an implication operator A if the identity A(a,A(b,z))=A(T(a,b),z) holds [A.A. Abdel-Hamid, N.N. Morsi, Associatively tied implications, Fuzzy Sets and Systems 136 (2003) 291-311]. We study the class of tied adjointness algebras (
Autor:
Moataz El-Zekey
Publikováno v:
Rough Sets and Knowledge Technology ISBN: 9783319117393
RSKT
RSKT
We investigate a general many-valued rough set theory, based on tied adjointness algebras, from both constructive and axiomatic approaches. The class of tied adjointness algebras constitutes a particularly rich generalization of residuated algebras a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a39ccb79ffb6b9a5d7ca27446c3818e4
https://doi.org/10.1007/978-3-319-11740-9_3
https://doi.org/10.1007/978-3-319-11740-9_3
Autor:
Moataz El-Zekey, Lluís Godo
Publikováno v:
Communications in Computer and Information Science ISBN: 9783642317149
IPMU (2)
IPMU (2)
In this paper we introduce a logic called FNG~(ℚ) that combines the well-known Godel logic with a strong negation, rational truth-constants and Possibilistic logic. In this way, we can formalize reasoning involving both vagueness and (possibilistic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee602cb3385e5d42151cb588e4a6c558
https://doi.org/10.1007/978-3-642-31715-6_24
https://doi.org/10.1007/978-3-642-31715-6_24