arXiv subjects

Enrico Santi

Publications and source records attributed to Enrico Santi.

3 recordsLinked to original sources

arXiv2026

Explaining Weather Bulletins via ILP

Inductive Logic Programming (ILP) originated within the Logic Programming community in the Nineties as a framework for combining symbolic learning with declarative knowledge representation. Nowadays, mature ILP frameworks exist and they are capable of learning complex, non-monotonic hypotheses, thus broadening both the modeling capabilities and the scope of real-world applications of ILP. This work is primarily based on the FastLAS2 framework and aims to generate simple, interpretable hypotheses to help clarify the weather bulletins issued by OSMER FVG, the Regional Meteorological Observatory of the Italian region of Friuli Venezia-Giulia. In this paper we present a pipeline that, starting from simulated meteorological raw data and from OSMERs' bulletins (used as ground truth), extracts data as ASP facts and generates ILP examples. From such examples an explanatory hypothesis is then inferred via FastLAS2. Such a hypothesis (translated into natural language) explains the weather forecast issued by human experts, and in particular the rationale behind experts' choices of specific symbols in the bulletin pictogram (the symbol-annotated meteorological map of the forecast). The proposed approach is general, not specific to any particular region and it can equally be applied to bulletins from other sources and to different regions.

cs.AI↗

arXiv2025

New functionalities in MatCont: delay equations and Lyapunov exponents

MatCont is a powerful toolbox for numerical bifurcation analysis focussing on smooth ODEs. A user can study equilibria, periodic and connecting orbits, and their stability and bifurcations. Here, we report on additional features in version 7p6. The first is a delay equation importer enabling MatCont users to study a much larger class of models, namely delay equations with finite delay (including delay differential and renewal equations). This importer translates the delay equation into a system of ODEs using a pseudospectral approximation with an order specified by the user. We also implemented Lyapunov exponent computations, event functions for Poincaré maps, and enhanced homoclinic continuation. We demonstrate these features with test cases, such as the Mackey-Glass equation and a renewal equation, and provide additional examples in online tutorials.

math.DS↗

arXiv2025

GPU Accelerated Compact-Table Propagation

Constraint Programming developed within Logic Programming in the Eighties; nowadays all Prolog systems encompass modules capable of handling constraint programming on finite domains demanding their solution to a constraint solver. This work focuses on a specific form of constraint, the so-called table constraint, used to specify conditions on the values of variables as an enumeration of alternative options. Since every condition on a set of finite domain variables can be ultimately expressed as a finite set of cases, Table can, in principle, simulate any other constraint. These characteristics make Table one of the most studied constraints ever, leading to a series of increasingly efficient propagation algorithms. Despite this, it is not uncommon to encounter real-world problems with hundreds or thousands of valid cases that are simply too many to be handled effectively with standard CPU-based approaches. In this paper, we deal with the Compact-Table (CT) algorithm, the state-of-the-art propagation algorithms for Table. We describe how CT can be enhanced by exploiting the massive computational power offered by modern GPUs to handle large Table constraints. In particular, we report on the design and implementation of GPU-accelerated CT, on its integration into an existing constraint solver, and on an experimental validation performed on a significant set of instances.

cs.AI↗