The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Claudio Moraga (1999)
Mathware and Soft Computing
Similarity:
The subject of the present paper is the study of fuzzy computability based on fuzzy Turing machines. Two different models of fuzzy Turing machines will be discussed. It is shown that most work on fuzzy mathematics may be conducted within the frame of classical computability and the rest falls within the area of computability of the reals.
Ulrich Bodenhofer, Peter Bauer (2005)
Kybernetika
Similarity:
This contribution is concerned with the interpretability of fuzzy rule-based systems. While this property is widely considered to be a crucial one in fuzzy rule-based modeling, a more detailed formal investigation of what “interpretability” actually means is not available. So far, interpretability has most often been associated with rather heuristic assumptions about shape and mutual overlapping of fuzzy membership functions. In this paper, we attempt to approach this problem from a...
A. N. Melikhov, L. S. Bershtein, S. Ya. Korovin (1992)
Kybernetika
Similarity:
Ludovic Lietard, Daniel Rocacher (2009)
Control and Cybernetics
Similarity:
Martine De Cock, Etienne Kerre (2002)
International Journal of Applied Mathematics and Computer Science
Similarity:
We present a framework of L-fuzzy modifiers for L being a complete lattice. They are used to model linguistic hedges that act on linguistic terms represented by L-fuzzy sets. In the modelling process the context is taken into account by means of L-fuzzy relations, endowing the L-fuzzy modifiers with a clear inherent semantics. To our knowledge, these L-fuzzy modifiers are the first ones proposed that are suitable to perform this representation task for a lattice L different from the...