{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T14:29:02Z","timestamp":1768832942064,"version":"3.49.0"},"reference-count":87,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T00:00:00Z","timestamp":1674432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"GNCS 2020"},{"name":"Strategic Reasoning and Automatic Synthesis of Multi-Agent Systems"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2023,1,31]]},"abstract":"<jats:p>\n            An extension of\n            <jats:sans-serif>QPTL<\/jats:sans-serif>\n            is considered where\n            <jats:italic>functional dependencies<\/jats:italic>\n            among the quantified variables can be restricted in such a way that their current values are\n            <jats:italic>independent of the future<\/jats:italic>\n            values of the other variables. This restriction is tightly connected to the notion of\n            <jats:italic>behavioral strategies<\/jats:italic>\n            in game-theory and allows the resulting logic to naturally express game-theoretic concepts. Inspired by the work on logics of dependence and independence, we provide a new compositional semantics for\n            <jats:sans-serif>QPTL<\/jats:sans-serif>\n            that allows for expressing such functional dependencies among variables. The fragment where only restricted quantifications are considered, called\n            <jats:italic>behavioral quantifications<\/jats:italic>\n            , allows for linear-time properties that are satisfiable if and only if they are realisable in the Pnueli-Rosner sense. This fragment can be decided, for both\n            <jats:italic>model checking<\/jats:italic>\n            and\n            <jats:italic>satisfiability<\/jats:italic>\n            , in 2\n            <jats:sc>Exp Time<\/jats:sc>\n            and is expressively equivalent to\n            <jats:sans-serif>QPTL<\/jats:sans-serif>\n            , though significantly less succinct.\n          <\/jats:p>","DOI":"10.1145\/3565365","type":"journal-article","created":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T12:59:46Z","timestamp":1666357186000},"page":"1-57","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Good-for-Game QPTL: An Alternating Hodges Semantics"],"prefix":"10.1145","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4763-5655","authenticated-orcid":false,"given":"Dylan","family":"Bellier","sequence":"first","affiliation":[{"name":"Universit\u00e9 Rennes 1, Rennes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4664-6061","authenticated-orcid":false,"given":"Massimo","family":"Benerecetti","sequence":"additional","affiliation":[{"name":"Universit\u00e0 degli Studi di Napoli Federico II, Napoli, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9743-665X","authenticated-orcid":false,"given":"Dario Della","family":"Monica","sequence":"additional","affiliation":[{"name":"Universit\u00e0 degli Studi di Udine, Udine, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5140-5783","authenticated-orcid":false,"given":"Fabio","family":"Mogavero","sequence":"additional","affiliation":[{"name":"Universit\u00e0 degli Studi di Napoli Federico II, Napoli, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,1,23]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-31803-5","volume-title":"Dependence Logic: Theory and Applications","author":"Abramsky S.","year":"2016","unstructured":"S. Abramsky, J. Kontinen, J. A. V\u00e4\u00e4n\u00e4nen, and H. Vollmer. 2016. Dependence Logic: Theory and Applications. Springer."},{"key":"e_1_3_3_3_2","first-page":"2638","volume-title":"AAAI Press19","author":"Acar E.","year":"2019","unstructured":"E. Acar, M. Benerecetti, and F. Mogavero. 2019. Satisfiability in strategy logic can be easier than model checking. In AAAI Press19. AAAI Press, 2638\u20132645."},{"key":"e_1_3_3_4_2","first-page":"368","volume-title":"Logic in Computer Science\u201913","author":"Benerecetti M.","year":"2013","unstructured":"M. Benerecetti, F. Mogavero, and A. Murano. 2013. Substructure temporal logic. In Logic in Computer Science\u201913. IEEE Computer Society, 368\u2013377."},{"issue":"3","key":"e_1_3_3_5_2","first-page":"25:1\u201346","article-title":"Reasoning about substructures and games","volume":"16","author":"Benerecetti M.","year":"2015","unstructured":"M. Benerecetti, F. Mogavero, and A. Murano. 2015. Reasoning about substructures and games. Transactions on Computational Logic 16, 3 (2015), 25:1\u201346.","journal-title":"Transactions on Computational Logic"},{"issue":"1","key":"e_1_3_3_6_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(86)90040-0","article-title":"Henkin quantifiers and complete problems","volume":"32","author":"Blass A.","year":"1986","unstructured":"A. Blass and Y. Gurevich. 1986. Henkin quantifiers and complete problems. Annals of Pure and Applied Logic 32, 1 (1986), 1\u201316.","journal-title":"Annals of Pure and Applied Logic"},{"key":"e_1_3_3_7_2","first-page":"19:1\u201319","volume-title":"Concurrency Theory\u201919 (LIPIcs 140)","author":"Boker U.","year":"2019","unstructured":"U. Boker and K. Lehtinen. 2019. Good for games automata: From nondeterminism to alternation. In Concurrency Theory\u201919 (LIPIcs 140), Vol. 140. Leibniz-Zentrum fuer Informatik, 19:1\u201319."},{"key":"e_1_3_3_8_2","volume-title":"Handbook of Proof Theory","author":"Buss S. R.","year":"1998","unstructured":"S. R. Buss. 1998. Handbook of Proof Theory. Elsevier."},{"key":"e_1_3_3_9_2","first-page":"59","volume-title":"Concurrency Theory\u201907 (LNCS 4703)","author":"Chatterjee K.","year":"2007","unstructured":"K. Chatterjee, T. A. Henzinger, and N. Piterman. 2007. Strategy logic. In Concurrency Theory\u201907 (LNCS 4703). Springer, 59\u201373."},{"issue":"6","key":"e_1_3_3_10_2","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/j.ic.2009.07.004","article-title":"Strategy logic","volume":"208","author":"Chatterjee K.","year":"2010","unstructured":"K. Chatterjee, T. A. Henzinger, and N. Piterman. 2010. Strategy logic. Information and Computation 208, 6 (2010), 677\u2013693.","journal-title":"Information and Computation"},{"key":"e_1_3_3_11_2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/978-3-642-54792-8_15","volume-title":"Principles of Security and Trust\u201914 (LNCS 8414)","author":"Clarkson M. R.","year":"2014","unstructured":"M. R. Clarkson, B. Finkbeiner, M. Koleini, K. K. Micinski, M. Rabe, and C. S\u00e1nchez. 2014. Temporal logics for hyperproperties. In Principles of Security and Trust\u201914 (LNCS 8414). Springer, 265\u2013284."},{"issue":"6","key":"e_1_3_3_12_2","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.3233\/JCS-2009-0393","article-title":"Hyperproperties","volume":"18","author":"Clarkson M. R.","year":"2010","unstructured":"M. R. Clarkson and F. B. Schneider. 2010. Hyperproperties. Journal of Computer Security 18, 6 (2010), 1157\u20131210.","journal-title":"Journal of Computer Security"},{"key":"e_1_3_3_13_2","first-page":"1","volume-title":"Logic in Computer Science\u201919","author":"Coenen N.","year":"2019","unstructured":"N. Coenen, B. Finkbeiner, C. Hahn, and J. Hofmann. 2019. The hierarchy of hyperlogics. In Logic in Computer Science\u201919. IEEE Computer Society, 1\u201313."},{"key":"e_1_3_3_14_2","first-page":"328","volume-title":"Foundation of Computer Science\u201988","author":"Emerson E. A.","year":"1988","unstructured":"E. A. Emerson and C. S. Jutla. 1988. The complexity of tree automata and logics of programs (extended abstract). In Foundation of Computer Science\u201988. IEEE Computer Society, 328\u2013337."},{"key":"e_1_3_3_15_2","first-page":"368","volume-title":"Foundation of Computer Science\u201991","author":"Emerson E. A.","year":"1991","unstructured":"E. A. Emerson and C. S. Jutla. 1991. Tree automata, muCalculus, and determinacy. In Foundation of Computer Science\u201991. IEEE Computer Society, 368\u2013377."},{"key":"e_1_3_3_16_2","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-56922-7_32","volume-title":"Computer Aided Verification\u201993 (LNCS 697)","author":"Emerson E. A.","year":"1993","unstructured":"E. A. Emerson, C. S. Jutla, and A. P. Sistla. 1993. On model-checking for fragments of muCalculus. In Computer Aided Verification\u201993 (LNCS 697). Springer, 385\u2013396."},{"key":"e_1_3_3_17_2","first-page":"13:1\u201314","volume-title":"Concurrency Theory\u201916 (LIPIcs 59)","author":"Finkbeiner B.","year":"2016","unstructured":"B. Finkbeiner and C. Hahn. 2016. Deciding hyperproperties. In Concurrency Theory\u201916 (LIPIcs 59). Leibniz-Zentrum fuer Informatik, 13:1\u201314."},{"key":"e_1_3_3_18_2","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/978-3-319-21690-4_3","volume-title":"Computer Aided Verification\u201915 (LNCS 9206)","author":"Finkbeiner B.","year":"2015","unstructured":"B. Finkbeiner, M. N. Rabe, and C. S\u00e1nchez. 2015. Algorithms for model checking HyperLTL and HyperCTL*. In Computer Aided Verification\u201915 (LNCS 9206). Springer, 30\u201348."},{"key":"e_1_3_3_19_2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/978-3-642-15205-4_25","volume-title":"Computer Science Logic\u201910 (LNCS 6247)","author":"Finkbeiner B.","year":"2010","unstructured":"B. Finkbeiner and S. Schewe. 2010. Coordination logic. In Computer Science Logic\u201910 (LNCS 6247). Springer, 305\u2013319."},{"key":"e_1_3_3_20_2","first-page":"30:1\u201314","volume-title":"Symposium on Theoretical Aspects of Computer Science\u201917 (LIPIcs 66)","author":"Finkbeiner B.","year":"2016","unstructured":"B. Finkbeiner and M. Zimmermann. 2016. The first-order logic of hyperproperties. In Symposium on Theoretical Aspects of Computer Science\u201917 (LIPIcs 66). Leibniz-Zentrum fuer Informatik, 30:1\u201314."},{"key":"e_1_3_3_21_2","first-page":"165","volume-title":"Advances in Artificial Intelligence\u201901 (LNCS 2256)","author":"French T.","year":"2001","unstructured":"T. French. 2001. Decidability of quantified propositional branching time logics. In Advances in Artificial Intelligence\u201901 (LNCS 2256). Springer, 165\u2013176."},{"issue":"504","key":"e_1_3_3_22_2","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1093\/mind\/fzw026","article-title":"Counting incompossibles","volume":"126","author":"Fritz P.","year":"2017","unstructured":"P. Fritz and J. Goodman. 2017. Counting incompossibles. Mind 126, 504 (2017), 1063\u20131108.","journal-title":"Mind"},{"key":"e_1_3_3_23_2","first-page":"245","volume-title":"Contributions to the Theory of Games (vol. II).","author":"Gale D.","year":"1953","unstructured":"D. Gale and F. M. Stewart. 1953. Infinite games with perfect information. In Contributions to the Theory of Games (vol. II). Vol. 28. Princeton University Press, 245\u2013266."},{"key":"e_1_3_3_24_2","first-page":"34:1\u201315","volume-title":"Symposium on Theoretical Aspects of Computer Science\u201918 (LIPIcs 96)","author":"Gardy P.","year":"2018","unstructured":"P. Gardy, P. Bouyer, and N. Markey. 2018. Dependences in strategy logic. In Symposium on Theoretical Aspects of Computer Science\u201918 (LIPIcs 96). Leibniz-Zentrum fuer Informatik, 34:1\u201315."},{"issue":"3","key":"e_1_3_3_25_2","first-page":"467","article-title":"Dependences in strategy logic","volume":"64","author":"Gardy P.","year":"2020","unstructured":"P. Gardy, P. Bouyer, and N. Markey. 2020. Dependences in strategy logic. Theoretical Computer Science 64, 3 (2020), 467\u2013507.","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_3_26_2","volume-title":"Behavioral QLTL","author":"Giacomo G. De","year":"2021","unstructured":"G. De Giacomo and G. Perelli. 2021. Behavioral QLTL. Technical Report. arXiv."},{"key":"e_1_3_3_27_2","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata, Logics, and Infinite Games: A Guide to Current Research","author":"Gr\u00e4del E.","year":"2002","unstructured":"E. Gr\u00e4del, W. Thomas, and T. Wilke. 2002. Automata, Logics, and Infinite Games: A Guide to Current Research. Springer."},{"issue":"2","key":"e_1_3_3_28_2","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s11225-013-9479-2","article-title":"Dependence and independence","volume":"101","author":"Gr\u00e4del E.","year":"2013","unstructured":"E. Gr\u00e4del and J. A. V\u00e4\u00e4n\u00e4nen. 2013. Dependence and independence. Studia Logica 101, 2 (2013), 399\u2013410.","journal-title":"Studia Logica"},{"key":"e_1_3_3_29_2","first-page":"932","volume-title":"International Joint Conference on Artificial Intelligence\u201913","author":"Gutierrez J.","year":"2013","unstructured":"J. Gutierrez, P. Harrenstein, and M. Wooldridge. 2013. Iterated Boolean games. In International Joint Conference on Artificial Intelligence\u201913. International Joint Conference on Artificial Intelligence & AAAI Press, 932\u2013938."},{"key":"e_1_3_3_30_2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.ic.2015.03.011","article-title":"Iterated Boolean games","volume":"242","author":"Gutierrez J.","year":"2015","unstructured":"J. Gutierrez, P. Harrenstein, and M. Wooldridge. 2015. Iterated Boolean games. Information and Computation 242 (2015), 53\u201379.","journal-title":"Information and Computation"},{"issue":"3","key":"e_1_3_3_31_2","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1002\/malq.19940400307","article-title":"Reflection of long game formulas","volume":"40","author":"Heikkil\u00e4 H.","year":"1994","unstructured":"H. Heikkil\u00e4 and J. A. V\u00e4\u00e4n\u00e4nen. 1994. Reflection of long game formulas. Mathematical Logic Quarterly 40, 3 (1994), 381\u2013392.","journal-title":"Mathematical Logic Quarterly"},{"issue":"3","key":"e_1_3_3_32_2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0168-0072(89)90070-5","article-title":"Definability hierarchies of generalized quantifiers","volume":"43","author":"Hella L.","year":"1989","unstructured":"L. Hella. 1989. Definability hierarchies of generalized quantifiers. Annals of Pure and Applied Logic 43, 3 (1989), 235\u2013271.","journal-title":"Annals of Pure and Applied Logic"},{"key":"e_1_3_3_33_2","first-page":"167","volume-title":"Infinistic Methods\u201961","author":"Henkin L.","year":"1961","unstructured":"L. Henkin. 1961. Some remarks on infinitely long formulas. In Infinistic Methods\u201961. Pergamon Press, 167\u2013183."},{"key":"e_1_3_3_34_2","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/11874683_26","volume-title":"Computer Science Logic\u201906 (LNCS 4207)","author":"Henzinger T. A.","year":"2006","unstructured":"T. A. Henzinger and N. Piterman. 2006. Solving games without determinization. In Computer Science Logic\u201906 (LNCS 4207). Springer, 395\u2013410."},{"key":"e_1_3_3_35_2","volume-title":"Logic, Language-Games and Information: Kantian Themes in the Philosophy of Logic","author":"Hintikka J.","year":"1973","unstructured":"J. Hintikka. 1973. Logic, Language-Games and Information: Kantian Themes in the Philosophy of Logic. Oxford University Press."},{"issue":"3","key":"e_1_3_3_36_2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1111\/j.1746-8361.1973.tb00624.x","article-title":"Quantifiers vs. quantification theory","volume":"27","author":"Hintikka J.","year":"1973","unstructured":"J. Hintikka. 1973. Quantifiers vs. quantification theory. Dialectica 27, 3\u20134 (1973), 329\u2013358.","journal-title":"Dialectica"},{"key":"e_1_3_3_37_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-8601-6","volume-title":"Lingua Universalis vs. Calculus Ratiocinator: An Ultimate Presupposition of Twentieth-Century Philosophy","author":"Hintikka J.","year":"1997","unstructured":"J. Hintikka. 1997. Lingua Universalis vs. Calculus Ratiocinator: An Ultimate Presupposition of Twentieth-Century Philosophy. Springer."},{"issue":"1","key":"e_1_3_3_38_2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0003-4843(76)90026-7","article-title":"A new approach to infinitary languages","volume":"10","author":"Hintikka J.","year":"1976","unstructured":"J. Hintikka and V. Rantala. 1976. A new approach to infinitary languages. Annals of Mathematical Logic 10, 1 (1976), 95\u2013115.","journal-title":"Annals of Mathematical Logic"},{"key":"e_1_3_3_39_2","first-page":"571","volume-title":"International Congress on Logic, Methodology, and Philosophy of Science\u201989","author":"Hintikka J.","year":"1989","unstructured":"J. Hintikka and G. Sandu. 1989. Informational independence as a semantical phenomenon. In International Congress on Logic, Methodology, and Philosophy of Science\u201989. Elsevier, 571\u2013589."},{"key":"e_1_3_3_40_2","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/B978-044481714-3\/50009-6","volume-title":"Handbook of Logic and Language","author":"Hintikka J.","year":"1997","unstructured":"J. Hintikka and G. Sandu. 1997. Game-theoretical semantics. In Handbook of Logic and Language. North-Holland & Elsevier, 361\u2013410."},{"key":"e_1_3_3_41_2","volume-title":"A Shorter Model Theory","author":"Hodges W.","year":"1997","unstructured":"W. Hodges. 1997. A Shorter Model Theory. Cambridge University Press."},{"issue":"4","key":"e_1_3_3_42_2","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1093\/jigpal\/5.4.539","article-title":"Compositional semantics for a language of imperfect information","volume":"5","author":"Hodges W.","year":"1997","unstructured":"W. Hodges. 1997. Compositional semantics for a language of imperfect information. Logic Journal of the IGPL 5, 4 (1997), 539\u2013563.","journal-title":"Logic Journal of the IGPL"},{"key":"e_1_3_3_43_2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-63246-8_4","volume-title":"Structures in Logic and Computer Science: A Selection of Essays in Honor of A. Ehrenfeucht","author":"Hodges W.","year":"1997","unstructured":"W. Hodges. 1997. Some strange quantifiers. In Structures in Logic and Computer Science: A Selection of Essays in Honor of A. Ehrenfeucht. Springer, 51\u201365."},{"issue":"3","key":"e_1_3_3_44_2","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/0022-0000(81)90039-8","article-title":"Number of quantifiers is better than number of tape cells","volume":"22","author":"Immerman N.","year":"1981","unstructured":"N. Immerman. 1981. Number of quantifiers is better than number of tape cells. Journal of Computer and System Science 22, 3 (1981), 384\u2013406.","journal-title":"Journal of Computer and System Science"},{"key":"e_1_3_3_45_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-22807-0","volume-title":"Logic and Games on Automatic Structures - Playing with Quantifiers and Decompositions","author":"Kaiser L.","year":"2011","unstructured":"L. Kaiser. 2011. Logic and Games on Automatic Structures - Playing with Quantifiers and Decompositions. Springer."},{"key":"e_1_3_3_46_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0171-7","volume-title":"Automata Theory and Its Applications","author":"Khoussainov B.","year":"2001","unstructured":"B. Khoussainov and A. Nerode. 2001. Automata Theory and Its Applications. Birkhauser."},{"key":"e_1_3_3_47_2","first-page":"365","volume-title":"Handbook of Model-Theoretic Logics","author":"Kolaitis P. G.","year":"1985","unstructured":"P. G. Kolaitis. 1985. Game quantification. In Handbook of Model-Theoretic Logics. Springer, 365\u2013421."},{"key":"e_1_3_3_48_2","first-page":"10:1\u201316","volume-title":"Mathematical Foundations of Computer Science\u201918 (LIPIcs 117)","author":"Krebs A.","year":"2018","unstructured":"A. Krebs, A. Meier, J. Virtema, and M. Zimmermann. 2018. Team semantics for the specification and verification of hyperproperties. In Mathematical Foundations of Computer Science\u201918 (LIPIcs 117). Leibniz-Zentrum fuer Informatik, 10:1\u201316."},{"issue":"2","key":"e_1_3_3_49_2","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0022-0531(82)90029-1","article-title":"Rational cooperation in the finitely repeated prisoners\u2019 dilemma","volume":"27","author":"Kreps D. M.","year":"1982","unstructured":"D. M. Kreps, P. Milgrom, J. Roberts, and R. Wilson. 1982. Rational cooperation in the finitely repeated prisoners\u2019 dilemma. Journal of Economic Theory 27, 2 (1982), 245\u2013252.","journal-title":"Journal of Economic Theory"},{"issue":"1","key":"e_1_3_3_50_2","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1073\/pnas.36.10.570","article-title":"Extensive games","volume":"36","author":"Kuhn H. W.","year":"1950","unstructured":"H. W. Kuhn. 1950. Extensive games. Proceedings of the National Academy of Sciences 36, 1 (1950), 570\u2013576.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"e_1_3_3_51_2","first-page":"193","volume-title":"Contributions to the Theory of Games (vol. II).","author":"Kuhn H. W.","year":"1953","unstructured":"H. W. Kuhn. 1953. Extensive games and the problem of information. In Contributions to the Theory of Games (vol. II). Vol. 28. Princeton University Press, 193\u2013216."},{"issue":"2","key":"e_1_3_3_52_2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10849-015-9217-4","article-title":"A double team semantics for generalized quantifiers","volume":"24","author":"Kuusisto A.","year":"2015","unstructured":"A. Kuusisto. 2015. A double team semantics for generalized quantifiers. Journal of Logic, Language, and Information 24, 2 (2015), 149\u2013191.","journal-title":"Journal of Logic, Language, and Information"},{"issue":"4","key":"e_1_3_3_53_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-10(4:17)2014","article-title":"Quantified CTL: Expressiveness and complexity","volume":"10","author":"Laroussinie F.","year":"2014","unstructured":"F. Laroussinie and N. Markey. 2014. Quantified CTL: Expressiveness and complexity. Logical Methods in Computer Science 10, 4 (2014), 1\u201345.","journal-title":"Logical Methods in Computer Science"},{"key":"e_1_3_3_54_2","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BF01973341","article-title":"Dialogspiele als semantische grundlage von Logikkalk\u00fclen","volume":"11","author":"Lorenz K.","year":"1968","unstructured":"K. Lorenz. 1968. Dialogspiele als semantische grundlage von Logikkalk\u00fclen. Archiv f\u00fcr Mathematische Logik und Grundlagenforschung 11 (1968), 32\u201355.","journal-title":"Archiv f\u00fcr Mathematische Logik und Grundlagenforschung"},{"key":"e_1_3_3_55_2","first-page":"193","volume-title":"Symposium on Foundations of Mathematics\u201959","author":"Lorenzen P.","year":"1961","unstructured":"P. Lorenzen. 1961. Ein dialogisches Konstruktivit\u00e4tskriterium. In Symposium on Foundations of Mathematics\u201959. Polish Scientific Publishers, 193\u2013200."},{"key":"e_1_3_3_56_2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511981418","volume-title":"Independence-Friendly Logic - A Game-Theoretic Approach","author":"Mann A. L.","year":"2011","unstructured":"A. L. Mann, G. Sandu, and M. Sevenster. 2011. Independence-Friendly Logic - A Game-Theoretic Approach. Cambridge University Press."},{"issue":"2","key":"e_1_3_3_57_2","doi-asserted-by":"crossref","first-page":"363","DOI":"10.2307\/1971035","article-title":"Borel determinacy","volume":"102","author":"Martin A. D.","year":"1975","unstructured":"A. D. Martin. 1975. Borel determinacy. Annals of Mathematics 102, 2 (1975), 363\u2013371.","journal-title":"Annals of Mathematics"},{"key":"e_1_3_3_58_2","first-page":"303","volume-title":"Recursion Theory\u201982 (Symposia in Pure Mathematics\u201942)","author":"Martin A. D.","year":"1985","unstructured":"A. D. Martin. 1985. A purely inductive proof of Borel determinacy. In Recursion Theory\u201982 (Symposia in Pure Mathematics\u201942). American Mathematical Society and Association for Symbolic Logic, 303\u2013308."},{"key":"e_1_3_3_59_2","first-page":"193","volume-title":"Concurrency Theory\u201912 (LNCS 7454)","author":"Mogavero F.","year":"2012","unstructured":"F. Mogavero, A. Murano, G. Perelli, and M. Y. Vardi. 2012. What makes ATL* decidable? A decidable fragment of strategy logic. In Concurrency Theory\u201912 (LNCS 7454). Springer, 193\u2013208."},{"issue":"4","key":"e_1_3_3_60_2","first-page":"34:1\u201342","article-title":"Reasoning about strategies: On the model-checking problem","volume":"15","author":"Mogavero F.","year":"2014","unstructured":"F. Mogavero, A. Murano, G. Perelli, and M. Y. Vardi. 2014. Reasoning about strategies: On the model-checking problem. Transactions on Computational Logic 15, 4 (2014), 34:1\u201342.","journal-title":"Transactions on Computational Logic"},{"issue":"1","key":"e_1_3_3_61_2","first-page":"1","article-title":"Reasoning about strategies: On the satisfiability problem","volume":"13","author":"Mogavero F.","year":"2017","unstructured":"F. Mogavero, A. Murano, G. Perelli, and M. Y. Vardi. 2017. Reasoning about strategies: On the satisfiability problem. Logical Methods in Computer Science 13, 1:9 (2017), 1\u201337.","journal-title":"Logical Methods in Computer Science"},{"key":"e_1_3_3_62_2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.2991\/978-94-91216-95-4","volume-title":"Logic in Computer Science\u201913","author":"Mogavero F.","year":"2013","unstructured":"F. Mogavero, A. Murano, and L. Sauro. 2013. On the boundary of behavioral strategies. In Logic in Computer Science\u201913. IEEE Computer Society, 263\u2013272."},{"key":"e_1_3_3_63_2","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/978-3-319-09764-0_10","volume-title":"Computational Logic in Multi-Agent Systems\u201914 (LNCS 8624)","author":"Mogavero F.","year":"2014","unstructured":"F. Mogavero, A. Murano, and L. Sauro. 2014. A behavioral hierarchy of strategy logic. In Computational Logic in Multi-Agent Systems\u201914 (LNCS 8624). Springer, 148\u2013165."},{"key":"e_1_3_3_64_2","first-page":"133","volume-title":"Foundations of Software Technology and Theoretical Computer Science\u201910 (LIPIcs 8)","author":"Mogavero F.","year":"2010","unstructured":"F. Mogavero, A. Murano, and M. Y. Vardi. 2010. Reasoning about strategies. In Foundations of Software Technology and Theoretical Computer Science\u201910 (LIPIcs 8). Leibniz-Zentrum fuer Informatik, 133\u2013144."},{"key":"e_1_3_3_65_2","first-page":"157","volume-title":"Symposium on Computation Theory\u201984 (LNCS 208)","author":"Mostowski A. W.","year":"1984","unstructured":"A. W. Mostowski. 1984. Regular expressions for infinite trees and a standard form of automata. In Symposium on Computation Theory\u201984 (LNCS 208). Springer, 157\u2013168."},{"key":"e_1_3_3_66_2","volume-title":"Games with Forbidden Positions","author":"Mostowski A. W.","year":"1991","unstructured":"A. W. Mostowski. 1991. Games with Forbidden Positions. Technical Report. University of Gda\u0144sk, Gda\u0144sk, Poland."},{"issue":"1","key":"e_1_3_3_67_2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(94)00214-4","article-title":"Simulating alternating tree automata by nondeterministic automata: New results and new proofs of theorems of Rabin, McNaughton, and Safra","volume":"141","author":"Muller D. E.","year":"1995","unstructured":"D. E. Muller and P. E. Schupp. 1995. Simulating alternating tree automata by nondeterministic automata: New results and new proofs of theorems of Rabin, McNaughton, and Safra. Theoretical Computer Science 141, 1\u20132 (1995), 69\u2013107.","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_3_68_2","volume-title":"Game Theory: Analysis of Conflict","author":"Myerson R. B.","year":"1991","unstructured":"R. B. Myerson. 1991. Game Theory: Analysis of Conflict. Harvard University Press."},{"key":"e_1_3_3_69_2","volume-title":"Infinite Words","author":"Perrin D.","year":"2004","unstructured":"D. Perrin and J. Pin. 2004. Infinite Words. Elsevier."},{"key":"e_1_3_3_70_2","first-page":"255","volume-title":"Logic in Computer Science\u201906","author":"Piterman N.","year":"2006","unstructured":"N. Piterman. 2006. From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. In Logic in Computer Science\u201906. IEEE Computer Society, 255\u2013264."},{"key":"e_1_3_3_71_2","first-page":"46","volume-title":"Foundation of Computer Science\u201977","author":"Pnueli A.","year":"1977","unstructured":"A. Pnueli. 1977. The temporal logic of programs. In Foundation of Computer Science\u201977. IEEE Computer Society, 46\u201357."},{"key":"e_1_3_3_72_2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(81)90110-9","article-title":"The temporal semantics of concurrent programs","volume":"13","author":"Pnueli A.","year":"1981","unstructured":"A. Pnueli. 1981. The temporal semantics of concurrent programs. Theoretical Computer Science 13 (1981), 45\u201360.","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_3_73_2","first-page":"179","volume-title":"Principles of Programming Languages\u201989","author":"Pnueli A.","year":"1989","unstructured":"A. Pnueli and R. Rosner. 1989. On the synthesis of a reactive module. In Principles of Programming Languages\u201989. Association for Computing Machinery, 179\u2013190."},{"key":"e_1_3_3_74_2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01049180","article-title":"On the logic of informational independence and its applications","volume":"22","author":"Sandu G.","year":"1993","unstructured":"G. Sandu. 1993. On the logic of informational independence and its applications. Journal of Philosophical Logic 22 (1993), 29\u201360.","journal-title":"Journal of Philosophical Logic"},{"issue":"1","key":"e_1_3_3_75_2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1023\/A:1026530709583","article-title":"Aspects of compositionality","volume":"10","author":"Sandu G.","year":"2001","unstructured":"G. Sandu and J. Hintikka. 2001. Aspects of compositionality. Journal of Logic, Language, and Information 10, 1 (2001), 49\u201361.","journal-title":"Journal of Logic, Language, and Information"},{"issue":"1","key":"e_1_3_3_76_2","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1002\/malq.19920380134","article-title":"Partially ordered connectives","volume":"38","author":"Sandu G.","year":"1992","unstructured":"G. Sandu and J. A. V\u00e4\u00e4n\u00e4nen. 1992. Partially ordered connectives. Mathematical Logic Quarterly 38, 1 (1992), 361\u2013372.","journal-title":"Mathematical Logic Quarterly"},{"issue":"1","key":"e_1_3_3_77_2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF01766400","article-title":"Reexamination of the perfectness concept for equilibrium points in extensive games","volume":"4","author":"Selten R.","year":"1975","unstructured":"R. Selten. 1975. Reexamination of the perfectness concept for equilibrium points in extensive games. International Journal of Game Theory 4, 1 (1975), 25\u201355.","journal-title":"International Journal of Game Theory"},{"key":"e_1_3_3_78_2","volume-title":"Theoretical Issues in the Design and Verification of Distributed Systems","author":"Sistla A. P.","year":"1983","unstructured":"A. P. Sistla. 1983. Theoretical Issues in the Design and Verification of Distributed Systems. Ph.D. Dissertation. Harvard University, Cambridge, MA, USA."},{"key":"e_1_3_3_79_2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","article-title":"The complementation problem for B\u00fcchi automata with applications to temporal logic","volume":"49","author":"Sistla A. P.","year":"1987","unstructured":"A. P. Sistla, M. Y. Vardi, and P. Wolper. 1987. The complementation problem for B\u00fcchi automata with applications to temporal logic. Theoretical Computer Science 49 (1987), 217\u2013237.","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_3_80_2","series-title":"London Mathematical Society Student Texts","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511611193","volume-title":"Dependence Logic: A New Approach to Independence Friendly Logic","author":"V\u00e4\u00e4n\u00e4nen J. A.","year":"2007","unstructured":"J. A. V\u00e4\u00e4n\u00e4nen. 2007. Dependence Logic: A New Approach to Independence Friendly Logic. London Mathematical Society Student Texts, Vol. 70. Cambridge University Press."},{"key":"e_1_3_3_81_2","volume-title":"From Frege to G\u00f6del: A Source Book in Mathematical Logic, 1879-1931","author":"Heijenoort J. van","year":"1967","unstructured":"J. van Heijenoort. 1967. From Frege to G\u00f6del: A Source Book in Mathematical Logic, 1879-1931. Harvard University Press."},{"key":"e_1_3_3_82_2","first-page":"332","volume-title":"Logic in Computer Science\u201986","author":"Vardi M. Y.","year":"1986","unstructured":"M. Y. Vardi and P. Wolper. 1986. An automata-theoretic approach to automatic program verification. In Logic in Computer Science\u201986. IEEE Computer Society, 332\u2013344."},{"issue":"2","key":"e_1_3_3_83_2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0022-0000(86)90026-7","article-title":"Automata-theoretic techniques for modal logics of programs","volume":"32","author":"Vardi M. Y.","year":"1986","unstructured":"M. Y. Vardi and P. Wolper. 1986. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science 32, 2 (1986), 183\u2013221.","journal-title":"Journal of Computer and System Science"},{"key":"e_1_3_3_84_2","first-page":"52:1\u201317","volume-title":"Foundations of Software Technology and Theoretical Computer Science\u201921 (LIPIcs 213)","author":"Virtema J.","year":"2021","unstructured":"J. Virtema, J. Hofmann, B. Finkbeiner, J. Kontinen, and F. Yang. 2021. Linear-time temporal logic with team semantics: Expressivity and complexity. In Foundations of Software Technology and Theoretical Computer Science\u201921 (LIPIcs 213). Leibniz-Zentrum fuer Informatik, 52:1\u201317."},{"issue":"1","key":"e_1_3_3_85_2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01448847","article-title":"Zur theorie der gesellschaftsspiele","volume":"100","author":"Neumann J. von","year":"1928","unstructured":"J. von Neumann. 1928. Zur theorie der gesellschaftsspiele. Math. Ann. 100, 1 (1928), 295\u2013320.","journal-title":"Math. Ann."},{"key":"e_1_3_3_86_2","volume-title":"Theory of Games and Economic Behavior","author":"Neumann J. von","year":"1944","unstructured":"J. von Neumann and O. Morgenstern. 1944. Theory of Games and Economic Behavior. Princeton University Press."},{"key":"e_1_3_3_87_2","doi-asserted-by":"crossref","first-page":"841","DOI":"10.2140\/pjm.1955.5.841","article-title":"The strict determinateness of certain infinite games","volume":"5","author":"Wolfe P.","year":"1955","unstructured":"P. Wolfe. 1955. The strict determinateness of certain infinite games. Pacific Journal of Mathemantics 5 (1955), 841\u2013847.","journal-title":"Pacific Journal of Mathemantics"},{"issue":"1","key":"e_1_3_3_88_2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","article-title":"Infinite games on finitely coloured graphs with applications to automata on infinite trees","volume":"200","author":"Zielonka W.","year":"1998","unstructured":"W. Zielonka. 1998. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science 200, 1\u20132 (1998), 135\u2013183.","journal-title":"Theoretical Computer Science"}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565365","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3565365","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:12Z","timestamp":1750178232000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,23]]},"references-count":87,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1,31]]}},"alternative-id":["10.1145\/3565365"],"URL":"https:\/\/doi.org\/10.1145\/3565365","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"value":"1529-3785","type":"print"},{"value":"1557-945X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,23]]},"assertion":[{"value":"2021-09-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-06-24","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}