in this note by considering a complete lattice l, we define thenotion of an l-fuzzy hyperrelation on a given non-empty set x. then wedefine the concepts of (pom)l-fuzzy graph, hypergraph and subhypergroupand obtain some related results. in particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (pom)l-fuzzy subhypergroups ...

A constructively valid counterpart to Bourbaki’s Fixpoint Lemma for chaincomplete partially ordered sets is presented to obtain a condition for one closure system in a complete lattice L to be stable under another closure operator of L. This is then used to deal with coproducts and other aspects of frames.

the paper deals with special types of $l$-ordered sets, $l$-fuzzy complete lattices, and fuzzy directed complete posets.first, a theorem for constructing monotone maps is proved, a characterization for monotone maps on an $l$-fuzzy complete lattice is obtained, and it's proved that if $f$ is a monotone map on an $l$-fuzzy complete lattice $(p;e)$, then the least fixpoint of $f$ is meet of ...

Semantic Web data with annotations is becoming available, being YAGO knowledge base a prominent example. In this paper we present an approach to perform the closure of large RDF Schema annotated semantic web data using standard database technology. In particular, we exploit several alternatives to address the problem of computing transitive closure with real fuzzy semantic data extracted from Y...

in this paper, a numerical method for nding minimal solution of a mn fullyfuzzy linear system of the form ax = b based on pseudo inverse calculation,is given when the central matrix of coecients is row full rank or column fullrank, and where a~ is a non-negative fuzzy mn matrix, the unknown vectorx is a vector consisting of n non-negative fuzzy numbers and the constant b isa vector consisti...

In this paper ∗–compatible extensions of fuzzy relations are studied, generalizing some results obtained by Duggan in case of crisp relations. From this general result are obtained as particular cases fuzzy versions of some important extension theorems for crisp relations (Szpilrajn, Hansson, Suzumura). Two notions of consistent closure of a fuzzy relation are introduced.

There are fast known algorithms to compute the transitive closure of a fuzzy relation, but there are only a few different algorithms that compute T-transitive low approximations of a fuzzy relation. A fast method to compute a T-transitive low approximation of a reflexive and symmetric fuzzy relation is given for any continuous tnorm, spending O(n) time.

In this paper, we propose a generalized concept of openness and closedness with respect to arbitrary fuzzy relations, along with appropriate opening and closure operators. We will show that this framework includes the existing concept defined for fuzzy preorderings as well as the triangular norm-based approach to fuzzy mathematical morphology.

We introduce MK-fuzzy automata over a bimonoid K which is related to the fuzzification of the McCarthy-Kleene logic. Our automata are inspired by, and intend to contribute to, practical applications being in development in the LogicGuard project [15, 16]. We investigate closure properties of the class of MK-fuzzy languages accepted by MK-fuzzy automata as well as by their deterministic counterp...

in this paper, the notion of fuzzy semicompactness degrees isintroduced in $l$-fuzzy topological spaces by means of theimplication operation of $l$. characterizations of fuzzysemicompactness degrees in $l$-fuzzy topological spaces  areobtained, and some properties of fuzzy semicompactness degrees areresearched.