publications

2024

1. Neural-Symbolic Temporal Decision Trees for Multivariate Time Series Classification

   Giovanni Pagliarini, Simone Scaboro, Giuseppe Serra, and 2 more authors

   Information and Compution, 2024

   Abs HTML PDF

   Multivariate time series classification is an ubiquitous and widely studied problem. Due to their strong generalization capability, neural networks are suitable for this problem, but their intrinsic black-box nature often limits their applicability. Temporal decision trees are a relevant alternative to neural networks for the same task regarding classification performances while attaining higher levels of transparency and interpretability. In this work, we approach the problem of hybridizing these two techniques, and present three independent, natural hybridization solutions to study if, and in what measure, both the ability of neural networks to capture complex temporal patterns and the transparency and flexibility of temporal decision trees can be leveraged. To this end, we provide initial experimental results for several tasks in a binary classification setting, showing that our proposed neural-symbolic hybridization schemata may be a step towards accurate and interpretable models.

2. Fitting’s Style Many-Valued Interval Temporal Logic Tableau System: Theory and Implementation

   G. Badia, C. Noguera, A. Paparella, and 2 more authors

   In Proceedings of the 31st International Symposium on Temporal Representation and Reasoning, (TIME 2024), 2024
3. On Modal Logic Formulae Minimization

   G. Pagliarini, A. Paradiso, G. Sciavicco, and 1 more author

   In Proceedings of the 39th Italian Conference on Computational Logic (CILC 2024), 2024

2023

1. Foundations of Modal Symbolic Learning

   I.E. Stan

   University of Parma, 2023

   Abs HTML PDF

   Traditional symbolic learning is the sub-field of machine learning that aims to learn symbolic models from structured data, representing propositional logic theories, and its investigation initiated with the early days of artificial intelligence. Such an approach is yet outstanding in terms of academic performance (e.g., accuracy) and industrial one (e.g., interpretability, bias, ethical concerns) over modern techniques (e.g., deep neural networks) on structured data, but it suffers to natively address the problem of learning from unstructured data (e.g., time series, images, and graphs). By systematically exploiting inductive biases, we present the mathematical framework of modal symbolic learning for learning symbolically from unstructured data, which is the intersection between the fields of machine learning and modal logic(s) in terms of academic discipline. We study its properties from a learning perspective, enhancing standard decision trees, the quintessential expression of conventional symbolic learning, to learn modal logic theories. We demonstrate how modal data emerges from unstructured one to conduct modal symbolic learning. We experimentally prove how models learned with this framework are more accurate, precise, and sensible than classic propositional ones and at least comparable with those learned with non-symbolic ones. In addition, we show how our approach can be generalized from trees to more complex learning techniques (e.g., fuzzy and neural-symbolic trees), and we point to several ambitious and challenging directions in which modal symbolic learning, as a field, can expand. Modal symbolic learning is still in its infancy, and investigating its foundations allows a more organic and substantial development of the matter. Nevertheless, it has already shown enormous application potential, both theoretical (giving modal logic languages a new application field and fostering the study of new ones) and practical (symbolically addressing real-world problems and thus offering interpretable models for further research).

2. The voice of COVID-19: Breath and cough recording classification with temporal decision trees and random forests

   F. Manzella, G. Pagliarini, G. Sciavicco, and 1 more author

   Artificial Intelligence in Medicine, 2023

   Abs HTML PDF

   Symbolic learning is the logic-based approach to machine learning, and its mission is to provide algorithms and methodologies to extract logical information from data and express it in an interpretable way. Interval temporal logic has been recently proposed as a suitable tool for symbolic learning, specifically via the design of an interval temporal logic decision tree extraction algorithm. In order to improve their performances, interval temporal decision trees can be embedded into interval temporal random forests, mimicking the corresponding schema at the propositional level. In this article we consider a dataset of cough and breath sample recordings of volunteer subjects, labeled with their COVID-19 status, originally collected by the University of Cambridge. By interpreting such recordings as multivariate time series, we study the problem of their automated classification using interval temporal decision trees and forests. While this problem has been approached with the same dataset as well as with other datasets, in all cases, non-symbolic learning methods (usually, deep learning-based) have been applied to solve it; in this article we apply a symbolic approach, and show that it does not only outperform the state-of-the-art obtained with the same dataset, but its results are also superior to those of most non-symbolic techniques applied on other datasets. As an added bonus, thanks to the symbolic nature of our approach, we are also able to extract explicit knowledge to help physicians characterize typical COVID-positive cough and breath.

