2008, Vol. XV, núm. 3 http://hdl.handle.net/2099/13079 2020-01-19T17:23:59Z Infinitary 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:13Z 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 Interval-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:11Z 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 Orderings 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:38Z 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 A 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 . 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:51Z 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 . 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 A 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:01Z 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