English
Related papers

Related papers: Decidability results for ATL* with imperfect infor…

200 papers

We propose a formal proof of the undecidability of the model checking problem for alternating- time temporal logic under imperfect information and perfect recall semantics. This problem was announced to be undecidable according to a…

Logic in Computer Science · Computer Science 2011-02-22 Catalin Dima , Ferucio Laurentiu Tiplea

Model-checking the alternating-time temporal logics ATL and ATL* with incomplete information is undecidable for perfect recall semantics. However, when restricting to memoryless strategies the model-checking problem becomes decidable. In…

Computer Science and Game Theory · Computer Science 2013-07-18 Steen Vester

In logics for the strategic reasoning the main challenge is represented by their verification in contexts of imperfect information and perfect recall. In this work, we show a technique to approximate the verification of Alternating-time…

Multiagent Systems · Computer Science 2023-06-19 Angelo Ferrando , Vadim Malvone

We present a variant of ATL with distributed knowledge operators based on a synchronous and perfect recall semantics. The coalition modalities in this logic are based on partial observation of the full history, and incorporate a form of…

Logic in Computer Science · Computer Science 2010-08-11 Cătălin Dima , Constantin Enea , Dimitar Guelev

Alternating-time temporal logics (ATL/ATL*) represent a family of modal logics for reasoning about agents' strategic abilities in multiagent systems (MAS). The interpretations of ATL/ATL* over the semantic model Concurrent Game Structures…

Artificial Intelligence · Computer Science 2018-11-28 Yedi Zhang , Fu Song , Taolue Chen

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

Various extensions of the temporal logic ATL have recently been introduced to express rich properties of multi-agent systems. Among these, ATLsc extends ATL with strategy contexts, while Strategy Logic has first-order quantification over…

Logic in Computer Science · Computer Science 2013-07-18 François Laroussinie , Nicolas Markey

Alternating-time temporal logic with strategy contexts (ATLsc) is a powerful formalism for expressing properties of multi-agent systems: it extends CTL with strategy quantifiers, offering a convenient way of expressing both collaboration…

Logic in Computer Science · Computer Science 2015-09-25 François Laroussinie , Nicolas Markey , Arnaud Sangnier

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

Alternating-time temporal logic (ATL) allows to specify requirements on abilities that different agents should (or should not) possess in a multi-agent system. However, model checking ATL specifications in realistic systems is…

Multiagent Systems · Computer Science 2016-08-31 Wojciech Jamroga , Michał Knapik , Damian Kurpiewski

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

Alternating-time temporal logic (ATL$^*$) is a well-established framework for formal reasoning about multi-agent systems. However, while ATL$^*$ can reason about the strategic ability of agents (e.g., some coalition $A$ can ensure that a…

Artificial Intelligence · Computer Science 2024-03-13 Raven Beutner , Bernd Finkbeiner

Many important properties of multi-agent systems refer to the participants' ability to achieve a given goal, or to prevent the system from an undesirable event. Among intelligent agents, the goals are often of epistemic nature, i.e.,…

Multiagent Systems · Computer Science 2023-10-19 Masoud Tabatabaei , Wojciech Jamroga

In multi-agent system design, a crucial aspect is to ensure robustness, meaning that for a coalition of agents A, small violations of adversarial assumptions only lead to small violations of A's goals. In this paper we introduce a logical…

Logic in Computer Science · Computer Science 2023-07-21 Aniello Murano , Daniel Neider , Martin Zimmermann

We develop game-theoretic semantics (GTS) for the fragment ATL+ of the full Alternating-time Temporal Logic ATL*, essentially extending a recently introduced GTS for ATL. We first show that the new game-theoretic semantics is equivalent to…

Logic · Mathematics 2019-06-17 Valentin Goranko , Antti Kuusisto , Raine Rönnholm

We present two novel symbolic algorithms for model checking the Alternating-time Temporal Logic ATL*, over both the infinite-trace and the finite-trace semantics. In particular, for infinite traces we design a novel symbolic reduction to…

Logic in Computer Science · Computer Science 2025-10-22 Sofia Garcia de Blas Garcia-Alcalde , Francesco Belardinelli

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 imperfect information by a full Hennessy-Milner theorem. The…

Logic in Computer Science · Computer Science 2020-06-29 Francesco Belardinelli , Catalin Dima , Vadim Malvone , Ferucio Tiplea

Since the introduction of Alternating-time Temporal Logic (ATL), many logics have been proposed to reason about different strategic capabilities of the agents of a system. In particular, some logics have been designed to reason about the…

Logic in Computer Science · Computer Science 2017-09-08 Simon Busard , Charles Pecheur

We propose a variant of Alternating-time Temporal Logic (ATL) grounded in the agents' operational know-how, as defined by their libraries of abstract plans. Inspired by ATLES, a variant itself of ATL, it is possible in our logic to…

Artificial Intelligence · Computer Science 2016-07-05 Nitin Yadav , Sebastian Sardina

We identify a subproblem of the model-checking problem for the epistemic \mu-calculus which is decidable. Formulas in the instances of this subproblem allow free variables within the scope of epistemic modalities in a restricted form that…

Computer Science and Game Theory · Computer Science 2013-10-28 Rodica Bozianu , Catalin Dima , Constantin Enea
‹ Prev 1 2 3 10 Next ›