{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T05:54:55Z","timestamp":1773467695094,"version":"3.50.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030770907","type":"print"},{"value":"9783030770914","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-77091-4_13","type":"book-chapter","created":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T16:03:21Z","timestamp":1621613001000},"page":"204-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Solving Operating Room Scheduling Problems with Surgical Teams via\u00a0Answer Set Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5617-5286","authenticated-orcid":false,"given":"Carmine","family":"Dodaro","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1948-4469","authenticated-orcid":false,"given":"Giuseppe","family":"Galat\u00e0","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1366-512X","authenticated-orcid":false,"given":"Muhammad Kamran","family":"Khan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9034-2527","authenticated-orcid":false,"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0601-8071","authenticated-orcid":false,"given":"Ivan","family":"Porro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,22]]},"reference":[{"key":"13_CR1","first-page":"15","volume":"5","author":"A Abedini","year":"2016","unstructured":"Abedini, A., Ye, H., Li, W.: Operating room planning under surgery type and priority constraints. Proc. Manuf. 5, 15\u201325 (2016)","journal-title":"Proc. Manuf."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-030-20528-7_18","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2019","unstructured":"Alviano, M., Amendola, G., Dodaro, C., Leone, N., Maratea, M., Ricca, F.: Evaluation of disjunctive programs in WASP. In: Balduccini, M., Lierler, Y., Woltran, S. (eds.) LPNMR 2019. LNCS, vol. 11481, pp. 241\u2013255. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20528-7_18"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70169-1_35","volume-title":"AI*IA 2017 Advances in Artificial Intelligence","author":"M Alviano","year":"2017","unstructured":"Alviano, M., Dodaro, C., Maratea, M.: An advanced answer set programming encoding for nurse scheduling. In: Esposito, F., Basili, R., Ferilli, S., Lisi, F. (eds.) AI*IA 2017. LNCS, vol. 10640. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70169-1_35"},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.3233\/IA-170030","volume":"12","author":"M Alviano","year":"2018","unstructured":"Alviano, M., Dodaro, C., Maratea, M.: Nurse (re)scheduling via answer set programming. Intelligenza Artificiale 12(2), 109\u2013124 (2018)","journal-title":"Intelligenza Artificiale"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-49130-1_13","volume-title":"AI*IA 2016: Advances in Artificial Intelligence","author":"G Amendola","year":"2016","unstructured":"Amendola, G., Dodaro, C., Leone, N., Ricca, F.: On the application of answer set programming to the conference paper assignment problem. In: Adorni, G., Cagnoni, S., Gori, M., Maratea, M. (eds.) AI*IA 2016. LNCS (LNAI), vol. 10037, pp. 164\u2013178. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49130-1_13"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.cor.2014.08.014","volume":"54","author":"R Aringhieri","year":"2015","unstructured":"Aringhieri, R., Landa, P., Soriano, P., T\u00e0nfani, E., Testi, A.: A two level metaheuristic for the operating room scheduling and assignment problem. Comput. Oper. Res. 54, 21\u201334 (2015)","journal-title":"Comput. Oper. Res."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1016\/j.cie.2018.10.017","volume":"126","author":"M Belkhamsa","year":"2018","unstructured":"Belkhamsa, M., Jarboui, B., Masmoudi, M.: Two metaheuristics for solving no-wait operating room surgery scheduling problem under various resource constraints. Comput. Ind. Eng. 126, 494\u2013506 (2018)","journal-title":"Comput. Ind. Eng."},{"issue":"12","key":"13_CR8","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1017\/S1471068419000450","volume":"20","author":"F Calimeri","year":"2020","unstructured":"Calimeri, F., et al.: ASP-Core-2 input language format. Theory Pract. Logic Program. 20(2), 294\u2013309 (2020)","journal-title":"Theory Pract. Logic Program."},{"key":"13_CR10","unstructured":"Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: The design of the fifth answer set programming competition. CoRR abs\/1405.3710 (2014). http:\/\/arxiv.org\/abs\/1405.3710"},{"key":"13_CR11","unstructured":"Di Rosa, E., Giunchiglia, E., Maratea, M.: A new approach for solving satisfiability problems with qualitative preferences. In: Ghallab, M., Spyropoulos, C.D., Fakotakis, N., Avouris, N.M. (eds.) ECAI. Frontiers in Artificial Intelligence and Applications, vol. 178, pp. 510\u2013514. IOS Press (2008)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-31095-0_5","volume-title":"Rules and Reasoning","author":"C Dodaro","year":"2019","unstructured":"Dodaro, C., Galat\u00e0, G., Khan, M.K., Maratea, M., Porro, I.: An ASP-based solution for operating room scheduling with beds management. In: Fodor, P., Montali, M., Calvanese, D., Roman, D. (eds.) RuleML+RR 2019. LNCS, vol. 11784, pp. 67\u201381. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31095-0_5"},{"key":"13_CR13","unstructured":"Dodaro, C., Galat\u00e0, G., Khan, M.K., Maratea, M., Porro, I.: An ASP based solution for operating room scheduling with surgical teams in hospital environments. In: Benedictis, R.D., et al. (eds.) Joint Proceedings of the 8th Italian Workshop on Planning and Scheduling and the 27th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion. CEUR Workshop Proceedings, vol. 2745. CEUR-WS.org (2020)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-030-03840-3_33","volume-title":"AI*IA 2018 \u2013 Advances in Artificial Intelligence","author":"C Dodaro","year":"2018","unstructured":"Dodaro, C., Galat\u00e0, G., Maratea, M., Porro, I.: Operating room scheduling via answer set programming. In: Ghidini, C., Magnini, B., Passerini, A., Traverso, P. (eds.) AI*IA 2018. LNCS (LNAI), vol. 11298, pp. 445\u2013459. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03840-3_33"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"63","DOI":"10.3233\/IA-190020","volume":"13","author":"C Dodaro","year":"2019","unstructured":"Dodaro, C., Galat\u00e0, G., Maratea, M., Porro, I.: An ASP-based framework for operating room scheduling. Intelligenza Artificiale 13(1), 63\u201377 (2019)","journal-title":"Intelligenza Artificiale"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-319-61660-5_27","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"C Dodaro","year":"2017","unstructured":"Dodaro, C., Maratea, M.: Nurse scheduling via answer set programming. In: Balduccini, M., Janhunen, T. (eds.) LPNMR 2017. LNCS (LNAI), vol. 10377, pp. 301\u2013307. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61660-5_27"},{"key":"13_CR17","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with Clingo 5. In: ICLP (Technical Communications). OASICS, vol. 52, pp. 2:1\u20132:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-61660-5_1","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2017","unstructured":"Gebser, M., Maratea, M., Ricca, F.: The design of the seventh answer set programming competition. In: Balduccini, M., Janhunen, T. (eds.) LPNMR 2017. LNCS (LNAI), vol. 10377, pp. 3\u20139. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61660-5_1"},{"issue":"2","key":"13_CR19","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1017\/S1471068419000061","volume":"20","author":"M Gebser","year":"2020","unstructured":"Gebser, M., Maratea, M., Ricca, F.: The seventh answer set programming competition: design and results. Theory Pract. Log. Program. 20(2), 176\u2013204 (2020)","journal-title":"Theory Pract. Log. Program."},{"issue":"3\u20134","key":"13_CR20","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1017\/S1471068418000182","volume":"18","author":"M Gebser","year":"2018","unstructured":"Gebser, M., Obermeier, P., Schaub, T., Ratsch-Heitmann, M., Runge, M.: Routing driverless transport vehicles in car assembly with answer set programming. Theory Pract. Log. Program. 18(3\u20134), 520\u2013534 (2018)","journal-title":"Theory Pract. Log. Program."},{"key":"13_CR21","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, 15\u201319 August 1988 (2 Volumes), pp. 1070\u20131080. MIT Press (1988)"},{"issue":"3\/4","key":"13_CR22","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3\/4), 365\u2013386 (1991). https:\/\/doi.org\/10.1007\/BF03037169","journal-title":"New Gener. Comput."},{"issue":"1\u20134","key":"13_CR23","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10472-009-9113-1","volume":"53","author":"E Giunchiglia","year":"2008","unstructured":"Giunchiglia, E., Leone, N., Maratea, M.: On the relation among answer set solvers. Ann. Math. Artif. Intell. 53(1\u20134), 169\u2013204 (2008). https:\/\/doi.org\/10.1007\/s10472-009-9113-1","journal-title":"Ann. Math. Artif. Intell."},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11562931_6","volume-title":"Logic Programming","author":"E Giunchiglia","year":"2005","unstructured":"Giunchiglia, E., Maratea, M.: On the relation between answer set and SAT procedures (or, between cmodels and smodels). In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 37\u201351. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11562931_6"},{"key":"13_CR25","unstructured":"Giunchiglia, E., Maratea, M.: Solving optimization problems with DLL. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) ECAI. Frontiers in Artificial Intelligence and Applications, vol. 141, pp. 377\u2013381. IOS Press (2006)"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/3-540-45757-7_25","volume-title":"Logics in Artificial Intelligence","author":"E Giunchiglia","year":"2002","unstructured":"Giunchiglia, E., Maratea, M., Tacchella, A.: Dependent and independent variables in propositional satisfiability. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 296\u2013307. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45757-7_25"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1007\/978-3-540-45193-8_64","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"E Giunchiglia","year":"2003","unstructured":"Giunchiglia, E., Maratea, M., Tacchella, A.: (In)Effectiveness of look-ahead techniques in a modern SAT solver. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 842\u2013846. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45193-8_64"},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/3-540-45744-5_26","volume-title":"Automated Reasoning","author":"E Giunchiglia","year":"2001","unstructured":"Giunchiglia, E., Maratea, M., Tacchella, A., Zambonin, D.: Evaluating search heuristics and optimization techniques in propositional satisfiability. In: Gor\u00e9, R., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS, vol. 2083, pp. 347\u2013363. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45744-5_26"},{"key":"13_CR29","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.cor.2019.04.010","volume":"108","author":"M Hamid","year":"2019","unstructured":"Hamid, M., Nasiri, M.M., Werner, F., Sheikhahmadi, F., Zhalechian, M.: Operating room scheduling by considering the decision-making styles of surgical team members: a comprehensive approach. Comput. Oper. Res. 108, 166\u2013181 (2019)","journal-title":"Comput. Oper. Res."},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Meskens, N., Duvivier, D., Hanset, A.: Multi-objective operating room scheduling considering desiderata of the surgical team. Decis. Support Syst. 55(2), 650\u2013659 (2013). https:\/\/doi.org\/10.1016\/j.dss.2012.10.019","DOI":"10.1016\/j.dss.2012.10.019"},{"issue":"24","key":"13_CR31","doi-asserted-by":"publisher","first-page":"7434","DOI":"10.1080\/00207543.2015.1082040","volume":"53","author":"T Monteiro","year":"2015","unstructured":"Monteiro, T., Meskens, N., Wang, T.: Surgical scheduling with antagonistic human resource objectives. Int. J. Prod. Res. 53(24), 7434\u20137449 (2015)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"13_CR32","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S147106841100007X","volume":"12","author":"F Ricca","year":"2012","unstructured":"Ricca, F., et al.: Team-building with answer set programming in the Gioia-Tauro seaport. Theory Pract. Logic Program. 12(3), 361\u2013381 (2012)","journal-title":"Theory Pract. Logic Program."},{"issue":"3","key":"13_CR33","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.ejor.2012.09.010","volume":"224","author":"B Vijayakumar","year":"2013","unstructured":"Vijayakumar, B., Parikh, P.J., Scott, R., Barnes, A., Gallimore, J.: A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital. Eur. J. Oper. Res. 224(3), 583\u2013591 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR34","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.cie.2015.04.010","volume":"85","author":"W Xiang","year":"2015","unstructured":"Xiang, W., Yin, J., Lim, G.: An ant colony optimization approach for solving an operating room surgery scheduling problem. Comput. Ind. Eng. 85, 335\u2013345 (2015)","journal-title":"Comput. Ind. Eng."},{"key":"13_CR35","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/j.cie.2016.09.003","volume":"101","author":"B Zhou","year":"2016","unstructured":"Zhou, B., Yin, M., Lu, Z.: An improved Lagrangian relaxation heuristic for the scheduling problem of operating theatres. Comput. Ind. Eng. 101, 490\u2013503 (2016)","journal-title":"Comput. Ind. Eng."}],"container-title":["Lecture Notes in Computer Science","AIxIA 2020 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77091-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,23]],"date-time":"2021-06-23T15:07:11Z","timestamp":1624460831000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77091-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030770907","9783030770914"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77091-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIxIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aixia2020.disco.unimib.it\/","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":"89","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":"27","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":"3","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":"30% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}