Search Results for author:
Found 9 papers, 1 papers with code
A Logic for Reasoning About Aggregate-Combine Graph Neural Networks
We also show that a broad class of GNNs can be transformed efficiently into a formula, thus significantly improving upon the literature about the logical expressiveness of GNNs.
Base-based Model Checking for Multi-Agent Only Believing (long version)
We present a novel semantics for the language of multi-agent only believing exploiting belief bases, and show how to use it for automatically checking formulas of this language and of its dynamic extension with private belief expansion operators.
A Modal Logic for Explaining some Graph Neural Networks
In this paper, we propose a modal logic in which counting modalities appear in linear inequalities.
On simple expectations and observations of intelligent agents: A complexity study
Public observation logic (POL) reasons about agent expectations and agent observations in various real world situations.
On verifying expectations and observations of intelligent agents
Public observation logic (POL) is a variant of dynamic epistemic logic to reason about agent expectations and agent observations.
Conflict-Based Search for Connected Multi-Agent Path Finding
We study a variant of the multi-agent path finding problem (MAPF) in which agents are required to remain connected to each other and to a designated base.
Dynamic Epistemic Logic Games with Epistemic Temporal Goals
Dynamic Epistemic Logic (DEL) is a logical framework in which one can describe in great detail how actions are perceived by the agents, and how they affect the world.
Reachability and Coverage Planning for Connected Agents: Extended Version
We study the theoretical complexity of the reachability and the coverage problems of a fleet of connected agents on various classes of topological graphs.
Dynamic Gossip
We define six such distributed dynamic gossip protocols, and we characterize them in terms of the topology of the graphs on which they are successful, wherein we distinguish strong success (the protocol always terminates, possibly assuming fair scheduling) from weak success (the protocol sometimes terminates).
Discrete Mathematics
