Agata Ciabattoni
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Agata Ciabattoni has a total of 101 co-authors. Here are the top co-authors by number of shared publications:
- Matthias Baaz
TU Wien
13 shared publications - Revantha Ramanayake
University of Groningen
9 shared publications - Björn Lellmann
TU Wien
5 shared publications George Metcalfe
5 shared publicationsKazushige Terui
5 shared publicationsLara Spendier
Vienna University of Technology, Wien, Austria
5 shared publications
Latest Publications
- Open Access
- 14 August 2026
- Published by Elsevier in SSRN Electronic Journal
Two Logics, One Trust: A Support-Based Conditional Approach
We introduce a framework for formalising computational trust, featuring two distinct logics that combine doxastic modalities with two variants of a conditional support connective that captures positive support between statements. The two variants differ in interpretation: one admits a subjective likelihoodreading, while the other has a conditional-probability flavour and validates cautious monotonicity, a central principle in non-monotonic reasoning. We provide axiomatisations, semantics, and complexity analysis, supported by illustrative examples. Unlike existing approaches, our framework integrates multiple factors into the emergence of computational trust.
- 14 August 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessTwo Logics, One Trust: A Support-Based Conditional Approach
We introduce a framework for formalising computational trust, featuring two distinct logics that combine doxastic modalities with two variants of a conditional support connective that captures positive support between statements. The two variants differ in interpretation: one admits a subjective likelihoodreading, while the other has a conditional-probability flavour and validates cautious monotonicity, a central principle in non-monotonic reasoning. We provide axiomatisations, semantics, and complexity analysis, supported by illustrative examples. Unlike existing approaches, our framework integrates multiple factors into the emergence of computational trust.
- Open Access
- 24 July 2026
- Published by Springer Nature
- p. 455-464
SMT-Based Deontic Reasoning for Åqvist Logics
Building on the small-model constructions for Åqvist’s deontic logics introduced in [24], we present Deo-SMT , an SMT-based reasoner implemented in Z3 for checking validity and generating countermodels. Deo-SMT covers all four of Åqvist’s logics ( E , F , F+(CM) , G ) and provides countermodel visualizations as text, matrices, and directed graphs. Our tool outperforms the existing Isabelle/HOL approach, while providing a lightweight and accessible interface for normative reasoning.
- 24 July 2026
- Published by Springer Nature
- p. 455-464
Open AccessSMT-Based Deontic Reasoning for Åqvist Logics
Building on the small-model constructions for Åqvist’s deontic logics introduced in [24], we present Deo-SMT , an SMT-based reasoner implemented in Z3 for checking validity and generating countermodels. Deo-SMT covers all four of Åqvist’s logics ( E , F , F+(CM) , G ) and provides countermodel visualizations as text, matrices, and directed graphs. Our tool outperforms the existing Isabelle/HOL approach, while providing a lightweight and accessible interface for normative reasoning.
- Open Access
- 23 April 2026
- Published by Elsevier in SSRN Electronic Journal
Toward Robust Legal Text Formalization into Defeasible Deontic Logic Using LLMs
We present a comprehensive approach to the automated formalization of legal texts using large language models (LLMs), into Defeasible Deontic Logic (DDL). Our method employs a structured pipeline that segments complex normative language into atomic snippets, extracts DDL rules, and evaluates them for syntactic and semantic coherence. We introduce a success metric that captures the completeness of formalizations, and a novel two-stage pipeline with a dedicated refinement step to improve logical consistency and coverage. We compare results across multiple LLM configurations, including newly released models and various prompting strategies. We discuss limitations arising from gold-standard dependence and implicit legal obligations, highlighting trade-offs between textual fidelity and normative completeness.Experiments on legal norms from the Australian Telecommunications Consumer Protections Code demonstrate that, when guided effectively, LLMs can produce formalizations that align closely with expert-crafted representations, underscoring their potential for scalable legal informatics.
- 23 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessToward Robust Legal Text Formalization into Defeasible Deontic Logic Using LLMs
We present a comprehensive approach to the automated formalization of legal texts using large language models (LLMs), into Defeasible Deontic Logic (DDL). Our method employs a structured pipeline that segments complex normative language into atomic snippets, extracts DDL rules, and evaluates them for syntactic and semantic coherence. We introduce a success metric that captures the completeness of formalizations, and a novel two-stage pipeline with a dedicated refinement step to improve logical consistency and coverage. We compare results across multiple LLM configurations, including newly released models and various prompting strategies. We discuss limitations arising from gold-standard dependence and implicit legal obligations, highlighting trade-offs between textual fidelity and normative completeness.Experiments on legal norms from the Australian Telecommunications Consumer Protections Code demonstrate that, when guided effectively, LLMs can produce formalizations that align closely with expert-crafted representations, underscoring their potential for scalable legal informatics.
- 15 December 2025
- Published by Springer Nature
- p. 585-603
From Explicit Allowances to Defeasible Deontic Operators: A Modal View
- 15 December 2025
- Published by Springer Nature
- p. 585-603
From Explicit Allowances to Defeasible Deontic Operators: A Modal View
- 12 November 2025
- Published by Springer Nature
- p. 51-66
Open AccessA Bayesian View of the Result Model
- Open Access
- 25 September 2025
- Published by Springer Nature
- p. 220-237
Analytic Proofs for Tense Logic
The first algorithm to transform a proof in Nishimura’s sequent calculus $$\textbf{GKt}$$ for tense logic $$\textbf{Kt}$$ into an analytic proof of the same sequent is presented. In an analytic proof, every rule instance is analytic i.e., each formula in every premise is a subformula of some formula in its conclusion. We call this algorithm analytic restriction to convey that it extends analytic cut-restriction where just the cut-rule instances are made analytic. This distinction is essential in tense logic since cut and modal rules can both cause non-analyticity. Analytic cut-restriction is itself an extension of cut-elimination so our work contributes to a broader program of transforming arbitrary sequent proofs into ones constructed from a designated set of formulas—not necessarily subformulas. As with cut-elimination, the aim is to limit the proof search space and support proof-theoretic and meta-logical investigations.- 25 September 2025
- Published by Springer Nature
- p. 220-237
Open AccessAnalytic Proofs for Tense Logic
The first algorithm to transform a proof in Nishimura’s sequent calculus $$\textbf{GKt}$$ for tense logic $$\textbf{Kt}$$ into an analytic proof of the same sequent is presented. In an analytic proof, every rule instance is analytic i.e., each formula in every premise is a subformula of some formula in its conclusion. We call this algorithm analytic restriction to convey that it extends analytic cut-restriction where just the cut-rule instances are made analytic. This distinction is essential in tense logic since cut and modal rules can both cause non-analyticity. Analytic cut-restriction is itself an extension of cut-elimination so our work contributes to a broader program of transforming arbitrary sequent proofs into ones constructed from a designated set of formulas—not necessarily subformulas. As with cut-elimination, the aim is to limit the proof search space and support proof-theoretic and meta-logical investigations. - Open Access
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 5, 4615-4623
Combining MORL with Restraining Bolts to Learn Normative Behaviour
Normative Restraining Bolts (NRBs) adapt the restraining bolt technique (originally developed for safe reinforcement learning) to ensure compliance with social, legal, and ethical norms. While effective, NRBs rely on trial-and-error weight tuning, which hinders their ability to enforce hierarchical norms; moreover, norm updates require retraining. In this paper, we reformulate learning with NRBs as a multi-objective reinforcement learning (MORL) problem, where each norm is treated as a distinct objective. This enables the introduction of Ordered Normative Restraining Bolts (ONRBs), which support algorithmic weight selection, prioritized norms, norm updates, and provide formal guarantees on minimizing norm violations. Case studies show that ONRBs offer a robust and principled foundation for RL-agents to comply with a wide range of norms while achieving their goals.
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 5, 4615-4623
Open AccessCombining MORL with Restraining Bolts to Learn Normative Behaviour
Normative Restraining Bolts (NRBs) adapt the restraining bolt technique (originally developed for safe reinforcement learning) to ensure compliance with social, legal, and ethical norms. While effective, NRBs rely on trial-and-error weight tuning, which hinders their ability to enforce hierarchical norms; moreover, norm updates require retraining. In this paper, we reformulate learning with NRBs as a multi-objective reinforcement learning (MORL) problem, where each norm is treated as a distinct objective. This enables the introduction of Ordered Normative Restraining Bolts (ONRBs), which support algorithmic weight selection, prioritized norms, norm updates, and provide formal guarantees on minimizing norm violations. Case studies show that ONRBs offer a robust and principled foundation for RL-agents to comply with a wide range of norms while achieving their goals.
- Open Access
- 19 May 2025
- Published by Springer Nature in Journal of Philosophical Logic
- Vol. 54 (3) , 651-689
Mīmāṃsā on ‘better-not’ Permissions
The traditional definition of permission as the dual of obligation oversimplifies its many applications, often yielding undesirable consequences. Recent literature recognizes the need to distinguish various types of permissions but often overlooks potential preferences associated with them. In contrast, the Sanskrit philosophical school of Mīmāṃsā refutes the interdefinability of deontic concepts, and asserts that permissions always refer to less desirable actions (‘better-not’ permissions), and are exceptions to prohibitions or negative obligations. This article analyzes the concept of Mīmāṃsā permission, compares it with contemporary theories and formalizes it while carefully preserving its essential characteristics. We transform Mīmāṃsā’s reasoning principles for permission into Hilbert axioms and introduce neighbourhood semantics, incorporating ceteris-paribus preferences. The resulting logic is evaluated against various paradoxes from contemporary deontic logic and applied to a scenario from Sanskrit jurisprudence.
- 19 May 2025
- Published by Springer Nature in Journal of Philosophical Logic
- Vol. 54 (3) , 651-689
Open AccessMīmāṃsā on ‘better-not’ Permissions
The traditional definition of permission as the dual of obligation oversimplifies its many applications, often yielding undesirable consequences. Recent literature recognizes the need to distinguish various types of permissions but often overlooks potential preferences associated with them. In contrast, the Sanskrit philosophical school of Mīmāṃsā refutes the interdefinability of deontic concepts, and asserts that permissions always refer to less desirable actions (‘better-not’ permissions), and are exceptions to prohibitions or negative obligations. This article analyzes the concept of Mīmāṃsā permission, compares it with contemporary theories and formalizes it while carefully preserving its essential characteristics. We transform Mīmāṃsā’s reasoning principles for permission into Hilbert axioms and introduce neighbourhood semantics, incorporating ceteris-paribus preferences. The resulting logic is evaluated against various paradoxes from contemporary deontic logic and applied to a scenario from Sanskrit jurisprudence.
- Open Access
- 8 January 2025
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 54 (1) , 59-151
Internal and External Calculi: Ordering the Jungle without Being Lost in Translations
This paper gives a broad account of the various sequent-based proof formalisms in the proof-theoretic literature. We consider formalisms for various modal and tense logics, intuitionistic logic, conditional logics, and bunched logics. After providing an overview of the logics and proof formalisms under consideration, we show how these sequent-based formalisms can be placed in a hierarchy in terms of the underlying data structure of the sequents. We then discuss how this hierarchy can be traversed using translations. Translating proofs up this hierarchy is found to be relatively straightforward while translating proofs down the hierarchy is substantially more difficult. Finally, we inspect the prevalent distinction in structural proof theory between ‘internal calculi’ and ‘external calculi.’ We discuss the ambiguities involved in the informal definitions of these categories, and we critically assess the properties that (calculi from) these classes are purported to possess.
- 8 January 2025
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 54 (1) , 59-151
Open AccessInternal and External Calculi: Ordering the Jungle without Being Lost in Translations
This paper gives a broad account of the various sequent-based proof formalisms in the proof-theoretic literature. We consider formalisms for various modal and tense logics, intuitionistic logic, conditional logics, and bunched logics. After providing an overview of the logics and proof formalisms under consideration, we show how these sequent-based formalisms can be placed in a hierarchy in terms of the underlying data structure of the sequents. We then discuss how this hierarchy can be traversed using translations. Translating proofs up this hierarchy is found to be relatively straightforward while translating proofs down the hierarchy is substantially more difficult. Finally, we inspect the prevalent distinction in structural proof theory between ‘internal calculi’ and ‘external calculi.’ We discuss the ambiguities involved in the informal definitions of these categories, and we critically assess the properties that (calculi from) these classes are purported to possess.