Our reasoning is clearly fuzzy, so why is crisp logic so often adequate? We explain this phenomenon by showing that in the presence of noise, an arbitrary continuous (e.g., fuzzy) system can be well described by its discrete analog. However, as the description gets more accurate, the continuous description becomes necessary. 1 Formulation of the Problem Fuzzy logic is needed. Our reasoning is c...

A voting model semantics for fuzzy sets is assumed with the corresponding ideas of mass assignment theory. The use of fuzzy sets in this way will provide better interpolation, greater knowledge compression, less dependence on the effects of noisy data than if only crisp sets were used. We will see how easy and useful it is to use successful inference methods such as decision trees, probabilisti...

This paper introduces, in analogy to the concept of fuzzy numbers, the concept of fuzzy booleans, and examines approximate reasoning with the compositional rule of inference using fuzzy booleans. It is shown that each set of fuzzy rules is equivalent to a set of fuzzy rules with singleton crisp antecedents; in case of fuzzy booleans this set contains only two rules. It is shown that Zadeh's ext...

comparing the performance of a set of activities or organizations under uncertainty environment has been performed by means of fuzzy data envelopment analysis (fdea) since the traditional dea models require accurate and precise performance data. as regards a method for dealing with uncertainty environment, many researchers have introduced dea models in fuzzy environment. some of these models ar...

in this paper, by presenting some notions and theorems, we obtaindifferent types of fuzzy topologies. in fact, we obtain somelowen-type  and chang-type fuzzy topologies on general fuzzyautomata. to this end, first we define a kuratowski fuzzy interioroperator which induces a  lowen-type  fuzzy topology on the  set ofstates of a max- min general   fuzzy automaton. also by  provingsome theorems, ...

Uncertainty and vagueness are pervasive phenomena in real-life knowledge. They are supported in extended description logics that adapt classical description logics to deal with numerical probabilities or fuzzy truth values. While the two concepts are distinguished for good reasons, they combine in the notion of probably, which is ultimately a fuzzy qualification of probabilities. Here, we devel...

This article introduces interior and closure operators with inclusion degree considered within a crisp or fuzzy topological framework. First, inclusion degree is introduced in an extension of the interior and closure operators in crisp topology. This idea is then introduced in fuzzy topology by incorporating a relaxed version of fuzzy subsethood. The introduction of inclusion degree leads to a ...

This paper presents a novel type-2 Fuzzy logic System to define the Shape of a facial component with the crisp output. The Fuzzy model, designed in this paper, takes crisp value of width and height of a facial component and produces the crisp value of Shape for different facial components. The Fuzzy model is designed using Matlab 6.5 and Visual Basic 6.0 and tested with the facial components ex...

A deterministic automaton accepting a regular language L is a state-partition automaton with respect to a projection P if the state set of the deterministic automaton accepting the projected language P (L), obtained by the standard subset construction, forms a partition of the state set of the automaton. In this paper, we study fundamental properties of state-partition automata. We provide a co...

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...