588 research outputs found
ATLsc with partial observation
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 and antagonism between several agents. Incomplete observation of
the state space is a desirable feature in such a framework, but it quickly
leads to undecidable verification problems. In this paper, we prove that
uniform incomplete observation (where all players have the same observation)
preserves decidability of the model-checking problem, even for very expressive
logics such as ATLsc.Comment: In Proceedings GandALF 2015, arXiv:1509.0685
Towards an Updatable Strategy Logic
This article is about temporal multi-agent logics. Several of these
formalisms have been already presented (ATL-ATL*, ATLsc, SL). They enable to
express the capacities of agents in a system to ensure the satisfaction of
temporal properties. Particularly, SL and ATLsc enable several agents to
interact in a context mixing the different strategies they play in a semantical
game. We generalize this possibility by proposing a new formalism, Updating
Strategy Logic (USL). In USL, an agent can also refine its own strategy. The
gain in expressive power rises the notion of "sustainable capacities" for
agents.
USL is built from SL. It mainly brings to SL the two following modifications:
semantically, the successor of a given state is not uniquely determined by the
data of one choice from each agent. Syntactically, we introduce in the language
an operator, called an "unbinder", which explicitely deletes the binding of a
strategy to an agent. We show that USL is strictly more expressive than SL.Comment: In Proceedings SR 2013, arXiv:1303.007
Game-Theoretic Semantics for Alternating-Time Temporal Logic
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 appears in the framework of ATL on two semantic levels: on the
object level in the standard semantics of the strategic operators, and on the
meta-level where game-theoretic logical semantics is applied to ATL. We unify
these two perspectives into semantic evaluation games specially designed for
ATL. The game-theoretic perspective enables us to identify new variants of the
semantics of ATL based on limiting the time resources available to the verifier
and falsifier in the semantic evaluation game. We introduce and analyse an
unbounded and (ordinal) bounded GTS and prove these to be equivalent to the
standard (Tarski-style) compositional semantics. We show that in these both
versions of GTS, truth of ATL formulae can always be determined in finite time,
i.e., without constructing infinite paths. We also introduce a non-equivalent
finitely bounded semantics and argue that it is natural from both logical and
game-theoretic perspectives.Comment: Preprint of a paper published in ACM Transactions on Computational
Logic, 19(3): 17:1-17:38, 201
How to Be Both Rich and Happy: Combining Quantitative and Qualitative Strategic Reasoning about Multi-Player Games
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 players for achieving qualitative objectives of players, i.e.,
reaching or maintaining game states with desired properties. We enrich
concurrent game models with payoffs for the normal form games associated with
the states of the model and propose a quantitative extension of the logic ATL*
enabling the combination of quantitative and qualitative reasoning.Comment: In Proceedings SR 2013, arXiv:1303.007
- …