Partial metrics constitute a generalization of classical for which self-distance may not be zero. They were introduced by S.G. Matthews in 1994 order to provide an adequate mathematical framework the denotational semantics programming languages. Since then, different works devoted obtaining counterparts metric fixed-point results more general context partial metrics. Nevertheless, literature wa...

Labeled graphs provide a natural way of representing entities, relationships and structures within real datasets such as knowledge graphs and protein interactions. Applications such as question answering, semantic search, and motif discovery entail efficient approaches for subgraph matching involving both label and structural similarities. Given the NP-completeness of subgraph isomorphism and t...

The integration of association rules and correlation rules with fuzzy logic can produce more abstract and flexible patterns for many real life problems, since many quantitative features in real world, especially surveying the frequency of plant association in any region is fuzzy in nature. This paper presents a modification of a previously reported algorithm for mining fuzzy association and cor...

We exemplify an optimisation criteria for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two problems arising from biocomputing, so-called Common Connected Components and Cograph Sandwich. The first problem can be defined as follows: given two graphs on the same set of n vertices, find the coarsest partition of the ...

Most of the researches in the domain of fuzzy number comparisons serve the fuzzy number ordering purpose. For making a comparison between two fuzzy numbers, beyond the determination of their order, it is needed to derive the magnitude of their order. In line with this idea, the concept of inequality is no longer crisp however it becomes fuzzy in the sense of representing partial belonging or de...

In this work, we present the induction of a fuzzy model that represents the behavior of a partial known function. We extend the approach of classical induction of a classifier by building a decision tree, and its generalization for regression problems by CART, to build a fuzzy model. It is defined by a collection of fuzzy regions fixed in the input domain of the function. To obtain fuzzy region...

To deal with system uncertainty, finite automata have been generalized into fuzzy automata. Stamenkovic and Ciric proposed an approach using the position automata for the construction of fuzzy automata from fuzzy regular expressions. There exist multifarious methodologies for the construction of finite automata from regular expressions known as Thompson construction, Antimirov partial derivativ...

We characterize a fuzzy lattice through a fuzzy partial order relation, define ideals and filters of fuzzy lattices, characterize an ideal of fuzzy lattice using its level set and its support and show that a subset of a fuzzy lattice is an ideal if and only if its support is an ideal. Similarly, we show the same for its level set. Lastly, we define some kinds of ideals and filters of fuzzy latt...

In this paper the Distributed Consensus and Synchronization problems with fuzzy-valued initial conditions are introduced, in order to obtain a shared estimation of the state of a system based on partial and distributed observations, in the case where such a state is affected by ambiguity and/or vagueness. The Discrete-Time Fuzzy Systems (DFS) are introduced as an extension of scalar fuzzy diffe...