Stefano Bonzio

dblp:185/7696 · DBLP profile ↗
← Back
10ranked-venue papers
8as first author
6since 2021 · last 2025
0000-0002-5959-5868ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 4 first-author · 3 since 2021Theory of computation · 5 · 4 first-author · 4 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021
YearPublicationVenuePosition
2025 Certified Algorithms for Numerical Semigroups in Rocq
Massimo Bartoletti, Stefano Bonzio, Marco Ferrara
CICM2
2025 Modal weak Kleene logics: axiomatizations and relational semantics
abstract
Abstract Weak Kleene logics are three-valued logics characterized by the presence of an infectious truth-value. In their external versions, as they were originally introduced by Bochvar [4] and Halldén [30], these systems are equipped with an additional connective capable of expressing whether a formula is classically true. In this paper we further expand the expressive power of external weak Kleen logics by modalizing them with a unary operator. The addition of an alethic modality gives rise to the two systems $\textsf{B}_{\text{e}}^{\square }$ and $\textsf{PWK}^{\Box }_{\text{e}} $, which have two different readings of the modal operator. We provide these logics with a complete and decidable Hilbert-style axiomatization w.r.t. a three-valued possible worlds semantics. The starting point of these calculi are new axiomatizations for the non-modal bases $\textsf{B}_{\text{e}}$ and $\textsf{PWK}_{\text{e}}$, which we provide using the recent algebraization results about these two logics. In particular, we prove the algebraizability of $\textsf{PWK}_{\text{e}}$. Finally some standard extensions of the basic modal systems are provided with their completeness results w.r.t. special classes of frames.
Stefano Bonzio, Nicolò Zamperlin
J. Log. Comput.1
2024 On the Structure of Balanced Residuated Partially Ordered Monoids
Stefano Bonzio, José Gil-Férez, Peter Jipsen, Adam Prenosil, Melissa Sugimoto
RAMiCS1
2023 Counterfactuals as modal conditionals, and their probability
abstract
In this paper we propose a semantic analysis of Lewis' counterfactuals. By exploiting the structural properties of the recently introduced boolean algebras of conditionals, we show that counterfactuals can be expressed as formal combinations of a conditional object and a normal necessity modal operator. Specifically, we introduce a class of algebras that serve as modal expansions of boolean algebras of conditionals, together with their dual relational structures. Moreover, we show that Lewis' semantics based on sphere models can be reconstructed in this framework. As a consequence, we establish the soundness and completeness of a slightly stronger variant of Lewis' logic for counterfactuals with respect to our algebraic models. In the second part of the paper, we present a novel approach to the probability of counterfactuals showing that it aligns with the uncertainty degree assigned by a belief function, as per Dempster-Shafer theory, to its associated conditional formula. Furthermore, we characterize the probability of a counterfactual in terms of Gärdenfors' imaging rule for the probabilistic update.
Giuliano Rosella, Tommaso Flaminio, Stefano Bonzio
Artif. Intell.3
2022 Containment logics: Algebraic Counterparts and Reduced Models
abstract
Abstract The containment companion of a logic $\vdash $ consists of the consequence relation $\vdash ^{r}$ which satisfies all the inferences of $\vdash $, where the variables of the conclusion are contained into those of the set of premises, in case this is not inconsistent. Following the algebraic analysis started in Bonzio and Pra Baldi (2021, Studia Logica, 109, 969–994), this paper characterizes the algebraic counterpart of a finitary containment logic $\vdash ^{r}$ and investigates the structure of the Leibniz and Suszko reduced models. The analysis is carried within the framework of abstract algebraic logic.Mathematics Subject Classification: Primary: 03G27. Secondary: 03G25
Stefano Bonzio, Michele Pra Baldi
J. Log. Comput.1
2021 Probability over Płonka sums of Boolean algebras: States, metrics and topology
abstract
The paper introduces the notion of state for involutive bisemilattices, a variety which plays the role of algebraic counterpart of weak Kleene logics and whose elements are represented as Płonka sums of Boolean algebras. We investigate the relations between states over an involutive bisemilattice and probability measures over the (Boolean) algebras in the Płonka sum representation and, the direct limit of these algebras. Moreover, we study the metric completion of involutive bisemilattices, as pseudometric spaces, and the topology induced by the pseudometric.
Stefano Bonzio, Andrea Loi
Int. J. Approx. Reason.1
2019 Sure-Wins Under Coherence: A Geometrical Perspective
Stefano Bonzio, Tommaso Flaminio, Paolo Galeazzi
ECSQARU1
2018 Counting Finite Linearly Ordered Involutive Bisemilattices
Stefano Bonzio, Michele Pra Baldi, Diego Valota
RAMiCS1
2017 The rhythm of quantum algorithms
Stefano Bonzio, Paola Verrucchi
Soft Comput.1
2016 Orthogonal relational systems
Stefano Bonzio, Ivan Chajda, Antonio Ledda
Soft Comput.1