English
Related papers

Related papers: Game-Theoretic Semantics for Alternating-Time Temp…

200 papers

Temporal Equilibrium Logic (TEL) is a promising framework that extends the knowledge representation and reasoning capabilities of Answer Set Programming with temporal operators in the style of LTL. To our knowledge it is the first…

Logic in Computer Science · Computer Science 2015-03-03 Laura Bozzelli , David Pearce

Differences in perception, information asymmetries, and bounded rationality lead game-theoretic players to derive a private, subjective view of the game that may diverge from the underlying ground-truth scenario and may be misaligned with…

Artificial Intelligence · Computer Science 2025-12-16 Vince Trencsenyi

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. DEL games were recently introduced as a way to define classes of games…

Logic in Computer Science · Computer Science 2020-01-22 Bastien Maubert , Aniello Murano , Sophie Pinchinat , François Schwarzentruber , Silvia Stranieri

Model checking for real-timed systems is a rich and diverse topic. Among the different logics considered, Metric Interval Temporal Logic (MITL) is a powerful and commonly used logic, which can succinctly encode many interesting timed…

Formal Languages and Automata Theory · Computer Science 2026-05-19 S. Akshay , Prerak Contractor , Paul Gastin , R. Govind , B. Srivathsan

Justification theory is a unifying semantic framework. While it has its roots in non-monotonic logics, it can be applied to various areas in computer science, especially in explainable reasoning; its most central concept is a justification:…

Artificial Intelligence · Computer Science 2020-09-23 Simon Marynissen , Bart Bogaerts , Marc Denecker

We use a reformulation of compositional game theory to reunite game theory with game semantics, by viewing an open game as the System and its choice of contexts as the Environment. Specifically, the system is jointly controlled by $n \geq…

Computer Science and Game Theory · Computer Science 2020-09-16 Jules Hedges

We consider G\"odel temporal logic ($\sf GTL$), a variant of linear temporal logic based on G\"odel--Dummett propositional logic. In recent work, we have shown this logic to enjoy natural semantics both as a fuzzy logic and as a…

Logic in Computer Science · Computer Science 2022-12-05 Juan Pablo Aguilera , Martín Diéguez , David Fernández-Duque , Brett McLean

We study alternating good-for-games (GFG) automata, i.e., alternating automata where both conjunctive and disjunctive choices can be resolved in an online manner, without knowledge of the suffix of the input word still to be read. We show…

Formal Languages and Automata Theory · Computer Science 2020-02-19 Udi Boker , Denis Kuperberg , Karoliina Lehtinen , Michał Skrzypczak

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

Test-time scaling (TTS) has emerged as a powerful paradigm for improving the reasoning ability of Large Language Models (LLMs) by allocating additional computation at inference, yet its application to multimodal systems such as…

Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities, which retains strong closure, equivalence, and decidability properties. The specificity of cost functions is…

Logic in Computer Science · Computer Science 2017-02-09 Denis Kuperberg

We define a game semantics for second order classical arithmetic PA2 (with quantifiers over predicates on integers and full comprehension axiom). Our semantics is effective: moves are described by a finite amount of information and whenever…

Logic in Computer Science · Computer Science 2016-10-28 Stefano Berardi

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

Gradually typed languages are designed to support both dynamically typed and statically typed programming styles while preserving the benefits of each. While existing gradual type soundness theorems for these languages aim to show that…

Programming Languages · Computer Science 2018-11-07 Max S. New , Daniel R. Licata , Amal Ahmed

Argumentation is one of the most popular approaches of defining a~non-monotonic formalism and several argumentation based semantics were proposed for defeasible logic programs. Recently, a new approach based on notions of conflict…

Artificial Intelligence · Computer Science 2014-04-29 Jozef Frtús

Autonomous agents acting in realistic Multi-Agent Systems (MAS) should be able to adapt during their execution. Standard strategic logics, such as Alternating-time Temporal Logic (ATL), model agents' state- or history-dependent behaviour.…

Logic in Computer Science · Computer Science 2026-04-30 Rustam Galimullin , Hermine Grosinger , Munyque Mittelmann

The rapid advancement of large language models has accelerated their application in reasoning, with strategic reasoning drawing increasing attention. To evaluate the strategic reasoning capabilities of LLMs, game theory, with its concise…

Artificial Intelligence · Computer Science 2025-05-28 Haochuan Wang , Xiachong Feng , Lei Li , Yu Guo , Zhanyue Qin , Dianbo Sui , Lingpeng Kong

This paper uses category theory to develop an entirely new approach to approximate game theory. Game theory is the study of how different agents within a multi-agent system take decisions. At its core, game theory asks what an optimal…

Computer Science and Game Theory · Computer Science 2025-09-26 Neil Ghani

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 propose a new task-specification language for Markov decision processes that is designed to be an improvement over reward functions by being environment independent. The language is a variant of Linear Temporal Logic (LTL) that is…

Artificial Intelligence · Computer Science 2017-04-17 Michael L. Littman , Ufuk Topcu , Jie Fu , Charles Isbell , Min Wen , James MacGlashan