It is given a new algorithm to compute a lower T-transitive approximation of a fuzzy relation that preserves symmetry. Given a reflexive and symmetric fuzzy relation, the new algorithm computes a T-indistinguishability that is contained in the fuzzy relation. It has been developed a C++ program that generates random symmetric fuzzy relations or random symmetric and reflexive fuzzy relations and...

For theoretical fuzzy control it is a well known strategy to transform a system of control rules into a system of relation equations. Because these systems of relation equations are not always solvable, solvability criteria and approximate solutions have been discussed. We reconsider some of the results in this field and extend them using more recent results on t-norm based fuzzy logics and on ...

In this paper I investigate the System of fuzzy relation equations with inf → composition. I compare this system with the system of fuzzy relation equations with sup − ∗-composition. The purpose of this contribution is to show that there are many things which are common for both systems with sup−∗ and inf →-composition operations. K e y w o r d s: System of fuzzy relation equations; sup − ∗-com...

First, Similarity Of Fuzzy Ontology Generation For Semantic Web, Fuzzy Formal Concept Analysis incorporates fuzzy logic into Formal Concept Analysis (FCA) to form a fuzzy concept lattice. The fuzzy ontology is an extension of the domain ontology for solving the uncertainty problems. Fuzzy Conceptual Clustering then constructs the concept hierarchy from the fuzzy concept lattice. Finally, Fuzzy ...

in this paper, we define the notions of fuzzy congruence relations and fuzzy convex subalgebras on a commutative residuated lattice and we obtain some related results. in particular, we will show that there exists a one to one correspondence between the set of all fuzzy congruence relations and the set of all fuzzy convex subalgebras on a commutative residuated lattice. then we study fuzzy...

Galois connection in crisp binary relations has proved to be useful for several applications in computer science. Unfortunately, data is not always presented as a crisp binary relation but may be composed of fuzzy values, thus forming a fuzzy binary relation. This paper aims at defining the notion of fuzzy galois connection corresponding to a fuzzy binary relation in two steps: firstly by defin...

the purpose of this study has been concretized in terms of impact of mobileadvertising on the purchase decision of the consumer and aimed to answer toresearch questions: which is the underlying structure of criteria in mobileadvertising? and which criteria are important for consumers in evaluatingmobile advertising? a sample of consumers in taiwan was surveyed and usingfuzzy judgment to determi...

The aim of this work is to study an essential property in the framework of fuzzy preference structures, which is the transitivity. In particular, we discuss the relationship between the transitivity of a fuzzy large preference relation R and the transitivity of the fuzzy strict preference relation P obtained from R when every pair of elements can be compared. We consider some of the most import...

Ontology is the basis of sharing and reusing knowledge on the Semantic Web, and ontology-based semantic retrieval is a hotspot of current research. Fuzzy ontology is an extension of domain ontology for solving the uncertainty problems. To represent fuzzy knowledge more effectively, this paper presents a new series of fuzzy ontology models that consists of fuzzy domain ontology and fuzzy linguis...