Valeria Fionda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Valeria Fionda has a total of 115 co-authors. Here are the top co-authors by number of shared publications:
- Antonio Ielo
University of Calabria
8 shared publications - Francesco Ricca
University of Calabria
8 shared publications - Giuseppe Pirrò
University of Calabria
7 shared publications - Francesco Chiariello
IRIT, ANITI, University of Toulouse, France
3 shared publications - Gianluigi Greco
Department of Mathematics and Computer Science, University of Calabria, Rende, Italy
3 shared publications - Alessandra Russo
Imperial College London
2 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 6866-6871
Adversarial Deception-based Detection of Anomalous Network Communities
Detecting anomalous communities in complex networks is a fundamental task in network science, cybersecurity, and social network analysis. In this paper, we introduce a novel framework for anomalous community detection that accounts for the intentional manipulation of community structures through adversarial deception strategies. Intuitively, our notion of anomalous community captures communities whose structure can be deliberately perturbed to evade community detection algorithms while preserving their internal cohesion. The rationale underlying this novel notion is that well-formed communities are more difficult to hide within the overall network structure and are inherently difficult to conceal, whereas anomalous ones are particularly vulnerable to deception. We formalize the notion of deception anomaly by combining community deception metrics with statistical unexpectedness measures derived from the distribution of deception scores across candidate communities. Building on these definitions, we propose DACAD (Deception-based Adversarial Community Anomaly Detection). We perform a preliminary evaluation of the proposed approach on synthetic benchmark networks, analyzing the effectiveness of the proposed approach for different network topologies and deception budgets and comparing our method with related competing approaches.
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 6866-6871
Open AccessAdversarial Deception-based Detection of Anomalous Network Communities
Detecting anomalous communities in complex networks is a fundamental task in network science, cybersecurity, and social network analysis. In this paper, we introduce a novel framework for anomalous community detection that accounts for the intentional manipulation of community structures through adversarial deception strategies. Intuitively, our notion of anomalous community captures communities whose structure can be deliberately perturbed to evade community detection algorithms while preserving their internal cohesion. The rationale underlying this novel notion is that well-formed communities are more difficult to hide within the overall network structure and are inherently difficult to conceal, whereas anomalous ones are particularly vulnerable to deception. We formalize the notion of deception anomaly by combining community deception metrics with statistical unexpectedness measures derived from the distribution of deception scores across candidate communities. Building on these definitions, we propose DACAD (Deception-based Adversarial Community Anomaly Detection). We perform a preliminary evaluation of the proposed approach on synthetic benchmark networks, analyzing the effectiveness of the proposed approach for different network topologies and deception budgets and comparing our method with related competing approaches.
- 21 September 2026
- Published by Springer Nature
- p. 21-38
Explaining Violations in Petri Nets
- Open Access
- 26 January 2026
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 36 (2)
Towards ILP-based LTLf passive learning
Inferring linear temporal logic over finite traces ($\text{LTL}_{\text{f}}$) formulas from a set of example traces, known as passive learning, presents significant challenges due to its combinatorial nature. In this paper, we introduce a novel approach to $\text{LTL}_{\text{f}}$ passive learning based on inductive logic programming (ILP), leveraging the inductive learning of answer set programs framework. Our ILP-based method effectively exploits the set of example traces to guide the learning process, and experimental results demonstrate that it o ffers a more efficient solution compared to traditional techniques based on propositional satisfiability.- 26 January 2026
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 36 (2)
Open AccessTowards ILP-based LTLf passive learning
Inferring linear temporal logic over finite traces ($\text{LTL}_{\text{f}}$) formulas from a set of example traces, known as passive learning, presents significant challenges due to its combinatorial nature. In this paper, we introduce a novel approach to $\text{LTL}_{\text{f}}$ passive learning based on inductive logic programming (ILP), leveraging the inductive learning of answer set programs framework. Our ILP-based method effectively exploits the set of example traces to guide the learning process, and experimental results demonstrate that it o ffers a more efficient solution compared to traditional techniques based on propositional satisfiability. - Open Access
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 5, 4500-4508
Are Large Language Models Fluent in Declarative Process Mining?
Recent advancements in AI have made LLMs valuable tools for automating the interpretation of textual descriptions of business processes and for converting formal process specifications into natural language. However, there are no practical methodologies or systematic assessments to ensure these automatic translations are faithful. This paper proposes a novel approach, based on an auxiliary bidirectional translation task, to assess LLMs performance quantitatively; also, it also empirically evaluates the performance of state-of-the-art LLMs for bidirectional translations between natural language and declarative formal process specifications. The results reveal substantial variability in performance among the LLMs, highlighting the importance of LLM selection and confirming the need for a robust method for assessing LLMs' outputs.
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 5, 4500-4508
Open AccessAre Large Language Models Fluent in Declarative Process Mining?
Recent advancements in AI have made LLMs valuable tools for automating the interpretation of textual descriptions of business processes and for converting formal process specifications into natural language. However, there are no practical methodologies or systematic assessments to ensure these automatic translations are faithful. This paper proposes a novel approach, based on an auxiliary bidirectional translation task, to assess LLMs performance quantitatively; also, it also empirically evaluates the performance of state-of-the-art LLMs for bidirectional translations between natural language and declarative formal process specifications. The results reveal substantial variability in performance among the LLMs, highlighting the importance of LLM selection and confirming the need for a robust method for assessing LLMs' outputs.
- Open Access
- 20 June 2025
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 15 (1) , 1-19
Logic-based analysis of fake news diffusion on social media
- 20 June 2025
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 15 (1) , 1-19
Open AccessLogic-based analysis of fake news diffusion on social media
- 28 March 2025
- Published by Springer Nature
- p. 221-232
Characterize Fake News Diffusion Patterns Using Temporal Logic Rules
- 28 March 2025
- Published by Springer Nature
- p. 221-232
Characterize Fake News Diffusion Patterns Using Temporal Logic Rules
- Open Access
- 1 January 2025
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 25 (1) , 92-131
Direct Encoding of Declare Constraints in ASP
Answer set programming (ASP), a well-known declarative logic programming paradigm, has recently found practical application in Process Mining. In particular, ASP has been used to model tasks involving declarative specifications of business processes. In this area, Declare stands out as the most widely adopted declarative process modeling language, offering a means to model processes through sets of constraints valid traces must satisfy, that can be expressed in linear temporal logic over finite traces (LTL $_{\text {f}}$ ). Existing ASP-based solutions encode Declare constraints by modeling the corresponding LTL $_{\text {f}}$ formula or its equivalent automaton which can be obtained using established techniques. In this paper, we introduce a novel encoding for Declare constraints that directly models their semantics as ASP rules, eliminating the need for intermediate representations. We assess the effectiveness of this novel approach on two Process Mining tasks by comparing it with alternative ASP encodings and a Python library for Declare.- 1 January 2025
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 25 (1) , 92-131
Open AccessDirect Encoding of Declare Constraints in ASP
Answer set programming (ASP), a well-known declarative logic programming paradigm, has recently found practical application in Process Mining. In particular, ASP has been used to model tasks involving declarative specifications of business processes. In this area, Declare stands out as the most widely adopted declarative process modeling language, offering a means to model processes through sets of constraints valid traces must satisfy, that can be expressed in linear temporal logic over finite traces (LTL $_{\text {f}}$ ). Existing ASP-based solutions encode Declare constraints by modeling the corresponding LTL $_{\text {f}}$ formula or its equivalent automaton which can be obtained using established techniques. In this paper, we introduce a novel encoding for Declare constraints that directly models their semantics as ASP rules, eliminating the need for intermediate representations. We assess the effectiveness of this novel approach on two Process Mining tasks by comparing it with alternative ASP encodings and a Python library for Declare. - Open Access
Direct Encoding of Declare Constraints in ASP
Answer Set Programming (ASP), a well-known declarative logic programming paradigm, has recently found practical application in Process Mining. In particular, ASP has been used to model tasks involving declarative specifications of business processes. In this area, Declare stands out as the most widely adopted declarative process modeling language, offering a means to model processes through sets of constraints valid traces must satisfy, that can be expressed in Linear Temporal Logic over Finite Traces (LTLf). Existing ASP-based solutions encode Declare constraints by modeling the corresponding LTLf formula or its equivalent automaton which can be obtained using established techniques. In this paper, we introduce a novel encoding for Declare constraints that directly models their semantics as ASP rules, eliminating the need for intermediate representations. We assess the effectiveness of this novel approach on two Process Mining tasks by comparing it with alternative ASP encodings and a Python library for Declare. Under consideration in Theory and Practice of Logic Programming (TPLP).
Open AccessDirect Encoding of Declare Constraints in ASP
Answer Set Programming (ASP), a well-known declarative logic programming paradigm, has recently found practical application in Process Mining. In particular, ASP has been used to model tasks involving declarative specifications of business processes. In this area, Declare stands out as the most widely adopted declarative process modeling language, offering a means to model processes through sets of constraints valid traces must satisfy, that can be expressed in Linear Temporal Logic over Finite Traces (LTLf). Existing ASP-based solutions encode Declare constraints by modeling the corresponding LTLf formula or its equivalent automaton which can be obtained using established techniques. In this paper, we introduce a novel encoding for Declare constraints that directly models their semantics as ASP rules, eliminating the need for intermediate representations. We assess the effectiveness of this novel approach on two Process Mining tasks by comparing it with alternative ASP encodings and a Python library for Declare. Under consideration in Theory and Practice of Logic Programming (TPLP).
- Open Access
- 16 October 2024
- Published by IOS Press
- p. 2322-2329
Bipartite Time Series Network for Data Imputation
The pervasive issue of missing data in statistical analysis and data science significantly impacts the integrity and accuracy of Time-Series Cross-Sectional (TSCS) datasets, extensively used in domains like health sciences and sensor applications. Traditional imputation methods are often inadequate for these datasets as they fail to address the complexities arising from cross-sectional and temporal data gaps. This paper introduces BiTSNet (Bipartite Time Series Network for Data Imputation), a novel approach designed to tackle the unique challenges of TSCS datasets by leveraging a dual representation of data. BiTSNet models cross-sectional time series data as sequences of bipartite graphs, where each graph represents a specific time step, and feature values are depicted as edge weights. Thus, missing values are interpreted as missing edge feature values, allowing BiTSNet to comprehensively capture spatial relationships within each time step and temporal relationships across steps. The framework uses Graph Neural Networks (GNNs) to process spatial dependencies within these bipartite graph representations and employs Recurrent Neural Networks (RNNs) to handle temporal dependencies. This integration enables BiTSNet to learn the intricate intra-time step relationships and the inter-time step dynamics effectively. Our approach not only preserves the longitudinal and cross-sectional integrity of the data but also ensures the production of valid and insightful conclusions from the enriched dataset. We evaluated BiTSNet on several datasets and compared it against the state-of-the-art approaches with encouraging results.
- 16 October 2024
- Published by IOS Press
- p. 2322-2329
Open AccessBipartite Time Series Network for Data Imputation
The pervasive issue of missing data in statistical analysis and data science significantly impacts the integrity and accuracy of Time-Series Cross-Sectional (TSCS) datasets, extensively used in domains like health sciences and sensor applications. Traditional imputation methods are often inadequate for these datasets as they fail to address the complexities arising from cross-sectional and temporal data gaps. This paper introduces BiTSNet (Bipartite Time Series Network for Data Imputation), a novel approach designed to tackle the unique challenges of TSCS datasets by leveraging a dual representation of data. BiTSNet models cross-sectional time series data as sequences of bipartite graphs, where each graph represents a specific time step, and feature values are depicted as edge weights. Thus, missing values are interpreted as missing edge feature values, allowing BiTSNet to comprehensively capture spatial relationships within each time step and temporal relationships across steps. The framework uses Graph Neural Networks (GNNs) to process spatial dependencies within these bipartite graph representations and employs Recurrent Neural Networks (RNNs) to handle temporal dependencies. This integration enables BiTSNet to learn the intricate intra-time step relationships and the inter-time step dynamics effectively. Our approach not only preserves the longitudinal and cross-sectional integrity of the data but also ensures the production of valid and insightful conclusions from the enriched dataset. We evaluated BiTSNet on several datasets and compared it against the state-of-the-art approaches with encouraging results.