Displaying similar documents to “Interpolative Relations and Interpolative Preference Structures”

(T, ⊥, N) fuzzy logic.

Y. Xu, J. Lin, Da Ruan (2001)

Mathware and Soft Computing

Similarity:

To investigate more reasonable fuzzy reasoning model in expert systems as well as more effective logical circuit in fuzzy control, a (T, ⊥, N) fuzzy logic is proposed in this paper by using T-norm, ⊥-norm and pseudo-complement N as the logical connectives. Two aspects are discussed: (1) some concepts of (T, ⊥, N) fuzzy logic are introduced and some properties of (T, ⊥, N) fuzzy logical formulae are discussed. (2) G-fuzzy truth (falsity) of (T, ⊥, N) fuzzy logical formulae are investigated...

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

On the resolution of bipolar max-min equations

Pingke Li, Qingwei Jin (2016)

Kybernetika

Similarity:

This paper investigates bipolar max-min equations which can be viewed as a generalization of fuzzy relational equations with max-min composition. The relation between the consistency of bipolar max-min equations and the classical boolean satisfiability problem is revealed. Consequently, it is shown that the problem of determining whether a system of bipolar max-min equations is consistent or not is NP-complete. Moreover, a consistent system of bipolar max-min equations, as well as its...

On the generators of T-indistinguishability operator.

Joan Jacas (1988)

Stochastica

Similarity:

The structure of the generators' set of a T-indistinguishability operator is analyzed. A suitable characterization of such generators is given. T-indistinguishability operators generated by a single fuzzy set, in the sense of the representation problem, are studied.

Considering uncertainty and dependence in Boolean, quantum and fuzzy logics

Mirko Navara, Pavel Pták (1998)

Kybernetika

Similarity:

A degree of probabilistic dependence is introduced in the classical logic using the Frank family of t -norms known from fuzzy logics. In the quantum logic a degree of quantum dependence is added corresponding to the level of noncompatibility. Further, in the case of the fuzzy logic with P -states, (resp. T -states) the consideration turned out to be fully analogous to (resp. considerably different from) the classical situation.