Umberto Straccia
Istituto di Scienza e Tecnologie dell'Informazione
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Umberto Straccia.
Journal of Artificial Intelligence Research | 2001
Umberto Straccia
Description Logics (DLs) are suitable, well-known, logics for managing structured knowledge. They allow reasoning about individuals and well defined concepts, i.e. set of individuals with common properties. The experience in using DLs in applications has shown that in many cases we would like to extend their capabilities. In particular, their use in the context of Multimedia Information Retrieval (MIR) leads to the convincement that such DLs should allow the treatment of the inherent imprecision in multimedia object content representation and retrieval. In this paper we will present a fuzzy extension of ALC, combining Zadehs fuzzy logic with a classical DL. In particular, concepts becomes fuzzy and, thus, reasoning about imprecise concepts is supported. We will define its syntax, its semantics, describe its properties and present a constraint propagation calculus for reasoning in it.
Journal of Web Semantics | 2008
Thomas Lukasiewicz; Umberto Straccia
Ontologies play a crucial role in the development of the Semantic Web as a means for defining shared terms in web resources. They are formulated in web ontology languages, which are based on expressive description logics. Significant research efforts in the semantic web community are recently directed towards representing and reasoning with uncertainty and vagueness in ontologies for the Semantic Web. In this paper, we give an overview of approaches in this context to managing probabilistic uncertainty, possibilistic uncertainty, and vagueness in expressive description logics for the Semantic Web.
ieee international conference on fuzzy systems | 2008
Fernando Bobillo; Umberto Straccia
In this paper we present fuzzyDL, an expressive fuzzy description logic reasoner.We present its salient features, including some novel concept constructs and queries, and examples of use cases: matchmaking and fuzzy control.
International Journal of Approximate Reasoning | 2011
Fernando Bobillo; Umberto Straccia
The need to deal with vague information in Semantic Web languages is rising in importance and, thus, calls for a standard way to represent such information. We may address this issue by either extending current Semantic Web languages to cope with vagueness, or by providing a procedure to represent such information within current standard languages and tools. In this work, we follow the latter approach, by identifying the syntactic differences that a fuzzy ontology language has to cope with, and by proposing a concrete methodology to represent fuzzy ontologies using OWL 2 annotation properties. We also report on some prototypical implementations: a plug-in to edit fuzzy ontologies using OWL 2 annotations and some parsers that translate fuzzy ontologies represented using our methodology into the languages supported by some reasoners.
acm symposium on applied computing | 2003
M. Elena Renda; Umberto Straccia
Given a set of rankings, the task of ranking fusion is the problem of combining these lists in such a way to optimize the performance of the combination. The ranking fusion problem is encountered in many situations and, e.g., metasearch is a prominent one. It deals with the problem of combining the result lists returned by multiple search engines in response to a given query, where each item in a result list is ordered with respect to a search engine and a relevance score. Several ranking fusion methods have been proposed in the literature. They can be classified based on whether: (i) they rely on the rank; (ii) they rely on the score; and (iii) they require training data or not. Our paper will make the following contributions: (i) we will report experimental results for the Markov chain rank based methods, for which no large experimental tests have yet been made; (ii) while it is believed that the rank based method, named Borda Count, is competitive with score based methods, we will show that this is not true for metasearch; and (iii) we will show that Markov chain based methods compete with score based methods. This is especially important in the context of metasearch as scores are usually not available from the search engines.
european semantic web conference | 2005
Umberto Straccia
In this paper we present a fuzzy version of
Journal of the ACM | 2001
Carlo Meghini; Fabrizio Sebastiani; Umberto Straccia
\mathcal{SHOIN}
Journal of Web Semantics | 2012
Antoine Zimmermann; Nuno Lopes; Axel Polleres; Umberto Straccia
(D), the corresponding Description Logic of the ontology description language OWL DL. We show that the representation and reasoning capabilities of fuzzy
european conference on logics in artificial intelligence | 2004
Umberto Straccia
\mathcal{SHOIN}
Fuzzy Sets and Systems | 2009
Fernando Bobillo; Umberto Straccia
(D) go clearly beyond classical