3. Fuzzy Halpern and Shoham’s interval temporal logics

   W. Conradie, D. Della Monica, E. Muñoz-Velasco, and 2 more authors

   Fuzzy Sets and Systems, 2023

   Abs HTML PDF

   The most representative interval temporal logic, called HS, was introduced by Halpern and Shoham in the nineties. Recently, HS has been proposed as a suitable formalism for modern artificial intelligence applications; however, when dealing with real-life data one is not always able to express temporal relations and propositional labels in a definite, crisp way. In this paper, following the seminal ideas of Fitting and Zadeh, we present a fuzzy generalization of HS, called FHS, that partially solves such problems of expressive power. We study FHS from both a theoretical and an application standpoint: first, we discuss its syntax, semantics, expressive power, and satisfiability problem; then, we define and solve the time series FHS finite model checking problem, to serve as the basis of future applications.

4. Statistical Rule Extraction for Gas Turbine Trip Prediction

   G. Bechini, E. Losi, L. Manservigi, and 4 more authors

   Journal of Engineering for Gas Turbines and Power, 2023

   Abs HTML PDF

   Gas turbine trip is an operational event that arises when undesirable operating conditions are approached or exceeded, and predicting its onset is a largely unexplored area. The application of novel artificial intelligence methods to this problem is interesting both from the computer science and the engineering point of view, and the results may be relevant in both the academia and the industry. In this paper, we consider data gathered from a fleet of Siemens industrial gas turbines in operation that includes several thermodynamic variables observed during a long period of operation. To assess the possibility of predicting trip events, we first apply a new, systematic statistical analysis to identify the most important variables, then we use a novel machine learning technique known as temporal decision tree, which differs from canonical decision tree because it allows a native treatment of the temporal component, and has an elegant logical interpretation that eases the posthoc validation of the results. Finally, we use the learned models to extract statistical rules. As a result, we are able to select the five most informative variables, build a predictive model with an average accuracy of 73%, and extract several rules. To our knowledge, this is the first attempt to use such an approach not only in the gas turbine field but also in the whole industry domain.

5. Efficient Modal Decision Trees

   F. Manzella, G. Pagliarini, G. Sciavicco, and 1 more author

   In Proceedings of the 32nd International Conference of the Italian Association for Artificial Intelligence (AIxIA 2023), 2023
6. A Post-Modern Approach to Automatic Metaphor Identification

   D. Del Fante, F. Manzella, G. Sciavicco, and 1 more author

   In Proceedings of the 9th Italian Conference on Computational Linguistics (CLIC-it 2023), 2023
7. Evolutionary Explainable Rule Extraction from (Modal) Random Forests

   M. Ghiotti, F. Manzella, G. Pagliarini, and 2 more authors

   In Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023), 2023
8. (Un)supervised Univariate Feature Extraction and Selection for Dimensional Data

   P. Cavina, F. Manzella, G. Pagliarini, and 2 more authors

   In Proceedings of the 2nd Italian Conference on Big Data and Data Science (ITADATA 2023), 2023
9. Heuristic Minimization Modulo Theory of Modal Decision Trees Class-Formulas

   G. Pagliarini, A. Paradiso, S. Rubin, and 2 more authors

   In Proceedings of the 5th Workshop on Artificial Intelligence and Formal Verification, Logic, Automata, and Synthesis (OVERLAY 2023), 2023
10. A Sound and Complete Tableau System for Fuzzy Halpern and Shoham’s Interval Temporal Logic

    W. Conradie, R. Monego, E. Muñoz-Velasco, and 2 more authors

    In Proceedings of the 30th International Symposium on Temporal Representation and Reasoning (TIME 2023), 2023

2022

1. Decision Trees with a Modal Flavor

   D. Della Monica, G. Pagliarini, G. Sciavicco, and 1 more author

   In In press in the Proceedings of the 21st International Conference of the Italian Association for Artificial Intelligence (AIxIA), 2022
2. On Modal Logic Association Rule Mining

   I.E. Stan, G. Sciavicco, E. Muñoz-Velasco, and 3 more authors

   In Proceedings of the 23rd Italian Conference on Theoretical Computer Science (ICTCS), 2022
3. Neural-Symbolic Temporal Decision Trees for Multivariate Time Series Classification

   G. Pagliarini, S. Scaboro, G. Serra, and 2 more authors

   In Proceedings of the 29th International Symposium on Temporal Representation and Reasoning (TIME), 2022

2021

