Transitive Closures of Ternary Fuzzy Relations
نویسندگان
چکیده
Recently, we have introduced six types of composition ternary fuzzy relations. These compositions are close in spirit to the binary Based on these composition, several transitivity a relation and investigated their basic properties. In this paper, prove additional properties characterizations relation. Also, provide representation theorem for relations satisfying transitivity. Finally, focus problem closing with respect proposed
منابع مشابه
Transitive Closures of Binary Relations I
Transitive closures of binary relations and relations α with the property that any two α-sequences connecting two given elements are of the same length are investigated. Vyšetřuj́ı se tranzitivńı uzávěry binárńıch relaćı a relaćı α s vlastnost́ı, že každé dvě α-posloupnosti spojuj́ıćı dané dva prvky maj́ı stejnou délku. The present short note collects a few elementary observations concerning the tr...
متن کاملExecutable Transitive Closures of Finite Relations
We provide a generic work-list algorithm to compute the transitive closure of finite relations where only successors of newly detected states are generated. This algorithm is then instantiated for lists over arbitrary carriers and red black trees [1] (which are faster but require a linear order on the carrier), respectively. Our formalization was performed as part of the IsaFoR/CeTA project [2]...
متن کاملTransitive Closures of Binary Relations Ii
Transitive closures of the covering relation in semilattices are investigated. Vyšetřuj́ı se tranzitivńı uzávěry pokrývaćı relace v polosvazech. This very short note is an immediate continuation of [1]. We therefore refer to [1] as for terminology, notation, various remarks, further references, etc. 1. The covering relation in semilattices Throughout the note, let S = S(+) be a semilattice (i. e...
متن کاملTransitive Closure of Fuzzy Relations
In this paper X, Y denote non empty sets. Let X be a non empty set. Observe that every membership function of X is real-yielding. Let f , g be real-yielding functions. The predicate f ⊑ g is defined by: (Def. 1) dom f ⊆ dom g and for every set x such that x ∈ dom f holds f(x) ¬ g(x). Let X be a non empty set and let f , g be membership functions of X. Let us observe that f ⊑ g if and only if: (...
متن کاملPTIME Computation of Transitive Closures of Octagonal Relations
Computing transitive closures of integer relations is the key to finding precise invariants of integer programs. In this paper, we study difference bounds and octagonal relations and prove that their transitive closure is a PTIMEcomputable formula in the existential fragment of Presburger arithmetic. This result marks a significant complexity improvement, as the known algorithms have EXPTIME wo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2021
ISSN: ['1875-6883', '1875-6891']
DOI: https://doi.org/10.2991/ijcis.d.210607.001