Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Alessandro Solimando

dblp:119/6401 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
0since 2021 · last 2017
0000-0001-6748-7755ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 5 · 3 first-authorArtificial intelligence and machine learning · 2Theory of computation · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Knowledge representation and reasoning · 100%
Databases, data mining, and information retrieval
2 papers
Data models and query languages · 58% Query processing and optimization · 42%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
description logic
0.212016
Beyond OWL 2 QL in OBDA: Rewritings and Approximations · AAAI 2016
Knowledge, reasoning and agents › Knowledge representation and reasoning › description logic
DL-Lite
0.212016
Beyond OWL 2 QL in OBDA: Rewritings and Approximations · AAAI 2016
Knowledge, reasoning and agents › Knowledge representation and reasoning
ontology-based query answering
0.212016
Beyond OWL 2 QL in OBDA: Rewritings and Approximations · AAAI 2016
Knowledge, reasoning and agents › Knowledge representation and reasoning › ontology
ontology matching
0.212016
Limiting Logical Violations in Ontology Alignnment Through Negotiation · KR 2016
Knowledge, reasoning and agents › Knowledge representation and reasoning › ontology-based query answering
query rewriting
0.212016
Beyond OWL 2 QL in OBDA: Rewritings and Approximations · AAAI 2016
Data models and query languages › XML data management
XML change detection
0.212013
Synthetising Changes in XML Documents as PULs · Proc. VLDB Endow. 2013
Query processing and optimization
XML query processing
0.212013
Synthetising Changes in XML Documents as PULs · Proc. VLDB Endow. 2013
Data models and query languages › XML query languages
XQuery Update Facility
0.212013
Synthetising Changes in XML Documents as PULs · Proc. VLDB Endow. 2013
Query processing and optimization › semantic query processing
ontology-based query answering
0.112016
Beyond OWL 2 QL in OBDA: Rewritings and Approximations · AAAI 2016

Methods — techniques the papers use, named apart from their topics

conservative rewriting · 0.5approximation · 0.5edit-script generation · 0.2
YearPublicationVenuePosition
2017 Minimizing conservativity violations in ontology alignments: algorithms and evaluation
Alessandro Solimando, Ernesto Jiménez-Ruiz, Giovanna Guerrini
Knowl. Inf. Syst.1
2016 Beyond OWL 2 QL in OBDA: Rewritings and Approximations
abstract
Ontology-based data access (OBDA) is a novel paradigm facilitating access to relational data, realized by linking data sources to an ontology by means of declarative mappings. DL-Lite_R, which is the logic underpinning the W3C ontology language OWL 2 QL and the current language of choice for OBDA, has been designed with the goal of delegating query answering to the underlying database engine, and thus is restricted in expressive power. E.g., it does not allow one to express disjunctive information, and any form of recursion on the data. The aim of this paper is to overcome these limitations of DL-Lite_R, and extend OBDA to more expressive ontology languages, while still leveraging the underlying relational technology for query answering. We achieve this by relying on two well-known mechanisms, namely conservative rewriting and approximation, but significantly extend their practical impact by bringing into the picture the mapping, an essential component of OBDA. Specifically, we develop techniques to rewrite OBDA specifications with an expressive ontology to "equivalent" ones with a DL-Lite_R ontology, if possible, and to approximate them otherwise. We do so by exploiting the high expressive power of the mapping layer to capture part of the domain semantics of rich ontology languages. We have implemented our techniques in the prototype system OntoProx, making use of the state-of-the-art OBDA system Ontop and the query answering system Clipper, and we have shown their feasibility and effectiveness with experiments on synthetic and real-world data.
Elena Botoeva, Diego Calvanese, Valerio Santarelli, Domenico Fabio Savo, Alessandro Solimando, Guohui Xiao 0001
AAAI5
2016 Limiting Logical Violations in Ontology Alignnment Through Negotiation
Ernesto Jiménez-Ruiz, Terry R. Payne, Alessandro Solimando, Valentina Tamma
KR3
2015 RODI: A Benchmark for Automatic Mapping Generation in Relational-to-Ontology Data Integration
Christoph Pinkel, Carsten Binnig, Ernesto Jiménez-Ruiz, Wolfgang May, Dominique Ritze, Martin G. Skjæveland, Alessandro Solimando, Evgeny Kharlamov
ESWC7
2014 Detecting and Correcting Conservativity Principle Violations in Ontology Mappings
Alessandro Solimando
ISWC (2)1
2014 Detecting and Correcting Conservativity Principle Violations in Ontology-to-Ontology Mappings
Alessandro Solimando, Ernesto Jiménez-Ruiz, Giovanna Guerrini
ISWC (2)1
2014 Validating XML document adaptations via Hedge Automata transformations
Alessandro Solimando, Giorgio Delzanno, Giovanna Guerrini
Theor. Comput. Sci.1
2013 Synthetising Changes in XML Documents as PULs
abstract
The ability of efficiently detecting changes in XML documents is crucial in many application contexts. If such changes are represented as XQuery Update Pending Update Lists (PULs), they can then be applied on documents using XQuery Update engines, and document management can take advantage of existing composition, inversion, reconciliation approaches developed in the update processing context. The paper presents an XML edit-script generator with the unique characteristic of using PULs as edit-script language and improving the state of the art from both the performance and the generated edit-script quality perspectives.
Federico Cavalieri, Alessandro Solimando, Giovanna Guerrini
Proc. VLDB Endow.2