in this paper, we study the finitely many constraints of fuzzy relation inequalities problem and optimize the linear objective function on this region which is defined with fuzzy max-lukasiewicz operator. in fact lukasiewicz t-norm is one of the four basic t-norms. a new simplification technique is given to accelerate the resolution of the problem by removing the components having no effect on ...

In this paper, we study the finitely many constraints of fuzzy relation inequalities problem and optimize the linear objective function on this region which is defined with fuzzy max-Lukasiewicz operator. In fact Lukasiewicz t-norm is one of the four basic t-norms. A new simplification technique is given to accelerate the resolution of the problem by removing the components having no effect on ...

In this paper, we study the finitely many constraints of fuzzy relation inequalities problem and optimize the linear objective function on this region which is defined with fuzzy max-Lukasiewicz operator. In fact Lukasiewicz t-norm is one of the four basic t-norms. A new simplification technique is given to accelerate the resolution of the problem by removing the components having no effect on ...

Fuzzy logics based on triangular norms and their corresponding conorms are investigated. An aarmative answer to the question whether in such logics a speciic level of satissability of a set of formulas can be characterized by the same level of satissability of its nite subsets is given. Tautologies, contradictions and contingencies with respect to such fuzzy logics are studied, in particular fo...

The paper gives the systematic characterization of eigenspace in max-T algebra where T is equal to Łukasiewicz t-norm. Max-Łukasiewicz fuzzy algebra can be used for the description of the states of Discrete-event systems. The states can represent a balance of the resource unit expended during the evolution of the system (for example fuel or money). In the contribution, the classification of max...

We consider propositional logic. Three-valued logics are old: the first one is Lukasiewicz three valued logic from 1920 [8]. Gödel in [5] from 1932 studied a hierarchy of finite-valued logics, containing Gödel three-valued logic. Our main interest pays to Kleene three-valued logic [6]. Other threevalued logics will not be considered here. Let us agree that the three truth values are 0, 1 2 , 1 ...

Following M. Krachounov ([5]), max and min operations with fuzzy sets are considered instead of Lukasiewicz ones ([6], [7], [8], [9]). Her the domain F of a probability m : F → [0, 1] consists on IF-events A = (μA, νA) i.e. mappings from a measurable space (Ω,S) to the unit square ([1]). Local representation of sequences of M -observables by random variables is constructed and three kinds of co...

in this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. we study this problem and capture some special characteristics of its feasible domain and optimal s...

In 2000, Figallo and Sanza introduced the n×m−valued Lukasiewicz-Moisil algebras, which are a particular case of Matrix Lukasiewicz algebras, and a nontrivial generalization of n−valued Lukasiewicz-Moisil algebras. Here we start a research on the class of n × m−valued Lukasiewicz-Moisil algebras endowed with two modal operators (or 2mLMn×m−algebras). These algebras constitute a common generaliz...

Rough set theory is an important tool for dealing with granularity and vagueness in information systems. This paper studies a kind of rough set algebra. The collection of all the rough sets of an approximation space can be made into a 3-valued Lukasiewicz algebra. We call the algebra a rough 3-valued Lukasiewicz algebra. In this paper, we focus on the rough 3-valued Lukasiewicz algebras, which ...