{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:28:39Z","timestamp":1742938119124,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031455575"},{"type":"electronic","value":"9783031455582"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-45558-2_10","type":"book-chapter","created":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T14:02:43Z","timestamp":1698069763000},"page":"126-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Of Temporary Coalitions in\u00a0Terms of\u00a0Concurrent Game Models, Announcements, and\u00a0Temporal Projection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3101-7433","authenticated-orcid":false,"given":"Dimitar P.","family":"Guelev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,24]]},"reference":[{"key":"10_CR1","unstructured":"\u00c5gotnes, T., van Ditmarsch, H.P.: Coalitions and announcements. In: Proceedings of the AAMAS 2008, IFAAMAS, vol. 2, pp. 673\u2013680 (2008)"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"510","DOI":"10.2307\/2274239","volume":"50","author":"CE Alchourr\u00f3n","year":"1985","unstructured":"Alchourr\u00f3n, C.E., G\u00e4rdenfors, P., Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. J. Symb. Log. 50(2), 510\u2013530 (1985)","journal-title":"J. Symb. Log."},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-33353-8_8","volume-title":"Logics in Artificial Intelligence","author":"MB Andersen","year":"2012","unstructured":"Andersen, M.B., Bolander, T., Jensen, M.H.: Conditional epistemic planning. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS (LNAI), vol. 7519, pp. 94\u2013106. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33353-8_8"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1017\/S1755020308080210","volume":"1","author":"P Balbiani","year":"2008","unstructured":"Balbiani, P., Baltag, A., van Ditmarsch, H., Herzig, A., Hoshi, T., de Lima, T.: Knowable as known after an announcement. Rev. Symb. Log. 1(3), 305\u2013334 (2008)","journal-title":"Rev. Symb. Log."},{"key":"10_CR5","unstructured":"Baltag, A., Moss, L.S., Solecki, S.: The logic of public announcements and common knowledge and private suspicions. In: Proceedings of TARK-98, Morgan Kaufmann, pp. 43\u201356 (1998)"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-319-10575-8_10","volume-title":"Handbook of Model Checking","author":"A Biere","year":"2018","unstructured":"Biere, A., Kr\u00f6ning, D.: SAT-based model checking. In: Handbook of Model Checking, pp. 277\u2013303. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_10"},{"key":"10_CR7","unstructured":"Bolander, T., Jensen, M.H., Schwarzentruber, F.: Complexity results in epistemic planning. In: Proceedings of IJCAI 2015, pp. 2791\u20132797. AAAI Press (2015)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-28729-9_20","volume-title":"Foundations of Software Science and Computational Structures","author":"P Bouyer","year":"2012","unstructured":"Bouyer, P., Brenguier, R., Markey, N., Ummels, M.: Concurrent games with ordered objectives. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 301\u2013315. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28729-9_20"},{"key":"10_CR9","unstructured":"Cau, A., Moszkowski, B., Zedan, H.: ITL web pages. http:\/\/www.antonio-cau.co.uk\/ITL\/"},{"issue":"6","key":"10_CR10","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1093\/logcom\/exs061","volume":"24","author":"T de Lima","year":"2014","unstructured":"de Lima, T.: Alternating-time temporal dynamic epistemic logic. J. Log. Comput. 24(6), 1145\u20131178 (2014)","journal-title":"J. Log. Comput."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/3-540-45061-0_67","volume-title":"Automata, Languages and Programming","author":"C Eisner","year":"2003","unstructured":"Eisner, C., Fisman, D., Havlicek, J., McIsaac, A., Van Campenhout, D.: The definition of a temporal clock operator. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 857\u2013870. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_67"},{"key":"10_CR12","unstructured":"Enqvist, S., Goranko, V.: The temporal logic of coalitional goal assignments in concurrent multi-player games. CoRR abs\/2012.14195 (2020)"},{"key":"10_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning about Knowledge","author":"R Fagin","year":"1995","unstructured":"Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning about Knowledge. MIT Press, Cambridge (1995)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-12002-2_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Fisman","year":"2010","unstructured":"Fisman, D., Kupferman, O., Lustig, Y.: Rational synthesis. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 190\u2013204. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12002-2_16"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-030-00111-7_2","volume-title":"KI 2018: Advances in Artificial Intelligence","author":"R Galimullin","year":"2018","unstructured":"Galimullin, R., Alechina, N., van Ditmarsch, H.: Model checking for coalition announcement logic. In: Trollmann, F., Turhan, A.-Y. (eds.) KI 2018. LNCS (LNAI), vol. 11117, pp. 11\u201323. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00111-7_2"},{"key":"10_CR16","unstructured":"Guelev, D.P.: Reasoning about temporary coalitions and ltl-definable ordered objectives in infinite concurrent multiplayer games. CoRR abs\/2011.03724 (2020)"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.3166\/jancl.21.93-131","volume":"21","author":"DP Guelev","year":"2011","unstructured":"Guelev, D.P., Dima, C., Enea, C.: An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking. J. Appl. Non-Class. Logics 21(1), 93\u2013131 (2011)","journal-title":"J. Appl. Non-Class. Logics"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Guelev, D.P., Ryan, M.D., Schobbens, P.Y.: Synthesising features by games. In Automated Verification of Critical Systems (AVoCS 2005), vol. 145 of ENTCS, pp. 79\u201393. Elsevier (2006)","DOI":"10.1016\/j.entcs.2005.10.006"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/BFb0036915","volume-title":"Automata, Languages and Programming","author":"J Halpern","year":"1983","unstructured":"Halpern, J., Manna, Z., Moszkowski, B.: A hardware semantics based on temporal intervals. In: Diaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 278\u2013291. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/BFb0036915"},{"issue":"3","key":"10_CR20","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/S0097539797320906","volume":"33","author":"J Halpern","year":"2004","unstructured":"Halpern, J., van der Meyden, R., Vardi, M.: Complete axiomatizations for reasoning about knowledge and time. SIAM J. Comput. 33(3), 674\u2013703 (2004)","journal-title":"SIAM J. Comput."},{"key":"10_CR21","unstructured":"Van Ditmarsch, H., van der Hoek, W., Halpern, J.Y., Kooi, B.: Handbook of Epistemic Logic. College Publications (2015)"},{"key":"10_CR22","volume-title":"Dynamic Epistemic Logic","author":"H Van Ditmarsch","year":"2007","unstructured":"Van Ditmarsch, H., van Der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Springer, Cham (2007)"},{"issue":"2","key":"10_CR23","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1008746126376","volume":"10","author":"NR Jennings","year":"2001","unstructured":"Jennings, N.R., Faratin, P., Lomuscio, A.R., Parsons, S., Sierra, C., Wooldridge, M.: Automated negotiation: prospects, methods and challenges. Int. J. Group Decis. Negot. 10(2), 199\u2013215 (2001)","journal-title":"Int. J. Group Decis. Negot."},{"issue":"7","key":"10_CR24","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"RM Keller","year":"1976","unstructured":"Keller, R.M.: Formal verification of parallel programs. Commun. ACM 19(7), 371\u2013384 (1976)","journal-title":"Commun. ACM"},{"key":"10_CR25","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/6479.001.0001","volume-title":"Strategic Negotiation in Multiagent Environments","author":"S Kraus","year":"2001","unstructured":"Kraus, S.: Strategic Negotiation in Multiagent Environments. MIT Press, Cambridge (2001)"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-030-88708-7_10","volume-title":"Logic, Rationality, and Interaction","author":"Y Li","year":"2021","unstructured":"Li, Y.: Multi-agent conformant planning with\u00a0distributed knowledge. In: Ghosh, S., Icard, T. (eds.) LORI 2021. LNCS, vol. 13039, pp. 128\u2013140. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88708-7_10"},{"issue":"2","key":"10_CR27","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/MC.1985.1662795","volume":"18","author":"B Moszkowski","year":"1985","unstructured":"Moszkowski, B.: Temporal logic for multilevel reasoning about hardware. IEEE Comput. 18(2), 10\u201319 (1985)","journal-title":"IEEE Comput."},{"issue":"4","key":"10_CR28","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/s00165-017-0417-3","volume":"29","author":"B Moszkowski","year":"2017","unstructured":"Moszkowski, B., Guelev, D.P.: An application of temporal projection to interleaving concurrency. Formal Aspects Comput. 29(4), 705\u2013750 (2017). https:\/\/doi.org\/10.1007\/s00165-017-0417-3","journal-title":"Formal Aspects Comput."},{"key":"10_CR29","volume-title":"Rules of Encounter - Designing Conventions for Automated Negotiation among Computers","author":"JS Rosenschein","year":"1994","unstructured":"Rosenschein, J.S., Zlotkin, G.: Rules of Encounter - Designing Conventions for Automated Negotiation among Computers. MIT Press, Cambridge (1994)"},{"issue":"2","key":"10_CR30","first-page":"82","volume":"85","author":"PY Schobbens","year":"2004","unstructured":"Schobbens, P.Y.: Alternating-time logic with imperfect recall. ENTCS 85(2), 82\u201393 (2004)","journal-title":"ENTCS"},{"key":"10_CR31","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1026185103185","volume":"75","author":"W van der Hoek","year":"2003","unstructured":"van der Hoek, W., Wooldridge, M.: Cooperation, knowledge and time: alternating-time temporal epistemic logic and its applications. Stud. Logica. 75, 125\u2013157 (2003)","journal-title":"Stud. Logica."},{"issue":"1","key":"10_CR32","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1023\/A:1026181001368","volume":"75","author":"R van der Meyden","year":"2003","unstructured":"van der Meyden, R., Wong, K.S.: Complete axiomatizations for reasoning about knowledge and branching time. Stud. Logica. 75(1), 93\u2013123 (2003)","journal-title":"Stud. Logica."},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-46691-6_35","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"R van der Meyden","year":"1999","unstructured":"van der Meyden, R., Shilov, N.V.: Model checking knowledge and time in systems with perfect recall. In: Rangan, C.P., Raman, V., Ramanujam, R. (eds.) FSTTCS 1999. LNCS, vol. 1738, pp. 432\u2013445. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46691-6_35"}],"container-title":["Lecture Notes in Computer Science","Logic, Rationality, and Interaction"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45558-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T17:14:09Z","timestamp":1730394849000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45558-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031455575","9783031455582"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45558-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LORI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Rationality and Interaction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lori2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/golori.org\/lori2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}