1. Feature and Language Selection in Temporal Symbolic Regression for Interpretable Air Quality Modelling

   E. Lucena-Sánchez, G. Sciavicco, and I.E. Stan

   Algorithms, 2021

   Abs HTML PDF

   Air quality modelling that relates meteorological, car traffic, and pollution data is a fundamental problem, approached in several different ways in the recent literature. In particular, a set of such data sampled at a specific location and during a specific period of time can be seen as a multivariate time series, and modelling the values of the pollutant concentrations can be seen as a multivariate temporal regression problem. In this paper, we propose a new method for symbolic multivariate temporal regression, and we apply it to several data sets that contain real air quality data from the city of Wrocław (Poland). Our experiments show that our approach is superior to classical, especially symbolic, ones, both in statistical performances and the interpretability of the results.

2. Interval Temporal Random Forests with an Application to COVID-19 Diagnosis

   F. Manzella, G. Pagliarini, G. Sciavicco, and 1 more author

   In Proceedings of the 28th International Symposium on Temporal Representation and Reasoning (TIME), 2021
3. Multi-Frame Modal Symbolic Learning

   G. Pagliarini, G. Sciavicco, and I.E. Stan

   In Proceedings of the 3rd Workshop on Artificial Intelligence and Formal Verification, Logic, Automata, and Synthesis (OVERLAY), 2021

2020

1. Time Series Checking with Fuzzy Interval Temporal Logics

   W. Conradie, D. Della Monica, E. Muñoz-Velasco, and 2 more authors

   In Proceedings of the 21st Italian Conference on Theoretical Computer Science (ICTCS), 2020
2. Knowledge Extraction with Interval Temporal Logic Decision Trees

   G. Sciavicco, and I.E. Stan

   In Proceedings of the 27th International Symposium on Temporal Representation and Reasoning (TIME), 2020
3. Symbolic Learning with Interval Temporal Logic: the Case of Regression

   E. Lucena-Sánchez, G. Sciavicco, and I.E. Stan

   In Proceedings of the 2nd Workshop on Artificial Intelligence and Formal Verification, Logic, Automata (OVERLAY), 2020
4. Rule Extraction via Dynamic Discretization with an Application to Air Quality Modelling

   J. Kaminska, E. Lucena-Sánchez, G. Sciavicco, and 1 more author

   In Proceedings of the 14th International Rule Challenge, 4th Doctoral Consortium, and 6th Industry Track (RULE+RR), 2020
5. A Note on Ultimately-Periodic Finite Interval Temporal Logic Model Checking

   D. Della Monica, A. Montanari, G. Sciavicco, and 1 more author

   In Proceedings of the 2nd Workshop on Artificial Intelligence and Formal Verification, Logic, Automata (OVERLAY), 2020

2019

1. On coarser interval temporal logics

   E. Muñoz-Velasco, M. Pelegrı́n-Garcı́a, P. Sala, and 2 more authors

   Artificial Intelligence, 2019

   Abs HTML PDF

   The primary characteristic of interval temporal logic is that intervals, rather than points, are taken as the primitive ontological entities. Given their generally bad computational behavior of interval temporal logics, several techniques exist to produce decidable and computationally affordable temporal logics based on intervals. In this paper we take inspiration from Golumbic and Shamir’s coarser interval algebras, which generalize the classical Allen’s Interval Algebra, in order to define two previously unknown variants of Halpern and Shoham’s logic (HS) based on coarser relations. We prove that, perhaps surprisingly, the satisfiability problem for the coarsest of the two variants, namely HS3, not only is decidable, but PSpace-complete in the finite/discrete case, and PSpace-hard in any other case; besides proving its complexity bounds, we implement a tableau-based satisfiability checker for it and test it against a systematically generated benchmark. Our results are strengthened by showing that not all coarser-than-Allen’s relations are a guarantee of decidability, as we prove that the second variant, namely HS7, remains undecidable in all interesting cases.

2. Towards a General Method for Logical Rule Extraction from Time Series

   G. Sciavicco, I.E. Stan, and A. Vaccari

   In Proceedings of the 8th International Work-Conference on the Interplay Between Natural and Artificial Computation (IWINAC), 2019
3. Interval Temporal Logic Decision Tree Learning

   A. Brunello, G. Sciavicco, and I.E. Stan

   In Proceedings of the 16th European Conference on Logics in Artificial Intelligence (JELIA), 2019
4. Towards Interval Temporal Logic Rule-Based Classification

   E. Lucena-Sánchez, E. Muñoz-Velasco, G. Sciavicco, and 2 more authors

   In Proceedings of the 1st Workshop on Artificial Intelligence and Formal Verification, Logic, Automata, and Synthesis (OVERLAY), 2019

2017

1. Implementation of a Tableau-based Satisfiability Checker for HS3

   E. Muñoz-Velasco, G. Sciavicco, and I.E. Stan

   In Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science (ICTCS) and the 32nd Italian Conference on Computational Logic (CILC), 2017