Efthimis Tsilionis

dblp:243/0870 · DBLP profile ↗
← Back
6ranked-venue papers
6as first author
5since 2021 · last 2026
0000-0002-2189-976XORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 4 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 first-authorTheory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

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
3 papers
Knowledge representation and reasoning · 100%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%
Databases, data mining, and information retrieval
1 paper
Data stream processing · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning › temporal reasoning
event calculus
2.332025
A Tensor-Based Probabilistic Event Calculus · KR 2025
A Tensor-Based Formalization of the Event Calculus · IJCAI 2024
Incremental Event Calculus for Run-Time Reasoning (Extended Abstract) · IJCAI 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning
temporal reasoning
2.332025
A Tensor-Based Probabilistic Event Calculus · KR 2025
A Tensor-Based Formalization of the Event Calculus · IJCAI 2024
Incremental Event Calculus for Run-Time Reasoning (Extended Abstract) · IJCAI 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning
probabilistic reasoning
0.912025
A Tensor-Based Probabilistic Event Calculus · KR 2025
Data stream processing
complex event processing
0.312025
A Tensor-Based Probabilistic Event Calculus · KR 2025

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

tensor decomposition · 1.7probabilistic logic programming · 1.7incremental reasoning · 1.3tensor-based formalization · 0.8
YearPublicationVenuePosition
2026 Forecasting COVID-19 Infections with the Use of Simple Cellular Automata
abstract
The outbreak of the COVID-19 pandemic led policy makers and public health officials around the world to implement non-pharmaceutical interventions to suppress the spread of the virus. The goal was to reduce human mobility and social contacts, considered as the main factors of virus diffusion. However, these containment measures needed to be revised on a frequent basis to avoid serious economic and social costs. Moreover, spatial disparities needed to be taken into consideration, since the behavior of the virus was different according to the geographical context. Therefore, a frequent update on the short-term forecasts of the epidemic course, which considered spatial heterogeneities, was crucial for planning appropriate mitigation strategies. In this article, we present a simple epidemiological model based on Cellular Automata, that takes into account human mobility and produces short-term forecasts of daily virus infections. Cellular Automata allow the discretization of time and space and thus, the spatio-temporal dynamics of the disease can be explored at the desired scale. We apply our model on real daily infection and mobility data from Spain and show that it is reliable in predicting the short-term daily infections trajectory both at the country level and at the regional level of Autonomous Communities. Furthermore, compared against four state-of-the-art methods, the proposed method achieves comparable forecasting performance with significantly lower computational resources.
Efthimis Tsilionis, Alexander Artikis, Georgios Paliouras
ACM Trans. Comput. Heal.1
2025 A Tensor-Based Probabilistic Event Calculus
abstract
Complex Event Recognition (CER) systems receive as input a stream of time-stamped events and identify situations of interest that satisfy a given pattern. Streaming environments are characterized by the high rate and volume of input data, and thus, scalability is of crucial importance. At the same time, noise and uncertainty are ubiquitous in temporal data, and not considering them, leads to erroneous detections. To confront these challenges, we present a tensor-based formalization of the Event Calculus (EC) for probabilistic inference, and demonstrate the scalability of our approach with the use of CER datasets from two real-world application domains. Moreover, we demonstrate the benefits of our approach, in terms of processing time, by comparing it against a probabilistic logic programming implementation of EC.
Efthimis Tsilionis, Alexander Artikis, Georgios Paliouras
KR1
2024 A Tensor-Based Formalization of the Event Calculus
Efthimis Tsilionis, Alexander Artikis, Georgios Paliouras
IJCAI1
2023 Incremental Event Calculus for Run-Time Reasoning (Extended Abstract)
abstract
We present a system for online, incremental composite event recognition. In streaming environments, the usual case is for data to arrive with a (variable) delay from, and to be revised by, the underlying sources. We propose RTEC_inc, an incremental version of RTEC, a composite event recognition engine with formal, declarative semantics, that has been shown to scale to several real-world data streams. RTEC deals with delayed arrival and revision of events by computing all queries from scratch. This is often inefficient since it results in redundant computations. Instead, RTEC_inc deals with delays and revisions in a more efficient way, by updating only the affected queries. We compare RTEC_inc and RTEC experimentally using real-world and synthetic datasets. The results are compatible with our complexity analysis and show that RTEC_inc outperforms RTEC in many practical cases.
Efthimis Tsilionis, Alexander Artikis, Georgios Paliouras
IJCAI1
2022 Incremental Event Calculus for Run-Time Reasoning
abstract
We present a system for online, incremental composite event recognition. In streaming environments, the usual case is for data to arrive with a (variable) delay from, and to be revised by, the underlying sources. We propose RTECinc, an incremental version of RTEC, a composite event recognition engine with formal, declarative semantics, that has been shown to scale to several real-world data streams. RTEC deals with delayed arrival and revision of events by computing all queries from scratch. This is often inefficient since it results in redundant computations. Instead, RTECinc deals with delays and revisions in a more efficient way, by updating only the affected queries. We examine RTECinc theoretically, presenting a complexity analysis, and show the conditions in which it outperforms RTEC. Moreover, we compare RTECinc and RTEC experimentally using real-world and synthetic datasets. The results are compatible with our theoretical analysis and show that RTECinc outperforms RTEC in many practical cases.
Efthimis Tsilionis, Alexander Artikis, Georgios Paliouras
J. Artif. Intell. Res.1
2019 Online Event Recognition from Moving Vehicles: Application Paper
abstract
Abstract We present a system for online composite event recognition over streaming positions of commercial vehicles. Our system employs a data enrichment module, augmenting the mobility data with external information, such as weather data and proximity to points of interest. In addition, the composite event recognition module, based on a highly optimised logic programming implementation of the Event Calculus, consumes the enriched data and identifies activities that are beneficial in fleet management applications. We evaluate our system on large, real-world data from commercial vehicles, and illustrate its efficiency.
Efthimis Tsilionis, Nikolaos Koutroumanis, Panagiotis Nikitopoulos, Christos Doulkeridis, Alexander Artikis
Theory Pract. Log. Program.1