{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:05:34Z","timestamp":1742929534766,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031606014"},{"type":"electronic","value":"9783031605994"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-60599-4_11","type":"book-chapter","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T09:02:09Z","timestamp":1716800529000},"page":"176-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SMT-Based Repair of Disjunctive Temporal Networks with Uncertainty: Strong and Weak Controllability"],"prefix":"10.1007","author":[{"given":"Ajdin","family":"Sumic","sequence":"first","affiliation":[]},{"given":"Alessandro","family":"Cimatti","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Micheli","sequence":"additional","affiliation":[]},{"given":"Thierry","family":"Vidal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Akmal, S., Ammons, S., Li, H., Gao, M., Popowski, L., Boerkoel Jr, J.C.: Quantifying controllability in temporal networks with uncertainty. Artif. Intell. 289, 103384 (2020). ISSN 0004-3702","DOI":"10.1016\/j.artint.2020.103384"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Akmal, S., Ammons, S., Li, H., Boerkoel Jr, J.C.: Quantifying degrees of controllability in temporal networks with uncertainty. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 29, pp. 22\u201330 (2019)","DOI":"10.1609\/icaps.v29i1.3456"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-319-10575-8_11","volume-title":"Handbook of Model Checking","author":"C Barrett","year":"2018","unstructured":"Barrett, C., Tinelli, C.: Satisfiability Modulo Theories. In: Handbook of Model Checking, pp. 305\u2013343. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_11"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Bettini, C., Wang, X.S., Jajodia, S.: Solving multi-granularity temporal constraint networks. Artif. Intell. 140(1\u20132), 107\u2013152 (2002)","DOI":"10.1016\/S0004-3702(02)00223-0"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-662-46681-0_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"N Bj\u00f8rner","year":"2015","unstructured":"Bj\u00f8rner, N., Phan, A.-D., Fleckenstein, L.: $${\\nu }$$Z - an optimizing SMT solver. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 194\u2013199. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_14"},{"key":"11_CR6","unstructured":"Casanova, G., Pralet, C., Lesire, C., Vidal, T.: Solving dynamic controllability problem of multi-agent plans with uncertainty using mixed integer linear programming. In: Gal, A. et al., (eds.), ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August\u20132 September 2016, The Hague, The Netherlands - Including Prestigious Applications of Artificial Intelligence (PAIS 2016), volume 285 of Frontiers in Artificial Intelligence and Applications, pp. 930\u2013938. IOS Press (2016)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2015.03.002","volume":"224","author":"A Cimatti","year":"2015","unstructured":"Cimatti, A., Micheli, A., Roveri, M.: An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty. Artif. Intell. 224, 1\u201327 (2015)","journal-title":"Artif. Intell."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Cimatti, A., Micheli, A., Roveri, M.: Dynamic controllability of disjunctive temporal networks: validation and synthesis of executable strategies. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 30 (2016)","DOI":"10.1609\/aaai.v30i1.10401"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10601-014-9167-5","volume":"20","author":"A Cimatti","year":"2015","unstructured":"Cimatti, A., Micheli, A., Roveri, M.: Solving strong controllability of temporal problems with uncertainty using SMT. Constraints 20, 1\u201329 (2015)","journal-title":"Constraints"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"issue":"1\u20133","key":"11_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artif. Intell. 49(1\u20133), 61\u201395 (1991)","journal-title":"Artif. Intell."},{"key":"11_CR12","unstructured":"Gario, M., Micheli, A.: PySMT: a solver-agnostic library for fast prototyping of SMT-based algorithms. In: SMT Workshop (2015)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Hunsberger, L., Posenato, R.: Speeding up the RUL dynamic-controllability-checking algorithm for simple temporal networks with uncertainty. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, pp. 9776\u20139785 (2022)","DOI":"10.1609\/aaai.v36i9.21213"},{"key":"11_CR14","unstructured":"Lubas, J., Franceschetti, M., Eder, J.: Resolving conflicts in process models with temporal constraints. In: Proceedings of the ER Forum and PhD Symposium (2022)"},{"issue":"2","key":"11_CR15","first-page":"155","volume":"11","author":"A Micheli","year":"2017","unstructured":"Micheli, A.: Disjunctive temporal networks with uncertainty via SMT: recent results and directions. Intell. Artif. 11(2), 155\u2013178 (2017)","journal-title":"Intell. Artif."},{"key":"11_CR16","unstructured":"Morris, P.H., Muscettola, N.: Temporal dynamic controllability revisited. In: Veloso, M.M., Kambhampati, S. (eds.), Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, 9\u201313 July 2005, Pittsburgh, Pennsylvania, USA, pp. 1193\u20131198. AAAI Press\/The MIT Press (2005). http:\/\/www.aaai.org\/Library\/AAAI\/2005\/aaai05-189.php"},{"key":"11_CR17","unstructured":"Morris, P.H., Muscettola, N., Vidal, T.: Dynamic control of plans with temporal uncertainty. In: Nebel, B. (ed.), Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, Washington, USA, 4\u201310 August 2001, pp. 494\u2013502. Morgan Kaufmann (2001)"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Osanlou, K., et al.: Solving disjunctive temporal networks with uncertainty under restricted time-based controllability using tree search and graph neural networks. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, pp. 9877\u20139885 (2022)","DOI":"10.1609\/aaai.v36i9.21224"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1016\/j.ins.2021.10.008","volume":"584","author":"R Posenato","year":"2022","unstructured":"Posenato, R., Combi, C.: Adding flexibility to uncertainty: flexible simple temporal networks with uncertainty (FTNU). Inf. Sci. 584, 784\u2013807 (2022)","journal-title":"Inf. Sci."},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Sebastiani, R., Tomasi, S.: Optimization modulo theories with linear rational costs. ACM Trans. Comput. Log. 16(2), 12:1\u201312:43 (2015)","DOI":"10.1145\/2699915"},{"key":"11_CR21","unstructured":"Shah, J.A., Williams, B.C.: Fast dynamic scheduling of disjunctive temporal constraint networks through incremental compilation. In: ICAPS, pp. 322\u2013329 (2008)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Stepin, I., Alonso, J.M., Catala, A., Pereira-Farina, M.: A survey of contrastive and counterfactual explanation generation methods for explainable artificial intelligence. IEEE Access 9, 11974\u201312001 (2021)","DOI":"10.1109\/ACCESS.2021.3051315"},{"issue":"1","key":"11_CR23","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0004-3702(00)00019-9","volume":"120","author":"K Stergiou","year":"2000","unstructured":"Stergiou, K., Koubarakis, M.: Backtracking algorithms for disjunctions of temporal constraints. Artif. Intell. 120(1), 81\u2013117 (2000)","journal-title":"Artif. Intell."},{"key":"11_CR24","unstructured":"Venable, K.B., Yorke-Smith, N.: Disjunctive temporal planning with uncertainty. In: IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30\u2013August 5, 2005, pp. 1721\u20131722. Professional Book Center (2005)"},{"issue":"1","key":"11_CR25","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/095281399146607","volume":"11","author":"T Vidal","year":"1999","unstructured":"Vidal, T., Fargier, H.: Handling contingency in temporal constraint networks: from consistency to controllabilities. J. Exp. Theor. Artif. Intell. 11(1), 23\u201345 (1999)","journal-title":"J. Exp. Theor. Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60599-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T09:03:52Z","timestamp":1716800632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60599-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031606014","9783031605994"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60599-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}