A Decidable Fragment of Strategy Logic release_2ccdrprnt5adfpwstjiiou73wq

by Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi

Released as a article .

2012  

Abstract

Strategy Logic (SL, for short) has been recently introduced by Mogavero, Murano, and Vardi as a useful formalism for reasoning explicitly about strategies, as first-order objects, in multi-agent concurrent games. This logic turns to be very powerful, subsuming all major previously studied modal logics for strategic reasoning, including ATL, ATL*, and the like. Unfortunately, due to its expressiveness, SL has a non-elementarily decidable model-checking problem and a highly undecidable satisfiability problem, specifically, Σ_1^1-Hard. In order to obtain a decidable sublogic, we introduce and study here One-Goal Strategy Logic (SL[1G], for short). This logic is a syntactic fragment of SL, strictly subsuming ATL*, which encompasses formulas in prenex normal form having a single temporal goal at a time, for every strategy quantification of agents. SL[1G] is known to have an elementarily decidable model-checking problem. Here we prove that, unlike SL, it has the bounded tree-model property and its satisfiability problem is decidable in 2ExpTime, thus not harder than the one for ATL*.
In text/plain format

Archived Files and Locations

application/pdf  376.6 kB
file_52f3sooth5b2xm5ed7fmzo7wj4
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2012-02-06
Version   v1
Language   en ?
arXiv  1202.1309v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 090afe77-cfeb-42d0-885c-2d8d4bdba9ef
API URL: JSON