Displaying similar documents to “Some issues of fuzzy querying in relational databases”

Sublattices corresponding to very true operators in commutative basic algebras

Ivan Chajda, Filip Švrček (2014)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

We introduce the concept of very true operator on a commutative basic algebra in a way analogous to that for fuzzy logics. We are motivated by the fact that commutative basic algebras form an algebraic axiomatization of certain non-associative fuzzy logics. We prove that every such operator is fully determined by a certain relatively complete sublattice provided its idempotency is assumed.

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

From computing with numbers to computing with words - From manipulation of measurements to manipulation of perceptions

Lotfi Zadeh (2002)

International Journal of Applied Mathematics and Computer Science

Similarity:

Computing, in its usual sense, is centered on manipulation of numbers and symbols. In contrast, computing with words, or CW for short, is a methodology in which the objects of computation are words and propositions drawn from a natural language, e.g., small, large, far, heavy, not very likely, the price of gas is low and declining, Berkeley is near San Francisco, it is very unlikely that there will be a significant increase in the price of oil in the near future, etc. Computing with...