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 a project on runtime network monitoring based on predicate logic. We investigate closure properties of the class of recognizableMK-fuzzy languages accepted by MKfuzzy automat...

Multidimensional similarity join finds pairs of multidimensional points that are within some small distance of each other. The -k-d-B tree has been proposed as a data structure that scales better as the number of dimensions increases compared to previous data structures. We present a cost model of the -k-d-B tree and use it to optimize the leaf

Context-free tree grammars, originally introduced by Rounds ((Rounds, 1970)), are powerful grammar devices for the definition of tree languages. In the present paper, we consider a subclass of the class of context-free tree languages, namely the class of monadic simple context-free tree languages. For this class of context-free tree languages, a faithful rendering of extended TAGs, we show that...

Fuzzy logic techniques are efficient in solving complex, ill-defined problems that are characterized by uncertainty of environment and fuzziness of information. Fuzzy logic allows handling uncertain and imprecise knowledge and provides a powerful framework for reasoning. Fuzzy reasoning models are relevant to a wide variety of subject areas such as engineering, economics, psychology, sociology,...

In this paper the idea of strong sum distance which is a metric, in a fuzzy graph is introduced. Based on this metric the concepts of eccentricity, radius, diameter, center and self centered fuzzy graphs are studied. Some properties of eccentric nodes, peripheral nodes and central nodes are obtained. A characterisation of self centered complete fuzzy graph is obtained and conditions under which...

Decision tree construction is an important data-mining problem. In this paper we introduce an approach of using cumulative information estimations for fuzzy decision tree induction. We present new type of fuzzy decision tree: ordered tree. This tree is oriented to parallel processing of attributes with differing costs.

Two fuzzy database query languages are proposed. They are used to query to fuzzy databases that are enhanced from relational databases in a way that fuzzy sets are allowed in both attribute values and truth values. A fuzzy calculus query language is constructed based on the relational calculus and a fuzzy algebra query language is also constructed based on the relational algebra. In addition, t...

In this paper, we propose a new technique for multidimensional query processing which can be widely applied in database systems. Our new technique, called tree striping, generalizes the well-known inverted lists and multidimensional indexing approaches. A theoretical analysis of our generalized technique shows that both, inverted lists and multidimensional indexing approaches, are far from bein...

We address the issue of designing effective query languages for OLAP databases. The basis of our investigation is MD, a new data model for multidimensional databases that, unlike other multidimensional models, is independent of any specific implementation and as such provides a clear separation between practical and conceptual aspects. In this framework, we present and compare two query languag...