10 citations · 24 across the 14 of their papers we have counts for
16 papers
Engineering Reliable Autonomous Systems: Challenges and Solutions
Marie Farrell, Matt Luckcuck, Angelo Ferrando +28
Engineering reliable autonomous systems is an important and growing topic in computer science. As autonomous systems become more prevalent, easy-to-use techniques for building them…
Temporal Causal Models as a Model of Computation
Maksim Gladyshev, Natasha Alechina, Brian Logan
Causal models, also known as Structural Equation Models (SEM), are a well-known formalism for representing and reasoning about causal dependencies between events. In this paper, we…
Pushdown Reward Machines for Reinforcement Learning
Giovanni Varricchione, Toryn Q. Klassen, Natasha Alechina +3
Reward machines (RMs) are automata structures that encode (non-Markovian) reward functions for reinforcement learning (RL). RMs can reward any behaviour representable in regular la…
Causes and Strategies in Multiagent Systems
Sylvia S. Kerkhove, Natasha Alechina, Mehdi Dastani
Causality plays an important role in daily processes, human reasoning, and artificial intelligence. There has however not been much research on causality in multi-agent strategic s…
Probabilistic Strategy Logic with Degrees of Observability
Chunyan Mu, Nima Motamed, Natasha Alechina +1
There has been considerable work on reasoning about the strategic ability of agents under imperfect information. However, existing logics such as Probabilistic Strategy Logic are u…
Temporal Causal Reasoning with (Non-Recursive) Structural Equation Models
Maksim Gladyshev, Natasha Alechina, Mehdi Dastani +2
Structural Equation Models (SEM) are the standard approach to representing causal dependencies between variables in causal models. In this paper we propose a new interpretation of…
Maximally Permissive Reward Machines
Giovanni Varricchione, Natasha Alechina, Mehdi Dastani +1
Reward machines allow the definition of rewards for temporally extended tasks and behaviors. Specifying "informative" reward machines can be challenging. One way to address this is…
The Complexity of Data-Driven Norm Synthesis and Revision
Davide Dell'Anna, Natasha Alechina, Brian Logan +3
Norms have been widely proposed as a way of coordinating and controlling the activities of agents in a multi-agent system (MAS). A norm specifies the behaviour an agent should foll…
Causality, Responsibility and Blame in Team Plans
Natasha Alechina, Joseph Y. Halpern, Brian Logan
Many objectives can be achieved (or may be achieved more effectively) only by a group of agents executing a team plan. If a team plan fails, it is often of interest to determine wh…
Coalition and Group Announcement Logic
Rustam Galimullin, Natasha Alechina
Dynamic epistemic logics which model abilities of agents to make various announcements and influence each other's knowledge have been studied extensively in recent years. Two notab…
Resource Logics with a Diminishing Resource
Natasha Alechina, Brian Logan
Model-checking resource logics with production and consumption of resources is a computationally hard and often undecidable problem. We introduce a simple and realistic assumption…
Coalition and Group Announcement Logic
Rustam Galimullin, Natasha Alechina
Dynamic epistemic logics which model abilities of agents to make various announcements and influence each other's knowledge have been studied extensively in recent years. Two notab…
Expressibility of norms in temporal logic
Natasha Alechina, Mehdi Dastani, Brian Logan
In this short note we address the issue of expressing norms (such as obligations and prohibitions) in temporal logic. In particular, we address the argument from [Governatori 2015]…
Decentralised Norm Monitoring in Open Multi-Agent Systems
Natasha Alechina, Joseph Y. Halpern, Ian A. Kash +1
We consider the problem of detecting norm violations in open multi-agent systems (MAS). We show how, using ideas from scrip systems, we can design mechanisms where the agents compr…
Technical Report: Model-Checking for Resource-Bounded ATL with Production and Consumption of Resources
Natasha Alechina, Brian Logan, Hoang Nga Nguyen +1
Several logics for expressing coalitional ability under resource bounds have been proposed and studied in the literature. Previous work has shown that if only consumption of resour…
Completeness of Epistemic Coalition Logic with Group Knowledge
Thomas Ågotnes, Natasha Alechina
Coalition logic is one of the most popular logics for multi-agent systems. While epistemic extensions of coalition logic have received much attention, existence of their complete a…