{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:17Z","timestamp":1759638557116,"version":"3.40.4"},"reference-count":50,"publisher":"Oxford University Press (OUP)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Logic Computation"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1093\/logcom\/exu052","type":"journal-article","created":{"date-parts":[[2014,9,27]],"date-time":"2014-09-27T03:55:37Z","timestamp":1411790137000},"page":"1663-1695","source":"Crossref","is-referenced-by-count":2,"title":["Relentful strategic reasoning in alternating-time temporal logic"],"prefix":"10.1093","volume":"26","author":[{"given":"Fabio","family":"Mogavero","sequence":"first","affiliation":[]},{"given":"Aniello","family":"Murano","sequence":"additional","affiliation":[]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2014,9,25]]},"reference":[{"key":"2016092623524269000_26.5.1663.1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585270"},{"key":"2016092623524269000_26.5.1663.2","doi-asserted-by":"crossref","unstructured":"Barth A. Datta A. Mitchell J. C. Nissenbaum H. Privacy and contextual integrity: framework and applications. In: Paxson V. Pfitzmann B. , editors. IEEE Symposium on Security and Privacy\u201906. IEEE Computer Society; 2006. p. 184-198.","DOI":"10.1109\/SP.2006.32"},{"key":"2016092623524269000_26.5.1663.3","doi-asserted-by":"crossref","unstructured":"Bianco A. Mogavero F. Murano A. Graded computation tree logic. In: Pitts A. , editor. IEEE Symposium on Logic in Computer Science\u201909. IEEE Computer Society; 2009. p. 342-351.","DOI":"10.1109\/LICS.2009.28"},{"key":"2016092623524269000_26.5.1663.4","doi-asserted-by":"crossref","unstructured":"Bianco A. Mogavero F. Murano A. Graded computation tree logic with binary coding. In: Dawar A. Veith H. , editors. EACSL Annual Conference on Computer Science Logic\u201910. Springer; 2010. p. 125-139. LNCS 6247.","DOI":"10.1007\/978-3-642-15205-4_13"},{"key":"2016092623524269000_26.5.1663.5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2287718.2287725","article-title":"Graded computation tree logic","volume":"13","author":"Bianco","year":"2012","journal-title":"ACM Transactions On Computational Logic"},{"key":"2016092623524269000_26.5.1663.6","doi-asserted-by":"crossref","unstructured":"Bonatti P. A. Lutz C. Murano A. Vardi M. Y. The complexity of enriched \u03bc-caluli. In: Bugliesi M. Preneel B. Sassone V. Wegener I. , editors. ICALP (2), LNCS 4052. Springer; 2006. p. 540-551.","DOI":"10.1007\/11787006_46"},{"key":"2016092623524269000_26.5.1663.7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-4(3:11)2008","article-title":"The complexity of enriched mu-calculi","volume":"4","author":"Bonatti","year":"2008","journal-title":"Logical Methods in Computer Science"},{"key":"2016092623524269000_26.5.1663.8","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-013-9231-3"},{"key":"2016092623524269000_26.5.1663.9","unstructured":"Bulling N. Jamroga W. Popovici M. Agents with truly perfect recall in alternating-time temporal logic. In: Lomuscio A. Scerri P. Bazzan A. Huhns M. , editors. Autonomous Agents and Multiagent Systems\u201914. 2014. p. 1561-1662."},{"key":"2016092623524269000_26.5.1663.10","doi-asserted-by":"crossref","unstructured":"Bulling N. Jamroga W. Popovici M. ATL* with truly perfect recall: expressiveness and validities. In: Schaub T. Friedrich G. O'Sullivan B. , editors. European Conference on Artificial Intelligence\u201914. 2014. p. 6.","DOI":"10.3233\/978-1-61499-419-0-177"},{"key":"2016092623524269000_26.5.1663.11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2009.07.004"},{"key":"2016092623524269000_26.5.1663.12","doi-asserted-by":"crossref","unstructured":"Daniele M. Traverso P. Vardi M. Y. Strong cyclic planning revisited. In: Biundo S. Fox M. , editors. European Conference on Planning\u201999. 2000. p. 35-48.","DOI":"10.1007\/10720246_3"},{"key":"2016092623524269000_26.5.1663.13","doi-asserted-by":"publisher","DOI":"10.1145\/4904.4999"},{"key":"2016092623524269000_26.5.1663.14","doi-asserted-by":"crossref","unstructured":"Fagin R. Halpern J. Y. Moses Y. Vardi M. Y. Reasoning about Knowledge MIT Press; 1995.","DOI":"10.7551\/mitpress\/5803.001.0001"},{"key":"2016092623524269000_26.5.1663.15","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90046-1"},{"key":"2016092623524269000_26.5.1663.16","doi-asserted-by":"crossref","unstructured":"Fisman D. Kupferman O. Lustig Y. Rational synthesis. In: Esparza J. Majumdar R. , editors. International Conference on Tools and Algorithms for the Construction and Analysis of Systems\u201910, LNCS 6015. Springer; 2010. p. 190-204.","DOI":"10.1007\/978-3-642-12002-2_16"},{"key":"2016092623524269000_26.5.1663.17","doi-asserted-by":"crossref","unstructured":"Gabbay D. M. The declarative past and imperative future: executable temporal logic for interactive systems. In: Banieqbal B. Barringer H. Pnueli A. , editors. Temporal Logic in Specification\u201987, LNCS 398. Springer; 1987. p. 409-448.","DOI":"10.1007\/3-540-51803-7_36"},{"key":"2016092623524269000_26.5.1663.18","unstructured":"Huang X. ; Gini M. Shehory O. Ito T. Jonker C. , editors. Bounded planning for strategic goals with incomplete information and perfect recall. Autonomous Agents and Multiagent Systems\u201913 2013:885-892."},{"key":"2016092623524269000_26.5.1663.19","doi-asserted-by":"crossref","unstructured":"Jamroga W. Strategic planning through model checking of ATL formulae. In: Rutkowski L. Siekmann J. Tadeusiewicz R. Zadeh L. , editors. International Conference on Artificial Intelligence and Soft Computing\u201904, LNCS 3070. Springer; 2004. p. 879-884.","DOI":"10.1007\/978-3-540-24844-6_136"},{"key":"2016092623524269000_26.5.1663.20","doi-asserted-by":"crossref","unstructured":"Janin D. Walukiewicz I. Automata for the Modal \u03bc-Calculus and Related Results. In: Wiedermann J. H\u00e1jek P. , editors. International Symposiums on Mathematical Foundations of Computer Science\u201995, LNCS 969. Springer; 1995. p. 552-562.","DOI":"10.1007\/3-540-60246-1_160"},{"key":"2016092623524269000_26.5.1663.21","doi-asserted-by":"crossref","unstructured":"Kupferman O. Pnueli A. ; Kozen D. , editor. Once and for all. IEEE Symposium on Logic in Computer Science\u201995 IEEE Computer Society; 1995:25-35.","DOI":"10.1109\/LICS.1995.523241"},{"key":"2016092623524269000_26.5.1663.22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.08.006"},{"key":"2016092623524269000_26.5.1663.23","doi-asserted-by":"crossref","unstructured":"Kupferman O. Vardi M. Y. Module checking revisited. In: Grumberg O. , editor. CAV, LNCS 1254. Springer; 1997. p. 36-47.","DOI":"10.1007\/3-540-63166-6_7"},{"key":"2016092623524269000_26.5.1663.24","doi-asserted-by":"crossref","unstructured":"Kupferman O. Vardi M. Y. Weak alternating automata and tree automata emptiness. In: Vitter J. , editor. ACM Symposium on Theory of Computing\u201998. 1998. p. 224-233.","DOI":"10.1145\/276698.276748"},{"key":"2016092623524269000_26.5.1663.25","doi-asserted-by":"crossref","unstructured":"Kupferman O. Vardi M. Y. ; Alur R. , editor. Memoryful branching-time logic. IEEE Symposium on Logic in Computer Science\u201906 IEEE Computer Society; 2006:265-274.","DOI":"10.1109\/LICS.2006.34"},{"key":"2016092623524269000_26.5.1663.26","doi-asserted-by":"publisher","DOI":"10.1145\/333979.333987"},{"key":"2016092623524269000_26.5.1663.27","doi-asserted-by":"crossref","unstructured":"Laroussinie F. Markey N. Schnoebelen P. Temporal logic with forgettable past. In: Plotkin G. , editor. IEEE Symposium on Logic in Computer Science\u201902. IEEE Computer Society; 2002. p. 383-392.","DOI":"10.1109\/LICS.2002.1029846"},{"key":"2016092623524269000_26.5.1663.28","doi-asserted-by":"crossref","unstructured":"Lichtenstein O. Pnueli A. Zuck L. D. The glory of the past. In: Parikh R. , editor. Logic of Programs\u201985. 1985. p. 196-218.","DOI":"10.1007\/3-540-15648-8_16"},{"key":"2016092623524269000_26.5.1663.29","unstructured":"F. Mogavero. Branching-Time Temporal Logics (Theoretical Issues and a Computer Science Application). PhD Thesis, Universit\u00e1 degli Studi di Napoli \u201cFederico II\u201d, Napoli, Italy, 2007."},{"key":"2016092623524269000_26.5.1663.30","unstructured":"Mogavero F. Murano A. Perelli G. Vardi M. Y. Reasoning about strategies: on the model-checking problem. Technical Report 1112.6275, arXiv 2011."},{"key":"2016092623524269000_26.5.1663.31","doi-asserted-by":"crossref","unstructured":"Mogavero F. Murano A. Perelli G. Vardi M. Y. A decidable fragment of strategy logic. Technical Report 1202.1309, arXiv 2012.","DOI":"10.1007\/978-3-642-32940-1_15"},{"key":"2016092623524269000_26.5.1663.32","doi-asserted-by":"crossref","unstructured":"Mogavero F. Murano A. Perelli G. Vardi M. Y. What makes ATL* decidable? a decidable fragment of strategy logic. In: Koutny M. Ulidowski I. , editors. CONCUR, LNCS 7454. Springer; 2012. p. 193-208.","DOI":"10.1007\/978-3-642-32940-1_15"},{"issue":"34","key":"2016092623524269000_26.5.1663.33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2631917","article-title":"Reasoning about strategies: on the model-checking problem","volume":"15","author":"Mogavero","year":"2014","journal-title":"ACM Transactions On Computational Logic"},{"key":"2016092623524269000_26.5.1663.34","unstructured":"Mogavero F. Murano A. Vardi M. Y. Reasoning about strategies. In: Lodaya K. Mahajan M. , editors. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science\u201910. 2010. p. 133-144. LIPIcs 8."},{"key":"2016092623524269000_26.5.1663.35","doi-asserted-by":"crossref","unstructured":"Mogavero F. Murano A. Vardi M. Y. Relentful strategic reasoning in alternating-time temporal logic. In: Ferm\u00fcller C. Voronkov A. , editors. International Conference on Logic for Programming Artificial Intelligence and Reasoning\u201910, LNAI 6355. Springer; 2010. p. 371-387.","DOI":"10.1007\/978-3-642-17511-4_21"},{"key":"2016092623524269000_26.5.1663.36","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90133-2"},{"key":"2016092623524269000_26.5.1663.37","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00214-4"},{"key":"2016092623524269000_26.5.1663.38","doi-asserted-by":"crossref","unstructured":"Niebert P. Peled D. Pnueli A. Discriminative model checking. In: Gupta A. Malik S. , editors. Computer Aided Verification\u201908, LNCS 5123. Springer; 2008. p. 504-516.","DOI":"10.1007\/978-3-540-70545-1_48"},{"key":"2016092623524269000_26.5.1663.39","unstructured":"Osborne M. J. Rubinstein A. A Course in Game Theory. MIT Press; 1994."},{"key":"2016092623524269000_26.5.1663.40","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1613\/jair.1909","article-title":"The planning spectrum-one, two, three, infinity","volume":"30","author":"Pistore","year":"2007","journal-title":"Journal of Artificial Intelligence Research"},{"key":"2016092623524269000_26.5.1663.41","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM Journal of Research and Development"},{"key":"2016092623524269000_26.5.1663.42","doi-asserted-by":"crossref","unstructured":"Schewe S. ATL* Satisfiability is 2ExpTime-Complete. In: Aceto L. Damg\u00e5rd I. Goldberg L. Halld\u00f3rsson M. Ing\u00f3lfsd\u00f3ttir A. Walukiewicz I. , editors. International Colloquium on Automata, Languages and Programming\u201908, LNCS 5126. Springer; 2008. p. 373-385.","DOI":"10.1007\/978-3-540-70583-3_31"},{"key":"2016092623524269000_26.5.1663.43","doi-asserted-by":"crossref","unstructured":"Schewe S. Finkbeiner B. Satisfiability and finite model property for the alternating-time \u03bc-calculus. In: \u00c9sik Z. , editor. EACSL Annual Conference on Computer Science Logic\u201906, LNCS 4207. Springer; 2006. p. 591-605.","DOI":"10.1007\/11874683_39"},{"key":"2016092623524269000_26.5.1663.44","first-page":"82","article-title":"Alternating-time logic with imperfect recall","volume":"85","author":"Schobbens","year":"2004","journal-title":"ENTCS"},{"key":"2016092623524269000_26.5.1663.45","doi-asserted-by":"crossref","unstructured":"van der Hoek W. Wooldridge M. J. Tractable multiagent planning for epistemic goals. In: Castelfranchi C. Johnson L. , editors. Autonomous Agents and Multiagent Systems\u201902. 2002. p. 1167-1174.","DOI":"10.1145\/545056.545095"},{"key":"2016092623524269000_26.5.1663.46","doi-asserted-by":"crossref","unstructured":"Vardi M. Y. A temporal fixpoint calculus. In: Ferrante J. Mager P. , editors. ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages\u201988. 1988. p. 250-259.","DOI":"10.1145\/73560.73582"},{"key":"2016092623524269000_26.5.1663.47","doi-asserted-by":"crossref","unstructured":"Vardi M. Y. Reasoning about the past with two-way automata. In: Larsen K. Skyum S. Winskel G. , editors. ICALP, LNCS 1443. Springer; 1998. p. 628-641.","DOI":"10.1007\/BFb0055090"},{"key":"2016092623524269000_26.5.1663.48","unstructured":"Vardi M. Y. Wolper P. An automata-theoretic approach to automatic program verification. In: Meyer A. , editor. IEEE Symposium on Logic in Computer Science\u201986. IEEE Computer Society; 1986. p. 332-344."},{"key":"2016092623524269000_26.5.1663.49","unstructured":"Winsborough W. H. von Ronne J. Chowdhury O. Niu J. Ashik Md. S. Technical Report CS-TR-2011-009. The University of Texas at San Antonio; 2011. Towards practical privacy policy enforcement."},{"key":"2016092623524269000_26.5.1663.50","unstructured":"Wooldridge M. J. Introduction to Multiagent Systems. John Wiley & Sons; 2001."}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/26\/5\/1663\/6832995\/exu052.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T21:52:17Z","timestamp":1746395537000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article-lookup\/doi\/10.1093\/logcom\/exu052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,25]]},"references-count":50,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2016,9,26]]},"published-print":{"date-parts":[[2016,10]]}},"alternative-id":["10.1093\/logcom\/exu052"],"URL":"https:\/\/doi.org\/10.1093\/logcom\/exu052","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"type":"print","value":"0955-792X"},{"type":"electronic","value":"1465-363X"}],"subject":[],"published":{"date-parts":[[2014,9,25]]}}}