Satisfiability in Strategy Logic Can Be Easier than Model Checking release_sveqeqhwmnekzdmzag5ji422uq

by Erman Acar, Massimo Benerecetti, Fabio Mogavero

Published in PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE by Association for the Advancement of Artificial Intelligence (AAAI).

2019   Volume 33, p2638-2645

Abstract

In the design of complex systems, model-checking and satisfiability arise as two prominent decision problems. While model-checking requires the designed system to be provided in advance, satisfiability allows to check if such a system even exists. With very few exceptions, the second problem turns out to be harder than the first one from a complexity-theoretic standpoint. In this paper, we investigate the connection between the two problems for a non-trivial fragment of Strategy Logic (SL, for short). SL extends LTL with first-order quantifications over strategies, thus allowing to explicitly reason about the strategic abilities of agents in a multi-agent system. Satisfiability for the full logic is known to be highly undecidable, while model-checking is non-elementary.The SL fragment we consider is obtained by preventing strategic quantifications within the scope of temporal operators. The resulting logic is quite powerful, still allowing to express important game-theoretic properties of multi-agent systems, such as existence of Nash and immune equilibria, as well as to formalize the rational synthesis problem. We show that satisfiability for such a fragment is PSPACE-COMPLETE, while its model-checking complexity is 2EXPTIME-HARD. The result is obtained by means of an elegant encoding of the problem into the satisfiability of conjunctive-binding first-order logic, a recently discovered decidable fragment of first-order logic.
In application/xml+jats format

Archived Files and Locations

application/pdf  332.8 kB
file_yq2bn7iyafcw7ml6chuoirc3sa
research.vu.nl (web)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2019-07-17
Proceedings Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  2159-5399
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: e2a8b760-f444-41d3-afb7-bd07a7ed815c
API URL: JSON