Alexander Artikis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alexander Artikis has a total of 116 co-authors. Here are the top co-authors by number of shared publications:
- Georgios Paliouras
National Center for Scientific Research “Demokritos
25 shared publications Jeremy Pitt
Imperial College London
22 shared publications- Elias Alevizos
Institute of Informatics & Telecommunications, NCSR Demokritos, Athens, Greece
13 shared publications Marek Sergot
Imperial College London
12 shared publicationsLloyd Kamara
Intelligent Systems & Networks Group, Electrical & Electronic Engineering Department, Imperial College London, SW7 2BT
7 shared publications- Charilaos Akasiadis
Technical University of Crete
6 shared publications
Latest Publications
- Open Access
- 17 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing for Healthcare
- Vol. 7 (2) , 1-29
Forecasting COVID-19 Infections with the Use of Simple Cellular Automata
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.
- 17 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing for Healthcare
- Vol. 7 (2) , 1-29
Open AccessForecasting COVID-19 Infections with the Use of Simple Cellular Automata
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.
- Open Access
- 1 November 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 22 (1) , 643-652
A Tensor-Based Probabilistic Event Calculus
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.
- 1 November 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 22 (1) , 643-652
Open AccessA Tensor-Based Probabilistic Event Calculus
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.
- 29 October 2025
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 84
Reasoning over Streams of Events with Delayed Effects
In streaming applications, it is often required to detect situations of interest, by means of temporal pattern matching, with minimal latency. In the maritime domain, e.g., where it is crucial to prevent activities that are harmful to the environment, we need to report illegal fishing activities, based on streams of low-level vessel actions, as soon as possible. Streams often include events with delayed effects. In multi-agent voting protocols, e.g., a proposed motion may be seconded at the latest by some time in the future. In simulations of biological systems, a signal may lead to the deactivation of the functions of a gene after a time delay. We propose a formal computational framework that handles streams including events with delayed effects. We present the syntax, semantics and reasoning algorithms of our proposed framework, and demonstrate its correctness and complexity. Furthermore, we present a reproducible analysis on large synthetic and real data streams, from the fields of composite event recognition, multi-agent systems and biological feedback processes, and compare the efficiency of our approach with state-of-the-art systems that can perform stream reasoning in these domains. Our results demonstrate that our framework is capable of reasoning over very large streams, including events with delayed effects, while outperforming the state-of-the-art, often by orders of magnitude.
- 29 October 2025
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 84
Reasoning over Streams of Events with Delayed Effects
In streaming applications, it is often required to detect situations of interest, by means of temporal pattern matching, with minimal latency. In the maritime domain, e.g., where it is crucial to prevent activities that are harmful to the environment, we need to report illegal fishing activities, based on streams of low-level vessel actions, as soon as possible. Streams often include events with delayed effects. In multi-agent voting protocols, e.g., a proposed motion may be seconded at the latest by some time in the future. In simulations of biological systems, a signal may lead to the deactivation of the functions of a gene after a time delay. We propose a formal computational framework that handles streams including events with delayed effects. We present the syntax, semantics and reasoning algorithms of our proposed framework, and demonstrate its correctness and complexity. Furthermore, we present a reproducible analysis on large synthetic and real data streams, from the fields of composite event recognition, multi-agent systems and biological feedback processes, and compare the efficiency of our approach with state-of-the-art systems that can perform stream reasoning in these domains. Our results demonstrate that our framework is capable of reasoning over very large streams, including events with delayed effects, while outperforming the state-of-the-art, often by orders of magnitude.
- 8 July 2025
- Published by SAGE Publications in The European Journal on Artificial Intelligence
- Vol. 39 (2) , 251-269
Detecting and Fixing Inconsistencies in Large Knowledge Graphs*
Lately, the availability of massive amounts of data necessitates the adoption of modern representation techniques, such as knowledge graphs (KGs). KGs are typically constructed via automated procedures and by utilizing heterogeneous data sources. This nevertheless hinders the quality of these large resulting KGs, as they might contain contradictions, that is a set of assertions that conflict with some axioms often set by human experts. In turn, classical description logics reasoners cannot be applied as no useful inference results can be generated in the face of inconsistencies. Meanwhile, classical reasoners can be used in order to retrieve the inconsistency explanations, but as the KG size grows larger the required time for this task increases significantly. To address the problem of reasoning with large and inconsistent KGs, we propose an open-source system that detects and fixes inconsistencies by splitting the KG into modules and then processing them in parallel to speed up the process. An empirical evaluation of two datasets illustrates the potential for effective inconsistency detection and fixing of large KGs.
- 8 July 2025
- Published by SAGE Publications in The European Journal on Artificial Intelligence
- Vol. 39 (2) , 251-269
Detecting and Fixing Inconsistencies in Large Knowledge Graphs*
Lately, the availability of massive amounts of data necessitates the adoption of modern representation techniques, such as knowledge graphs (KGs). KGs are typically constructed via automated procedures and by utilizing heterogeneous data sources. This nevertheless hinders the quality of these large resulting KGs, as they might contain contradictions, that is a set of assertions that conflict with some axioms often set by human experts. In turn, classical description logics reasoners cannot be applied as no useful inference results can be generated in the face of inconsistencies. Meanwhile, classical reasoners can be used in order to retrieve the inconsistency explanations, but as the KG size grows larger the required time for this task increases significantly. To address the problem of reasoning with large and inconsistent KGs, we propose an open-source system that detects and fixes inconsistencies by splitting the KG into modules and then processing them in parallel to speed up the process. An empirical evaluation of two datasets illustrates the potential for effective inconsistency detection and fixing of large KGs.
- Open Access
- 9 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 9-20
Run-Time Adaptation of Complex Event Forecasting
- 9 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 9-20
Open AccessRun-Time Adaptation of Complex Event Forecasting
- Open Access
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (14) , 15075-15082
Temporal Specification Optimisation for the Event Calculus
Temporal pattern matching tasks require the detection of situations of interest based on streams of symbolic events. The Run-Time Event Calculus (RTEC) is a formal framework that represents situations of interest as time-varying properties called 'fluents'. Temporal patterns often express 'Boolean combinations' of situations; RTEC features two types of fluents that may model such patterns: 'simple' and 'statically determined'. A simple fluent representation, however, is exponentially larger and more expensive to reason with than the corresponding statically determined fluent one. We formally identify the class of simple fluent definitions that can be translated into statically determined fluent definitions. Moreover, we present a compiler for the translation, and a reproducible empirical evaluation on real applications.
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (14) , 15075-15082
Open AccessTemporal Specification Optimisation for the Event Calculus
Temporal pattern matching tasks require the detection of situations of interest based on streams of symbolic events. The Run-Time Event Calculus (RTEC) is a formal framework that represents situations of interest as time-varying properties called 'fluents'. Temporal patterns often express 'Boolean combinations' of situations; RTEC features two types of fluents that may model such patterns: 'simple' and 'statically determined'. A simple fluent representation, however, is exponentially larger and more expensive to reason with than the corresponding statically determined fluent one. We formally identify the class of simple fluent definitions that can be translated into statically determined fluent definitions. Moreover, we present a compiler for the translation, and a reproducible empirical evaluation on real applications.
- Open Access
Dealing with Inconsistency for Reasoning over Knowledge Graphs: A Survey
In Knowledge Graphs (KGs), where the schema of the data is usually defined by particular ontologies, reasoning is a necessity to perform a range of tasks, such as retrieval of information, question answering, and the derivation of new knowledge. However, information to populate KGs is often extracted (semi-) automatically from natural language resources, or by integrating datasets that follow different semantic schemas, resulting in KG inconsistency. This, however, hinders the process of reasoning. In this survey, we focus on how to perform reasoning on inconsistent KGs, by analyzing the state of the art towards three complementary directions: a) the detection of the parts of the KG that cause the inconsistency, b) the fixing of an inconsistent KG to render it consistent, and c) the inconsistency-tolerant reasoning. We discuss existing work from a range of relevant fields focusing on how, and in which cases they are related to the above directions. We also highlight persisting challenges and future directions.
Open AccessDealing with Inconsistency for Reasoning over Knowledge Graphs: A Survey
In Knowledge Graphs (KGs), where the schema of the data is usually defined by particular ontologies, reasoning is a necessity to perform a range of tasks, such as retrieval of information, question answering, and the derivation of new knowledge. However, information to populate KGs is often extracted (semi-) automatically from natural language resources, or by integrating datasets that follow different semantic schemas, resulting in KG inconsistency. This, however, hinders the process of reasoning. In this survey, we focus on how to perform reasoning on inconsistent KGs, by analyzing the state of the art towards three complementary directions: a) the detection of the parts of the KG that cause the inconsistency, b) the fixing of an inconsistent KG to render it consistent, and c) the inconsistency-tolerant reasoning. We discuss existing work from a range of relevant fields focusing on how, and in which cases they are related to the above directions. We also highlight persisting challenges and future directions.
- 1 January 2025
- Published by Springer Nature
- p. 231-238
Towards a Hybrid Human-Machine Discovery of Complex Movement Patterns
- 1 January 2025
- Published by Springer Nature
- p. 231-238
Towards a Hybrid Human-Machine Discovery of Complex Movement Patterns
- Open Access
- 11 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Detecting and Fixing Inconsistency of Large Knowledge Graphs
- 11 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Open AccessDetecting and Fixing Inconsistency of Large Knowledge Graphs
- Open Access
- 1 August 2024
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 4, 3570-3578
A Prior-based Discrete Diffusion Model for Social Graph Generation
Graph generation is essential in social network analysis, particularly for modeling information flow and user interactions. However, existing probabilistic diffusion models face challenges when applied to social propagation graphs. The continuous noise does not apply to the discrete nature of graph generation tasks, and the random Gaussian initialization in the reverse process can introduce biases that deviate from real-world propagation patterns. To address these issues, this paper introduces a Prior-based Discrete Diffusion Model (PDDM) for social graph generation. PDDM redefines the forward process as a discrete process for node denoising and edge generation, and the task of the denoising module is transformed into the connection probability learning of node-level tasks. Further, PDDM employs a new starting point of the reverse process by incorporating user similarity as the probability matrix, which can better leverage the social context. These developments mitigate reverse-starting bias and enhance model robustness. Moreover, PDDM integrates lightweight deep graph networks such as GAT, demonstrating both scalability and applicability to graph generation scenarios. Comprehensive experiments on real-world social network datasets demonstrate PDDM’s superiority in terms of the MMD metric and downstream tasks. The code is available at https://github.com/cgao-comp/PDDM.
- 1 August 2024
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 4, 3570-3578
Open AccessA Prior-based Discrete Diffusion Model for Social Graph Generation
Graph generation is essential in social network analysis, particularly for modeling information flow and user interactions. However, existing probabilistic diffusion models face challenges when applied to social propagation graphs. The continuous noise does not apply to the discrete nature of graph generation tasks, and the random Gaussian initialization in the reverse process can introduce biases that deviate from real-world propagation patterns. To address these issues, this paper introduces a Prior-based Discrete Diffusion Model (PDDM) for social graph generation. PDDM redefines the forward process as a discrete process for node denoising and edge generation, and the task of the denoising module is transformed into the connection probability learning of node-level tasks. Further, PDDM employs a new starting point of the reverse process by incorporating user similarity as the probability matrix, which can better leverage the social context. These developments mitigate reverse-starting bias and enhance model robustness. Moreover, PDDM integrates lightweight deep graph networks such as GAT, demonstrating both scalability and applicability to graph generation scenarios. Comprehensive experiments on real-world social network datasets demonstrate PDDM’s superiority in terms of the MMD metric and downstream tasks. The code is available at https://github.com/cgao-comp/PDDM.