Displaying similar documents to “Characterization of binary operations on the unit interval satisfying the generalized modus ponens inference rule.”

On MPT-implication functions for fuzzy logic.

Enric Trillas, Claudi Alsina, Ana Pradera (2004)

RACSAM

Similarity:

This paper deals with numerical functions J : [0,1] x [0,1] → [0,1] able to functionally express operators →: [0,1] x [0,1] → [0,1] defined as (μ → σ)(x,y) = J(μ(x),σ(y)), and verifying either Modus Ponens or Modus Tollens, or both. The concrete goal of the paper is to search for continuous t-norms T and strong-negation functions N for which it is either T(a, J(a,b)) ≤ b (Modus Ponens) or T(N(b), J(a,b)) ≤ N(a) (Modus Tollens), or both, for all a,b in [0,1] and a given J. Functions J...

Interpretability of linguistic variables: a formal account

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

An architecture for making judgments using computing with words

Jerry Mendel (2002)

International Journal of Applied Mathematics and Computer Science

Similarity:

Our thesis is that computing with words needs to account for the uncertainties associated with the meanings of words, and that these uncertainties require using type-2 fuzzy sets. Doing this leads to a proposed architecture for making it judgments by means of computing with words, i.e., to a perceptual computer-the Per-C. The Per-C includes an encoder, a type-2 rule-based fuzzy logic system, and a decoder. It lets all human-computer interactions be performed using words. In this paper,...

Formalization of Provenes fuzzy functional dependency in fuzzy databases.

Nedzad Dukic, Zikrija Avdagic (2004)

Mathware and Soft Computing

Similarity:

In this paper we establish equivalence between a theory of fuzzy functional dependences and a fragment of fuzzy logic. We give a way to interpret fuzzy functional dependences as formulas in fuzzy logic. This goal is realized in a few steps. Truth assignment of attributes is defined in terms of closeness between two tuples in a fuzzy relation. A corresponding fuzzy formula is associated to a fuzzy functional dependence. It is proved that if a relation satisfies a fuzzy functional dependence,...