Giorgio Cignarale

Giorgio Cignarale

We introduce the Deontic Action Model Logic (DAML), a dynamic modal framework for reasoning about obligations over actions in multi-agent systems. DAML extends the epistemic Action Model Logic by incorporating deontic evaluation mechanisms that assess agents' actions in terms of both the desirability and the likelihood of their outcomes. Obligations arise for those actions that maximize expected deontic value among an agent's available alternatives at a given decision point, yielding a formal account for reasoning about conditional and context-sensitive obligations in settings involving strategic interaction and incomplete information. DAML supports principled action selection in norm-governed multi-agent systems, and is the first such framework to derive these obligations using the action model logic machinery. We provide an axiomatization of the logic and prove soundness and completeness with respect to its semantics. Finally, we demonstrate the expressive power of our framework through applications to the Miners' Puzzle and other multi-agent deontic scenarios.

Giorgio Cignarale, Hugo Rincon Galeana

In this paper we introduce the novel Deontic Simplicial Logic (DSL), a deontic logic for group obligations based on simplicial complexes. We provide the first deontic interpretation of simplicial models in which vertices represent individual commitments and higher-dimensional simplices represent joint obligations of groups of agents. We further extend DSL to the Dynamic Deontic Simplicial Logic (DDSL), resulting in the first dynamic logic based on simplicial complexes. DDSL models agents' choices among mutually exclusive commitments and captures the effects of individual and joint actions via update operations on simplicial models. We prove soundness and completeness for both the static and dynamic deontic simplicial logics. We motivate our results with multiple examples, both in the static and dynamic settings.

Giorgio Cignarale, Hans van Ditmarsch, Stephan Felber et al.

We investigate self-correcting gossip protocols with errors. In distributed computing, protocols with errors have been widely investigated in temporal epistemic logics. Instead, we propose a dynamic epistemic logic. We show how to correct transmission errors due to faulty messages without a central authority coordinating protocol execution, how this affects optimality, and how this compares to bounded memory and full information protocols.