2008, Vol. XV, núm. 2http://hdl.handle.net/2099/130782020-07-10T01:21:23Z2020-07-10T01:21:23ZOrderings of fuzzy sets based on fuzzy orderings. Part I: the basic approachBodenhofer, Ulrichhttp://hdl.handle.net/2099/132052015-07-31T00:52:23Z2013-04-16T17:46:34ZOrderings of fuzzy sets based on fuzzy orderings. Part I: the basic approach
Bodenhofer, Ulrich
The aim of this paper is to present a general framework for comparing
fuzzy sets with respect to a general class of fuzzy orderings. This approach
includes known techniques based on generalizing the crisp linear ordering of
real numbers by means of the extension principle, however, in its general
form, it is applicable to any fuzzy subsets of any kind of universe for which a
fuzzy ordering is known|no matter whether linear or partial
2013-04-16T17:46:34ZBodenhofer, UlrichThe aim of this paper is to present a general framework for comparing
fuzzy sets with respect to a general class of fuzzy orderings. This approach
includes known techniques based on generalizing the crisp linear ordering of
real numbers by means of the extension principle, however, in its general
form, it is applicable to any fuzzy subsets of any kind of universe for which a
fuzzy ordering is known|no matter whether linear or partialOn the threshold of bounded pseudo-distancesTrillas, EnricSoto, Adolfo R. dehttp://hdl.handle.net/2099/132042015-07-31T00:52:23Z2013-04-16T17:45:24ZOn the threshold of bounded pseudo-distances
Trillas, Enric; Soto, Adolfo R. de
This paper deals with the relationship between bounded pseudo-distances
and its associated W'-indistinguishabilities, from which the idea of threshold
of transitivity comes. By the way, bounded pseudo-distances are characterized
2013-04-16T17:45:24ZTrillas, EnricSoto, Adolfo R. deThis paper deals with the relationship between bounded pseudo-distances
and its associated W'-indistinguishabilities, from which the idea of threshold
of transitivity comes. By the way, bounded pseudo-distances are characterizedExploring a syntactic notion of modal many-valued logicsBou, F.Esteva, F.Godo, L.http://hdl.handle.net/2099/132032015-07-31T00:52:25Z2013-04-16T17:05:16ZExploring a syntactic notion of modal many-valued logics
Bou, F.; Esteva, F.; Godo, L.
We propose a general semantic notion of modal many-valued logic. Then,
we explore the di culties to characterize this notion in a syntactic way and
analyze the existing literature with respect to this framework
2013-04-16T17:05:16ZBou, F.Esteva, F.Godo, L.We propose a general semantic notion of modal many-valued logic. Then,
we explore the di culties to characterize this notion in a syntactic way and
analyze the existing literature with respect to this frameworkRepresenting upper probability Measures over rational Lukasiewicz logicMarchioni, Enricohttp://hdl.handle.net/2099/131982015-07-31T00:52:26Z2013-04-15T17:10:23ZRepresenting upper probability Measures over rational Lukasiewicz logic
Marchioni, Enrico
Upper probability measures are measures of uncertainty that generalize
probability measures in order to deal with non-measurable events. Following
an approach that goes back to previous works by H ajek, Esteva, and Godo,
we show how to expand Rational Lukasiewicz Logic by modal operators
in
order to reason about upper probabilities of classical Boolean events
'
so that
(
'
) can be read as \the upper probability of
'
". We build the logic
U
(R L)
for representing upper probabilities and show it to be complete w.r.t. a class
of Kripke structures equipped with an upper probability measure. Finally,
we prove that the set of
U
(R L)-satis able formulas is NP-complete.
2013-04-15T17:10:23ZMarchioni, EnricoUpper probability measures are measures of uncertainty that generalize
probability measures in order to deal with non-measurable events. Following
an approach that goes back to previous works by H ajek, Esteva, and Godo,
we show how to expand Rational Lukasiewicz Logic by modal operators
in
order to reason about upper probabilities of classical Boolean events
'
so that
(
'
) can be read as \the upper probability of
'
". We build the logic
U
(R L)
for representing upper probabilities and show it to be complete w.r.t. a class
of Kripke structures equipped with an upper probability measure. Finally,
we prove that the set of
U
(R L)-satis able formulas is NP-complete.Aggregation operators and lipschitzian conditionsRecasens Ferrés, Jorgehttp://hdl.handle.net/2099/131972020-05-04T21:01:54Z2013-04-15T17:09:46ZAggregation operators and lipschitzian conditions
Recasens Ferrés, Jorge
Lipschitzian aggregation operators with respect to the natural T - indistin-
guishability operator Et and their powers, and with respect to the residuation ! T
with respect to a t-norm T and its powers are studied. A t-norm T is proved to be E
T -Lipschitzian and -Lipschitzian, and is
interpreted as a fuzzy point and a fuzzy map as well. Given an Archimedean t-norm
T with additive generator t , the quasi-
arithmetic mean generated by t
is proved to be the most stable aggregation
operator with respect to T
2013-04-15T17:09:46ZRecasens Ferrés, JorgeLipschitzian aggregation operators with respect to the natural T - indistin-
guishability operator Et and their powers, and with respect to the residuation ! T
with respect to a t-norm T and its powers are studied. A t-norm T is proved to be E
T -Lipschitzian and -Lipschitzian, and is
interpreted as a fuzzy point and a fuzzy map as well. Given an Archimedean t-norm
T with additive generator t , the quasi-
arithmetic mean generated by t
is proved to be the most stable aggregation
operator with respect to T