English
Related papers

Related papers: Good-for-Game QPTL: An Alternating Hodges Semantic…

200 papers

In this paper we introduce Behavioral QLTL, which is a ``behavioral'' variant of linear-time temporal logic on infinite traces with second-order quantifiers. Behavioral QLTL is characterized by the fact that the functions that assign the…

Logic in Computer Science · Computer Science 2021-02-23 Giuseppe De Giacomo , Giuseppe Perelli

We propose enhancing the use of propositions for denoting decisions and strategies as established in temporal languages such as CTL*, if interpreted on concurrent game models. The enhancement enables specifying varying coalition structure.…

Logic in Computer Science · Computer Science 2020-11-10 Dimitar P. Guelev

We consider quantitative extensions of the alternating-time temporal logics ATL/ATLs called quantitative alternating-time temporal logics (QATL/QATLs) in which the value of a counter can be compared to constants using equality, inequality…

Logic in Computer Science · Computer Science 2014-09-22 Steen Vester

Hyperproperties generalize traditional trace properties by relating multiple execution traces rather than reasoning about individual runs in isolation. They provide a unified way to express important requirements such as information flow…

Logic in Computer Science · Computer Science 2025-10-07 Raven Beutner , Bernd Finkbeiner

Quantified CTL (QCTL) is a well-studied temporal logic that extends CTL with quantification over atomic propositions. It has recently come to the fore as a powerful intermediary framework to study logics for strategic reasoning. We extend…

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

We present a general logical framework for reasoning about agents' cognitive attitudes of both epistemic type and motivational type. We show that it allows us to express a variety of relevant concepts for qualitative decision theory…

Artificial Intelligence · Computer Science 2023-06-22 Emiliano Lorini

Temporal logics for hyperproperties like HyperLTL use trace quantifiers to express properties that relate multiple system runs. In practice, the verification of such specifications is mostly limited to formulas without quantifier…

Logic in Computer Science · Computer Science 2022-06-07 Raven Beutner , Bernd Finkbeiner

We show how to add and eliminate binary preference on plays in Alternating-time Temporal Logic (ATL) with strategy contexts on Concurrent Game Models (CGMs) by means of a translation which preserves satisfaction in models where…

Logic in Computer Science · Computer Science 2026-02-12 Dimitar P. Guelev

We propose a logical framework combining a game-theoretic study of abilities of agents to achieve quantitative objectives in multi-player games by optimizing payoffs or preferences on outcomes with a logical analysis of the abilities of…

Logic in Computer Science · Computer Science 2013-03-05 Nils Bulling , Valentin Goranko

In this paper, we introduce game-theoretic semantics (GTS) for Qualitative Choice Logic (QCL), which, in order to express preferences, extends classical propositional logic with an additional connective called ordered disjunction. Firstly,…

Logic in Computer Science · Computer Science 2022-09-28 Robert Freiman , Michael Bernreiter

Admissibility has been studied for games of infinite duration with Boolean objectives. We extend here this study to games of infinite duration with quantitative objectives. First, we show that, un- der the assumption that optimal worst-case…

Logic in Computer Science · Computer Science 2016-11-29 Romain Brenguier , Guillermo A. Pérez , Jean-François Raskin , Ocan Sankur

Quantum game theory offers a lot of interesting questions, and it is relevant to use the quantum information theory to resolve or improve games with lack of information : how to use the power of quantum entanglement to show the superiority…

Quantum Physics · Physics 2007-05-23 Sylvain Gravier , Philippe Jorrand , Mehdi Mhalla , Charles Payan

We consider graph games of infinite duration with winning conditions in parameterized linear temporal logic, where the temporal operators are equipped with variables for time bounds. In model checking such specifications were introduced as…

Computer Science and Game Theory · Computer Science 2011-06-08 Martin Zimmermann

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

We introduce versions of game-theoretic semantics (GTS) for Alternating-Time Temporal Logic (ATL). In GTS, truth is defined in terms of existence of a winning strategy in a semantic evaluation game, and thus the game-theoretic perspective…

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

Model-checking HyperLTL, a temporal logic expressing properties of sets of traces with applications to information-flow based security and privacy, has a decidable, but TOWER-complete, model-checking problem. While the classical…

Logic in Computer Science · Computer Science 2025-08-01 Sarah Winter , Martin Zimmermann

Functional dependencies restrict the potential interactions among variables connected in a probabilistic network. This restriction can be exploited in qualitative probabilistic reasoning by introducing deterministic variables and modifying…

Artificial Intelligence · Computer Science 2013-04-05 Michael P. Wellman

Strategy Logic (SL) is a very expressive logic for specifying and verifying properties of multi-agent systems: in SL, one can quantify over strategies, assign them to agents, and express properties of the resulting plays. Such a powerful…

Logic in Computer Science · Computer Science 2017-08-22 Patrick Gardy , Patricia Bouyer , Nicolas Markey

Extensive games are tools largely used in economics to describe decision processes ofa community of agents. In this paper we propose a formal presentation based on theproof assistant COQ which focuses mostly on infinite extensive games and…

Computer Science and Game Theory · Computer Science 2017-12-07 Pierre Lescanne

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
‹ Prev 1 2 3 10 Next ›