1 Search Results for "Benerecetti, Massimo"


Document
Taming Strategy Logic: Non-Recurrent Fragments

Authors: Massimo Benerecetti, Fabio Mogavero, and Adriano Peron

Published in: LIPIcs, Volume 247, 29th International Symposium on Temporal Representation and Reasoning (TIME 2022)


Abstract
Strategy Logic (SL for short) is one of the prominent languages for reasoning about the strategic abilities of agents in a multi-agent setting. This logic extends LTL with first-order quantifiers over the agent strategies and encompasses other formalisms, such as ATL* and CTL*. The model-checking problem for SL and several of its fragments have been extensively studied. On the other hand, the picture is much less clear on the satisfiability front, where the problem is undecidable for the full logic. In this work, we study two fragments of One-Goal SL, where the nesting of sentences within temporal operators is constrained. We show that the satisfiability problem for these logics, and for the corresponding fragments of ATL* and CTL*, is ExpSpace and PSpace-Complete, respectively.

Cite as

Massimo Benerecetti, Fabio Mogavero, and Adriano Peron. Taming Strategy Logic: Non-Recurrent Fragments. In 29th International Symposium on Temporal Representation and Reasoning (TIME 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 247, pp. 14:1-14:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


Copy BibTex To Clipboard

@InProceedings{benerecetti_et_al:LIPIcs.TIME.2022.14,
  author =	{Benerecetti, Massimo and Mogavero, Fabio and Peron, Adriano},
  title =	{{Taming Strategy Logic: Non-Recurrent Fragments}},
  booktitle =	{29th International Symposium on Temporal Representation and Reasoning (TIME 2022)},
  pages =	{14:1--14:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-262-4},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{247},
  editor =	{Artikis, Alexander and Posenato, Roberto and Tonetta, Stefano},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2022.14},
  URN =		{urn:nbn:de:0030-drops-172611},
  doi =		{10.4230/LIPIcs.TIME.2022.14},
  annote =	{Keywords: Strategic Reasoning, Multi-Agent Systems, Temporal Logics, Satisfiability}
}
  • Refine by Author
  • 1 Benerecetti, Massimo
  • 1 Mogavero, Fabio
  • 1 Peron, Adriano

  • Refine by Classification
  • 1 Theory of computation → Automata over infinite objects
  • 1 Theory of computation → Logic and verification
  • 1 Theory of computation → Modal and temporal logics

  • Refine by Keyword
  • 1 Multi-Agent Systems
  • 1 Satisfiability
  • 1 Strategic Reasoning
  • 1 Temporal Logics

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2022

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail