scholarly journals Game-Theoretic Semantics for Alternating-Time Temporal Logic

2018 ◽  
Vol 19 (3) ◽  
pp. 1-38 ◽  
Author(s):  
Valentin Goranko ◽  
Antti Kuusisto ◽  
Raine Rönnholm
Keyword(s):  
Temporal Logic ◽  
Game Theoretic ◽  
Game Theoretic Semantics

Game-theoretic semantics for non-distributive logics

2019 ◽  
Vol 27 (5) ◽  
pp. 718-742
Author(s):  
Chrysafis Hartonas
Keyword(s):  
The Other ◽  
Game Playing ◽  
Modal Operators ◽  
Game Theoretic ◽  
Game Theoretic Semantics

AbstractWe introduce game-theoretic semantics for systems without the conveniences of either a De Morgan negation, or of distribution of conjunction over disjunction and conversely. Much of game playing rests on challenges issued by one player to the other to satisfy, or refute, a sentence, while forcing him/her to move to some other place in the game’s chessboard-like configuration. Correctness of the game-theoretic semantics is proven for both a training game, corresponding to Positive Lattice Logic and for more advanced games for the logics of lattices with weak negation and modal operators (Modal Lattice Logic).

scholarly journals LOGICS AND ALGEBRAS FOR MULTIPLE PLAYERS

2010 ◽  
Vol 3 (3) ◽  
pp. 485-519 ◽  
Author(s):  
LOES OLDE LOOHUIS ◽  
YDE VENEMA
Keyword(s):  
Computational Complexity ◽  
Winning Strategy ◽  
Boolean Algebras ◽  
Game Theoretic ◽  
Np Complete ◽  
Game Theoretic Semantics ◽  
Stone’S Theorem

We study a generalization of the standard syntax and game-theoretic semantics of logic, which is based on a duality between two players, to a multiplayer setting. We define propositional and modal languages of multiplayer formulas, and provide them with a semantics involving a multiplayer game. Our focus is on the notion of equivalence between two formulas, which is defined by saying that two formulas are equivalent if under each valuation, the set of players with a winning strategy is the same in the two respective associated games. We provide a derivation system which enumerates the pairs of equivalent formulas, both in the propositional case and in the modal case. Our approach is algebraic: We introduce multiplayer algebras as the analogue of Boolean algebras, and show, as the corresponding analog to Stone’s theorem, that these abstract multiplayer algebras can be represented as concrete ones which capture the game-theoretic semantics. For the modal case we prove a similar result. We also address the computational complexity of the problem whether two given multiplayer formulas are equivalent. In the propositional case, we show that this problem is co-NP-complete, whereas in the modal case, it is PSPACE-hard.

scholarly journals On Computational Tractability for Rational Verification

2019 ◽  
Author(s):  
Julian Gutierrez ◽  
Muhammad Najib ◽  
Giuseppe Perelli ◽  
Michael Wooldridge
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Multiagent Systems ◽  
Polynomial Time ◽  
Multiagent System ◽  
Reactive Systems ◽  
State System ◽  
Polynomial Space ◽  
Game Theoretic ◽  
Mean Payoff

Rational verification involves checking which temporal logic properties hold of a concurrent and multiagent system, under the assumption that agents in the system choose strategies in game theoretic equilibrium. Rational verification can be understood as a counterpart of model checking for multiagent systems, but while model checking can be done in polynomial time for some temporal logic specification languages such as CTL, and polynomial space with LTL specifications, rational verification is much more intractable: it is 2EXPTIME-complete with LTL specifications, even when using explicit-state system representations.  In this paper we show that the complexity of rational verification can be greatly reduced by restricting specifications to GR(1), a fragment of LTL that can represent most response properties of reactive systems. We also provide improved complexity results for rational verification when considering players' goals given by mean-payoff utility functions -- arguably the most widely used quantitative objective for agents in concurrent and multiagent systems. In particular, we show that for a number of relevant settings, rational verification can be done in polynomial space or even in polynomial time.

scholarly journals Rational verification: game-theoretic verification of multi-agent systems

2021 ◽  
Author(s):  
Alessandro Abate ◽  
Julian Gutierrez ◽  
Lewis Hammond ◽  
Paul Harrenstein ◽  
Marta Kwiatkowska ◽  
...  
Keyword(s):  
Computer Science ◽  
Temporal Logic ◽  
State Of The Art ◽  
Multi Agent System ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
The Past ◽  
Multi Agent ◽  
Game Theoretic ◽  
Temporal Logic Formula

AbstractWe provide a survey of the state of the art of rational verification: the problem of checking whether a given temporal logic formula ϕ is satisfied in some or all game-theoretic equilibria of a multi-agent system – that is, whether the system will exhibit the behavior ϕ represents under the assumption that agents within the system act rationally in pursuit of their preferences. After motivating and introducing the overall framework of rational verification, we discuss key results obtained in the past few years as well as relevant related work in logic, AI, and computer science.

scholarly journals Semantics for Hyperclassical Logic and the Problem of Negation in the Formal Language

2018 ◽  
Vol 16 (3) ◽  
pp. 5-15
Author(s):  
V. V. Tselishchev
Keyword(s):  
Theoretical Model ◽  
Formal Language ◽  
Order Logic ◽  
First Order Logic ◽  
First Order ◽  
Order Language ◽  
Winning Strategies ◽  
Game Theoretic ◽  
Definition Of ◽  
Game Theoretic Semantics

The application of game-theoretic semantics for first-order logic is based on a certain kind of semantic assumptions, directly related to the asymmetry of the definition of truth and lies as the winning strategies of the Verifier (Abelard) and the Counterfeiter (Eloise). This asymmetry becomes apparent when applying GTS to IFL. The legitimacy of applying GTS when it is transferred to IFL is based on the adequacy of GTS for FOL. But this circumstance is not a reason to believe that one can hope for the same adequacy in the case of IFL. Then the question arises if GTS is a natural semantics for IFL. Apparently, the intuitive understanding of negation in natural language can be explicated in formal languages in various ways, and the result of an incomplete grasp of the concept in these languages can be considered a certain kind of anomalies, in view of the apparent simplicity of the explicated concept. Comparison of the theoretical-model and game theoretic semantics in application to two kinds of language – the first-order language and friendly-independent logic – allows to discover the causes of the anomaly and outline ways to overcome it.

scholarly journals Game-theoretic semantics for ATL+ with applications to model checking

2021 ◽  
Vol 276 ◽  
pp. 104554
Author(s):  
Valentin Goranko ◽  
Antti Kuusisto ◽  
Raine Rönnholm
Keyword(s):  
Model Checking ◽  
Game Theoretic ◽  
Game Theoretic Semantics

Conjunction is Parallel Computation

2015 ◽  
Vol 22 ◽  
pp. 403
Author(s):  
Denis Paperno
Keyword(s):  
Theoretical Analysis ◽  
Parallel Computation ◽  
Parallel Composition ◽  
Logical Syntax ◽  
Game Theoretic ◽  
Game Theoretic Semantics

This paper proposes a new, game theoretical, analysis of conjunction which provides a single logical translation of AND in its sentential, predicate, and NP uses, including both Boolean and non-Boolean cases. In essence it analyzes conjunction as parallel composition, based on game-theoretic semantics and logical syntax by Abramsky (2007).

Sign in / Sign up

Export Citation Format

Share Document