An algebraic equivalent of a multiple choice axiom
This paper deals with the problem of the determination of lower solutions of fuzzy relational equations. An algorithm of calculation of such a solution is presented.
We define a recursive theory which axiomatizes a class of models of IΔ₀ + Ω ₃ + ¬ exp all of which share two features: firstly, the set of Δ₀ definable elements of the model is majorized by the set of elements definable by Δ₀ formulae of fixed complexity; secondly, Σ₁ truth about the model is recursively reducible to the set of true Σ₁ formulae of fixed complexity.
In this paper, we propose a novel approach for solving a fuzzy bi-objective multi-index fixed-charge transportation problem where the aim is to minimize two objectives: the total transportation cost and transportation time. The parameters of the problem, such as fixed cost, variable cost, and transportation time are represented as fuzzy numbers. To extract crisp values from these parameters, a linear ranking function is used. The proposed approach initially separates the main problem into sub-problems....
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, a quantitative...