11 citations · 56 across the 25 of their papers we have counts for
9 papers · 1 filter
Program Semantics and a Verification Technique for Knowledge-Based Multi-Agent Systems
Francesco Belardinelli, Ioana Boureanu, Vadim Malvone +1
We give a relational and a weakest precondition semantics for "knowledge-based programs", i.e., programs that restrict observability of variables so as to richly express changes in…
A Sahlqvist-style Correspondence Theorem for Linear-time Temporal Logic
Rui Li, Francesco Belardinelli
The language of modal logic is capable of expressing first-order conditions on Kripke frames. The classic result by Henrik Sahlqvist identifies a significant class of modal formula…
Model Checking Strategic Abilities in Information-sharing Systems
Francesco Belardinelli, Ioana Boureanu, Catalin Dima +1
We introduce a subclass of concurrent game structures (CGS) with imperfect information in which agents are endowed with private data-sharing capabilities. Importantly, our CGSs are…
A Hennessy-Milner Theorem for ATL with Imperfect Information
Francesco Belardinelli, Catalin Dima, Vadim Malvone +1
We show that a history-based variant of alternating bisimulation with imperfect information allows it to be related to a variant of Alternating-time Temporal Logic (ATL) with imper…
Formal Verification of Debates in Argumentation Theory
Ria Jha, Francesco Belardinelli, Francesca Toni
Humans engage in informal debates on a daily basis. By expressing their opinions and ideas in an argumentative fashion, they are able to gain a deeper understanding of a given prob…
Social Choice Methods for Database Aggregation
Francesco Belardinelli, Umberto Grandi
Knowledge can be represented compactly in multiple ways, from a set of propositional formulas, to a Kripke model, to a database. In this paper we study the aggregation of informati…