Document Open Access Logo

Taming Strategy Logic: Non-Recurrent Fragments

Authors Massimo Benerecetti , Fabio Mogavero , Adriano Peron

PDF
Thumbnail PDF

File

LIPIcs.TIME.2022.14.pdf
  • Filesize: 0.77 MB
  • 16 pages

Document Identifiers

Author Details

Massimo Benerecetti
  • University of Napoli "Federico II", Italy
Fabio Mogavero
  • University of Napoli "Federico II", Italy
Adriano Peron
  • University of Napoli "Federico II", Italy

Funding

Partially supported by the GNCS 2020 project "Ragionamento Strategico e Sintesi Automatica di Sistemi Multi-Agente".

Cite AsGet BibTex

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)
https://doi.org/10.4230/LIPIcs.TIME.2022.14

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.

Subject Classification

ACM Subject Classification
  • Theory of computation → Modal and temporal logics
  • Theory of computation → Logic and verification
  • Theory of computation → Automata over infinite objects
Keywords
  • Strategic Reasoning
  • Multi-Agent Systems
  • Temporal Logics
  • Satisfiability

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. E. Acar, M. Benerecetti, and F. Mogavero. Satisfiability in Strategy Logic Can Be Easier than Model Checking. In AAAI Press19, pages 2638-2645. AAAI Press, 2019. Google Scholar
  2. R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-Time Temporal Logic. JACM, 49(5):672-713, 2002. Google Scholar
  3. E.G. Amparore, S. Donatelli, and F. Gallà. A CTL* Model Checker for Petri Nets. In PETRI NETS'20, LNCS 12152, pages 403-413. Springer, 2020. Google Scholar
  4. F. Baader and W. Snyder. Unification Theory. In Handbook of Automated Reasoning (vol. 1)., pages 445-532. Elsevier & MIT Press, 2001. Google Scholar
  5. M. Benerecetti, F. Mogavero, and A. Murano. Substructure Temporal Logic. In LICS'13, pages 368-377. IEEECS, 2013. Google Scholar
  6. M. Benerecetti, F. Mogavero, and A. Murano. Reasoning About Substructures and Games. TOCL, 16(3):25:1-46, 2015. Google Scholar
  7. P. Bouyer, P. Gardy, and N. Markey. Weighted Strategy Logic with Boolean Goals Over One-Counter Games. In FSTTCS'15, LIPIcs 45, pages 69-83. Leibniz-Zentrum fuer Informatik, 2015. Google Scholar
  8. P. Bouyer, P. Gardy, and N. Markey. On the semantics of Strategy Logic. IPL, 116(2):75-79, 2016. Google Scholar
  9. S. Bova and F. Mogavero. Herbrand Property, Finite Quasi-Herbrand Models, and a Chandra-Merlin Theorem for Quantified Conjunctive Queries. In LICS'17, pages 1-12. ACM, 2017. Google Scholar
  10. K. Chatterjee, T.A. Henzinger, and N. Piterman. Strategy Logic. In CONCUR'07, LNCS 4703, pages 59-73. Springer, 2007. Google Scholar
  11. K. Chatterjee, T.A. Henzinger, and N. Piterman. Strategy Logic. IC, 208(6):677-693, 2010. Google Scholar
  12. H. Comon and V. Cortier. Flatness Is Not a Weakness. In CSL'00, LNCS 1862, pages 262-276. Springer, 2000. Google Scholar
  13. D. Dams. Flat Fragments of CTL and CTL*: Separating the Expressive and Distinguishing Powers. LJIGPL, 7(1):55-78, 1999. Google Scholar
  14. S. Demri, R. Lazic, and D. Nowak. On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. IC, 205(1):2-24, 2007. Google Scholar
  15. S. Demri and P. Schnoebelen. The Complexity of Propositional Linear Temporal Logics in Simple Cases. IC, 174(1):84-103, 2002. Google Scholar
  16. E.A. Emerson. Temporal and Modal Logic. In Handbook of Theoretical Computer Science (vol. B)., pages 995-1072. MIT Press, 1990. Google Scholar
  17. E.A. Emerson and J.Y. Halpern. "Sometimes" and "Not Never" Revisited: On Branching Versus Linear Time. In POPL'83, pages 127-140. ACM, 1983. Google Scholar
  18. E.A. Emerson and J.Y. Halpern. "Sometimes" and "Not Never" Revisited: On Branching Versus Linear Time. JACM, 33(1):151-178, 1986. Google Scholar
  19. G.E. Fainekos, S.G. Loizou, and G.J. Pappas. Translating Temporal Logic to Controller Specifications. In DC'06, pages 899-904. IEEECS, 2006. Google Scholar
  20. P. Gardy, P. Bouyer, and N. Markey. Dependences in Strategy Logic. In STACS'18, LIPIcs 96, pages 34:1-15. Leibniz-Zentrum fuer Informatik, 2018. Google Scholar
  21. P. Gardy, P. Bouyer, and N. Markey. Dependences in Strategy Logic. TCS, 64(3):467-507, 2020. Google Scholar
  22. S. Ghosh and R. Ramanujam. Strategies in Games: A Logic-Automata Study. In ESSLLI'11, LNCS 7388, pages 110-159. Springer, 2011. Google Scholar
  23. E. Grädel, W. Thomas, and T. Wilke. Automata, Logics, and Infinite Games: A Guide to Current Research. LNCS 2500. Springer, 2002. Google Scholar
  24. J. Gutierrez, P. Harrenstein, and M. Wooldridge. Iterated Boolean Games. In IJCAI'13, pages 932-938, 2013. Google Scholar
  25. J. Gutierrez, P. Harrenstein, and M. Wooldridge. Reasoning about Equilibria in Game-Like Concurrent Systems. In KR'14, pages 408-417. AAAI Press, 2014. Google Scholar
  26. J. Gutierrez, P. Harrenstein, and M. Wooldridge. Iterated Boolean Games. IC, 242:53-79, 2015. Google Scholar
  27. T.A. Henzinger and N. Piterman. Solving Games Without Determinization. In CSL'06, LNCS 4207, pages 395-410. Springer, 2006. Google Scholar
  28. O.H. Ibarra and Z. Dang. On Removing the Pushdown Stack in Reachability Constructions. In ISAAC'01, LNCS 2223, pages 244-256. Springer, 2001. Google Scholar
  29. B. Khoussainov and A. Nerode. Automata Theory and Its Applications. Birkhauser, 2001. Google Scholar
  30. O. Kupferman, M.Y. Vardi, and P. Wolper. An Automata Theoretic Approach to Branching-Time Model Checking. JACM, 47(2):312-360, 2000. Google Scholar
  31. F. Mogavero, A. Murano, G. Perelli, and M.Y. Vardi. What Makes ATL* Decidable? A Decidable Fragment of Strategy Logic. In CONCUR'12, LNCS 7454, pages 193-208. Springer, 2012. Google Scholar
  32. F. Mogavero, A. Murano, G. Perelli, and M.Y. Vardi. Reasoning About Strategies: On the Model-Checking Problem. TOCL, 15(4):34:1-42, 2014. Google Scholar
  33. F. Mogavero, A. Murano, G. Perelli, and M.Y. Vardi. Reasoning About Strategies: On the Satisfiability Problem. LMCS, 13(1:9):1-37, 2017. Google Scholar
  34. F. Mogavero, A. Murano, and M.Y. Vardi. Reasoning About Strategies. In FSTTCS'10, LIPIcs 8, pages 133-144. Leibniz-Zentrum fuer Informatik, 2010. Google Scholar
  35. F. Mogavero and G. Perelli. Binding Forms in First-Order Logic. In CSL'15, LIPIcs 41, pages 648-665. Leibniz-Zentrum fuer Informatik, 2015. Google Scholar
  36. A. Pnueli and R. Rosner. On the Synthesis of a Reactive Module. In POPL'89, pages 179-190. ACM, 1989. Google Scholar
  37. S. Schewe. ATL* Satisfiability is 2ExpTime-Complete. In ICALP'08, LNCS 5126, pages 373-385. Springer, 2008. Google Scholar
  38. P. Schnoebelen. The Complexity of Temporal Logic Model Checking. In AIML'02, pages 393-436. College Publications, 2002. Google Scholar
  39. L.J. Stockmeyer. The Polynomial-Time Hierarchy. TCS, 3(1):1-22, 1976. Google Scholar
  40. M.Y. Vardi. Reasoning about The Past with Two-Way Automata. In ICALP'98, LNCS 1443, pages 628-641. Springer, 1998. Google Scholar
  41. M.Y. Vardi and P. Wolper. An Automata-Theoretic Approach to Automatic Program Verification. In LICS'86, pages 332-344. IEEECS, 1986. Google Scholar
  42. M.Y. Vardi and P. Wolper. Automata-Theoretic Techniques for Modal Logics of Programs. JCSS, 32(2):183-221, 1986. Google Scholar
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
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact