English
Related papers

Related papers: Reasoning about Knowledge and Strategies under Hie…

200 papers

This paper presents an extension of temporal epistemic logic with operators that quantify over agent strategies. Unlike previous work on alternating temporal epistemic logic, the semantics works with systems whose states explicitly encode…

Logic in Computer Science · Computer Science 2018-07-13 Xiaowei Huang , Ron van der Meyden

Infinite games with imperfect information are known to be undecidable unless the information flow is severely restricted. One fundamental decidable case occurs when there is a total ordering among players, such that each player has access…

Computer Science and Game Theory · Computer Science 2016-07-19 Dietmar Berwanger , Anup Basil Mathew , Marie van den Bogaard

In this paper we introduce Epistemic Strategy Logic (ESL), an extension of Strategy Logic with modal operators for individual knowledge. This enhanced framework allows us to represent explicitly and to reason about the knowledge agents have…

Logic in Computer Science · Computer Science 2014-04-04 Francesco Belardinelli

Substantial efforts have been made in developing various Decision Modeling formalisms, both from industry and academia. A challenging problem is that of expressing decision knowledge in the context of incomplete knowledge. In such contexts,…

Artificial Intelligence · Computer Science 2023-12-19 Đorđe Marković , Simon Vandevelde , Linde Vanbesien , Joost Vennekens , Marc Denecker

We introduce an extension of Strategy Logic for the imperfect-information setting, called SLii, and study its model-checking problem. As this logic naturally captures multi-player games with imperfect information, this problem is…

Logic in Computer Science · Computer Science 2020-03-11 Raphaël Berthon , Bastien Maubert , Aniello Murano , Sasha Rubin , Moshe Vardi

We propose an extension of Strategy Logic (SL), in which one can both reason about strategizing under imperfect information and about players' knowledge. One original aspect of our approach is that we do not force strategies to be uniform,…

Logic in Computer Science · Computer Science 2019-08-08 Sophia Knight , Bastien Maubert

The paper presents an extension of temporal epistemic logic with operators that quantify over strategies. The language also provides a natural way to represent what agents would know were they to be aware of the strategies being used by…

Logic in Computer Science · Computer Science 2014-04-04 Xiaowei Huang , Ron van der Meyden

Most existing work on strategic reasoning simply adopts either an informed or an uninformed semantics. We propose a model where knowledge of strategies can be specified on a fine-grained level. In particular, it is possible to distinguish…

Logic in Computer Science · Computer Science 2025-10-23 Borja Sierra Miranda , Thomas Studer

The use of Dynamic Epistemic Logic (DEL) in multi-agent planning has led to a widely adopted action formalism that can handle nondeterminism, partial observability and arbitrary knowledge nesting. As such expressive power comes at the cost…

Artificial Intelligence · Computer Science 2023-07-31 Alessandro Burigana , Paolo Felli , Marco Montali , Nicolas Troquard

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 unable to express properties relating to information…

Artificial Intelligence · Computer Science 2025-01-07 Chunyan Mu , Nima Motamed , Natasha Alechina , Brian Logan

We introduce an extension of Strategy Logic for the imperfect-information setting, called SLii, and study its model-checking problem. As this logic naturally captures multi-player games with imperfect information, the problem turns out to…

Logic in Computer Science · Computer Science 2018-09-05 Raphaël Berthon , Bastien Maubert , Aniello Murano , Sasha Rubin , Moshe Vardi

Hierarchical task decomposition is a method used in many agent systems to organize agent knowledge. This work shows how the combination of a hierarchy and persistent assertions of knowledge can lead to difficulty in maintaining logical…

Artificial Intelligence · Computer Science 2011-06-27 J. E. Laird , R. E. Wray

Temporal epistemic logic is a well-established framework for expressing agents knowledge and how it evolves over time. Within language-based security these are central issues, for instance in the context of declassification. We propose to…

Cryptography and Security · Computer Science 2012-09-03 Musard Balliu , Mads Dam , Gurvan Le Guernic

We introduce a new semantics for a multi-agent epistemic operator of knowing how, based on an indistinguishability relation between plans. Our proposal is, arguably, closer to the standard presentation of knowing that modalities in…

Logic in Computer Science · Computer Science 2021-06-23 Carlos Areces , Raul Fervari , Andrés R. Saravia , Fernando R. Velázquez-Quesada

In this paper, we investigate the probabilistic variants of the strategy logics ATL and ATL* under imperfect information. Specifically, we present novel decidability and complexity results when the model transitions are stochastic and…

Multiagent Systems · Computer Science 2023-10-27 Francesco Belardinelli , Wojciech Jamroga , Munyque Mittelmann , Aniello Murano

We propose a number of powerful dynamic-epistemic logics for multi-agent information sharing and acts of publicly or privately accessing other agents' information databases. The static base of our logics is obtained by adding to standard…

Logic in Computer Science · Computer Science 2021-09-16 Alexandru Baltag , Sonja Smets

We introduce a novel semantics for a multi-agent epistemic operator of knowing how, based on an indistinguishability relation between plans. Our proposal is, arguably, closer to the standard presentation of knowing that modalities in…

Logic in Computer Science · Computer Science 2023-04-04 Carlos Areces , Raul Fervari , Andrés R. Saravia , Fernando R. Velázquez-Quesada

Real-life agents seldom have unlimited reasoning power. In this paper, we propose and study a new formal notion of computationally bounded strategic ability in multi-agent systems. The notion characterizes the ability of a set of agents to…

Multiagent Systems · Computer Science 2023-10-27 Catalin Dima , Wojciech Jamroga

The aim of this paper is to investigate the interplay between knowledge shared by a group of agents and its coalition ability. We investigate this relation in the standard context of imperfect information concurrent game. We assume that…

Artificial Intelligence · Computer Science 2016-11-28 Guifei Jiang , Dongmo Zhang , Laurent Perrussel

Logics for resource-bounded agents have been getting more and more attention in recent years since they provide us with more realistic tools for modelling and reasoning about multi-agent systems. While many existing approaches are based on…

Logic in Computer Science · Computer Science 2024-01-25 Vitaliy Dolgorukov , Rustam Galimullin , Maksim Gladyshev
‹ Prev 1 2 3 10 Next ›