Cecilia Di Florio

Cecilia Di Florio

Auto-generated profile, based on publicly available information

Cecilia Di Florio

University of Bologna

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 January 2023 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
FGFrancesco Gavazzo
Francesco Gavazzo
CFCecilia Di Florio
Cecilia Di Florio
We introduce a general theory of quantitative and metric rewriting systems, namely systems with a rewriting relation enriched over quantales modelling abstract quantities. We develop theories of abstract and term-based systems, refining cornerstone results of rewriting theory (such as Newman’s Lemma, Church-Rosser Theorem, and critical pair-like lemmas) to a metric and quantitative setting. To avoid distance trivialisation and lack of confluence issues, we introduce non-expansive, linear term rewriting systems, and then generalise the latter to the novel class of graded term rewriting systems. These systems make quantitative rewriting modal and context-sensitive, this way endowing rewriting with coeffectful behaviours.

24 September 2023
Verified
Book Chapter
Closed access
PDF file
CFCecilia Di Florio
Cecilia Di Florio
ARAntonino Rotolo
Antonino Rotolo
GGGuido Governatori
Guido Governatori
GSGiovanni Sartor
Giovanni Sartor

11 September 2024
Verified
Book Chapter
Closed access
PDF file
CFCecilia Di Florio
Cecilia Di Florio
ARAntonino Rotolo
Antonino Rotolo

16 June 2025
Verified
Conference Paper
Open access
ARAntonino Rotolo
Antonino Rotolo
CFCecilia Di Florio
Cecilia Di Florio
GGGuido Governatori
Guido Governatori

15 October 2025 in arXiv
Verified
Preprint
Open access
PDF file
CFCecilia Di Florio
Cecilia Di Florio
HDHuimin Dong
Huimin Dong
ARAntonino Rotolo
Antonino Rotolo
Logic-based models can be used to build verification tools for machine learning classifiers employed in the legal field. ML classifiers predict the outcomes of new cases based on previous ones, thereby performing a form of case-based reasoning (CBR). In this paper, we introduce a modal logic of classifiers designed to formally capture legal CBR. We incorporate principles for resolving conflicts between precedents, by introducing into the logic the temporal dimension of cases and the hierarchy of courts within the legal system.

11 July 2023 in arXiv
Verified
Preprint
Open access
PDF file
CFCecilia Di Florio
Cecilia Di Florio
GGGuido Governatori
Guido Governatori
ARAntonino Rotolo
Antonino Rotolo
GSGiovanni Sartor
Giovanni Sartor
This paper examines how a notion of stable explanation developed elsewhere in Defeasible Logic can be expressed in the context of formal argumentation. With this done, we discuss the deontic meaning of this reconstruction and show how to build from argumentation neighborhood structures for deontic logic where this notion of explanation can be characterised. Some direct complexity results are offered.