Eleni Tsalapati

dblp:29/7870 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
6since 2021 · last 2024
0000-0001-9464-404XORCID · verified

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

Databases, data management, data science and information retrieval · 4 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 2 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
YearPublicationVenuePosition
2024 Generating a Question Answering Dataset About Geographic Changes in a Knowledge Graph
Michalis Mitsios, Dharmen Punjani, Sara Abdollahi, Simon Gottschalk 0001, Eleni Tsalapati, Elena Demidova, Manolis Koubarakis
EKAW5
2024 Transformers in the Service of Description Logic-Based Contexts
Angelos Poulis, Eleni Tsalapati, Manolis Koubarakis
EKAW2
2024 European AI and EO convergence via a novel community-driven framework for data-intensive innovation
Antonis Troumpoukis, Iraklis A. Klampanos, Despina-Athanasia Pantazi, Mohanad Albughdadi, Vasileios Baousis, Omar Barrilero, Alexandra Bojor, Pedro Branco 0002, Lorenzo Bruzzone, Andreina Chietera, Philippe Fournand, Richard Hall, Michele Lazzarini, Adrian Luna, Alexandros Nousias, Christos Perentis, George Petrakis, Dharmen Punjani, David Röbl, George Stamoulis 0001, Eleni Tsalapati, Indre Urbanaviciute, Giulio Weikmann, Xenia Ziouvelou, Marcin Ziolkowski, Manolis Koubarakis, Vangelis Karkaletsis
Future Gener. Comput. Syst.21
2023 EarthQA: A Question Answering Engine for Earth Observation Data Archives *
abstract
EarthQA is a question answering engine that accepts questions in natural language (English) that ask for satellite images satisfying certain criteria and returns links to such datasets, that can be then downloaded from the CREODIAS cloud platform. The questions can refer to image metadata (e.g., satellite platform, sensing period, cloud cover etc.) but also to entities from the knowledge graph DB-pedia (e.g., Mount Etna or the city of Munich). In this way, the users can ask questions like "Give me Sentinel-2 satellite images that show Mount Etna, have been taken in February 2021 and have cloud cover less than 10%."
Dharmen Punjani, Manolis Koubarakis, Eleni Tsalapati
IGARSS3
2023 Benchmarking Geospatial Question Answering Engines Using the Dataset GeoQuestions1089
Sergios-Anestis Kefalidis, Dharmen Punjani, Eleni Tsalapati, Konstantinos Plas, Mariangela Pollali, Michail Mitsios, Myrto Tsokanaridou, Manolis Koubarakis, Pierre Maret
ISWC3
2021 Enhancing polymer electrolyte membrane fuel cell system diagnostics through semantic modelling
Eleni Tsalapati, Thomas W. Jackson, Lisa M. Jackson, Derek Low, Ben Davies, Andrew A. West
Expert Syst. Appl.1
2017 Query Rewriting Under Ontology Change
abstract
Query rewriting is an important technique for answering queries over data described using ontologies. In query rewriting the input, a conjunctive query (CQ) |$q$| and an ontology |$\mathcal {O}$|⁠, is transformed into a new datalog query that captures all answers of |$q$| over |$\mathcal {O}$| and any dataset |$D$|⁠. This process can be time-consuming as it is of high computational complexity. In many real-world applications, this can be particularly problematic as they involve frequent and relatively small modifications on quite large ontologies. Hence, a drawback of most of modern query rewriting systems is that every time the initial ontology is modified, e.g. when new axioms are added or existing ones removed, they compute a new rewriting from scratch. In this paper, we study the problem of computing a rewriting for a CQ over an ontology that has been modified. We do this by reusing the information obtained by the extraction of some previous rewriting with the goal of performing the least possible computations. We study the problem theoretically, present detailed algorithms for both ontology revision and ontology contraction and finally, present an extensive experimental evaluation using the well-known query rewriting systems Requiem and Rapid.
Eleni Tsalapati, Giorgos Stoilos, Alexandros Chortaras, Giorgos B. Stamou, George Koletsos
Comput. J.1
2016 Efficient Query Answering over Expressive Inconsistent Description Logics
Eleni Tsalapati, Giorgos Stoilos, Giorgos B. Stamou, George Koletsos
IJCAI1
2009 A Method for Approximation to Ontology Reuse Problem
Eleni Tsalapati, Giorgos B. Stamou, George Koletsos
KEOD1