Mathware & soft computing
http://hdl.handle.net/2099/1488
2017-09-21T18:34:29ZInfinitary simultaneous recursion theorem
http://hdl.handle.net/2099/13216
Infinitary simultaneous recursion theorem
Vaggione, D.
We prove an in nitary version of the Double Recursion Theorem of Smullyan.
We give some applications which show how this form of the Recursion Theo-
rem can be naturally applied to obtain interesting in nite sequences of pro-
grams
2013-04-22T17:27:13ZVaggione, D.We prove an in nitary version of the Double Recursion Theorem of Smullyan.
We give some applications which show how this form of the Recursion Theo-
rem can be naturally applied to obtain interesting in nite sequences of pro-
gramsInterval-valued fuzzy ideals generated by an interval-valued fuzzy subset in ordered semigroups
http://hdl.handle.net/2099/13215
Interval-valued fuzzy ideals generated by an interval-valued fuzzy subset in ordered semigroups
Shabir, M.; Israr, Ali Khan
In this paper, we de ne the concept of interval-valued fuzzy left (right, two
sided, interior, bi-) ideal in ordered semigroups. We show that the interval-
valued fuzzy subset
J
is an interval-valued fuzzy left (right, two sided, interior,
bi-) ideal generated by an interval-valued fuzzy subset
A
i
J
and
J
+
are
fuzzy left (right, two sided, interior, bi-) ideals generated by
A
and
A
+
respectively
2013-04-22T17:26:11ZShabir, M.Israr, Ali KhanIn this paper, we de ne the concept of interval-valued fuzzy left (right, two
sided, interior, bi-) ideal in ordered semigroups. We show that the interval-
valued fuzzy subset
J
is an interval-valued fuzzy left (right, two sided, interior,
bi-) ideal generated by an interval-valued fuzzy subset
A
i
J
and
J
+
are
fuzzy left (right, two sided, interior, bi-) ideals generated by
A
and
A
+
respectivelyOrderings of fuzzy sets based on fuzzy orderings. Part II: generalizations
http://hdl.handle.net/2099/13214
Orderings of fuzzy sets based on fuzzy orderings. Part II: generalizations
Bodenhofer, Ulrich
In Part I of this series of papers, a general approach for ordering fuzzy
sets with respect to fuzzy orderings was presented. Part I also highlighted
three limitations of this approach. The present paper addresses these lim-
itations and proposes solutions for overcoming them. We rst consider a
fuzzi cation of the ordering relation, then ways to compare fuzzy sets with
di erent heights, and nally we introduce how to re ne the ordering relation
by lexicographic hybridization with a di erent ordering method
2013-04-22T17:25:38ZBodenhofer, UlrichIn Part I of this series of papers, a general approach for ordering fuzzy
sets with respect to fuzzy orderings was presented. Part I also highlighted
three limitations of this approach. The present paper addresses these lim-
itations and proposes solutions for overcoming them. We rst consider a
fuzzi cation of the ordering relation, then ways to compare fuzzy sets with
di erent heights, and nally we introduce how to re ne the ordering relation
by lexicographic hybridization with a di erent ordering methodA logic approach for exceptions and anomalies in association rules
http://hdl.handle.net/2099/13213
A logic approach for exceptions and anomalies in association rules
Delgado, M.; Sánchez, Daniel; Ruiz, M.D.
Association rules have been used for obtaining information hidden in a
database. Recent researches have pointed out that simple associations are
insu cient for representing the diverse kinds of knowledge collected in a
database. The use of exceptions and anomalies deal with a di erent type
of knowledge sometimes more useful than simple associations. Moreover ex-
ceptions and anomalies provide a more comprehensive understanding of the
information provided by a database.
This work intends to go deeper in the logic model studied in [5]. In the
model, association rules can be viewed as general relations between two or
more attributes quanti ed by means of a convenient quanti er. Using this
formulation we establish the true semantics of the distinct kinds of knowledge
we can nd in the database hidden in the four folds of the contingency table.
The model is also useful for providing some measures for assessing the validity
of those kinds of rules
2013-04-22T17:24:51ZDelgado, M.Sánchez, DanielRuiz, M.D.Association rules have been used for obtaining information hidden in a
database. Recent researches have pointed out that simple associations are
insu cient for representing the diverse kinds of knowledge collected in a
database. The use of exceptions and anomalies deal with a di erent type
of knowledge sometimes more useful than simple associations. Moreover ex-
ceptions and anomalies provide a more comprehensive understanding of the
information provided by a database.
This work intends to go deeper in the logic model studied in [5]. In the
model, association rules can be viewed as general relations between two or
more attributes quanti ed by means of a convenient quanti er. Using this
formulation we establish the true semantics of the distinct kinds of knowledge
we can nd in the database hidden in the four folds of the contingency table.
The model is also useful for providing some measures for assessing the validity
of those kinds of rulesA connection between computer science and fuzzy theory: midpoints and running time of computing
http://hdl.handle.net/2099/13212
A connection between computer science and fuzzy theory: midpoints and running time of computing
Casanovas, Jaume; Valero, O.
Following the mathematical formalism introduced by M. Schellekens [Elec-
tronic Notes in Theoret. Comput. Sci. 1 (1995), 211-232] in order to give
a common foundation for Denotational Semantics and Complexity Analysis,
we obtain an application of the theory of midpoints for asymmetric distances
de ned between fuzzy sets to the complexity analysis of algorithms and pro-
grams. In particular we show that the average running time for the algorithm
known as Largetwo is exactly a midpoint between the best and the worst case
running time of computing
2013-04-22T17:04:01ZCasanovas, JaumeValero, O.Following the mathematical formalism introduced by M. Schellekens [Elec-
tronic Notes in Theoret. Comput. Sci. 1 (1995), 211-232] in order to give
a common foundation for Denotational Semantics and Complexity Analysis,
we obtain an application of the theory of midpoints for asymmetric distances
de ned between fuzzy sets to the complexity analysis of algorithms and pro-
grams. In particular we show that the average running time for the algorithm
known as Largetwo is exactly a midpoint between the best and the worst case
running time of computingOrderings of fuzzy sets based on fuzzy orderings. Part I: the basic approach
http://hdl.handle.net/2099/13205
Orderings 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-distances
http://hdl.handle.net/2099/13204
On 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 logics
http://hdl.handle.net/2099/13203
Exploring 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 logic
http://hdl.handle.net/2099/13198
Representing 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 conditions
http://hdl.handle.net/2099/13197
Aggregation 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