{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T23:56:52Z","timestamp":1794527812210,"version":"4.9.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319449524","type":"print"},{"value":"9783319449531","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_18","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T11:12:23Z","timestamp":1471864343000},"page":"268-286","source":"Crossref","is-referenced-by-count":1,"title":["A New Approach to Checking the Dynamic Consistency of Conditional Simple Temporal Networks"],"prefix":"10.1007","author":[{"given":"Luke","family":"Hunsberger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roberto","family":"Posenato","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"key":"18_CR1","unstructured":"Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Satisfiability, pp. 825\u2013885. IOS Press, Amsterdam (2009)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Behrmann, G., Cougnard, A., David, A., Fleury, E., Larsen, K.G., Lime, D.: UPPAAL-Tiga: time for playing games! In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 121\u2013125. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-73368-3_14"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/11539452_9","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"F Cassez","year":"2005","unstructured":"Cassez, F., David, A., Fleury, E., Larsen, K.G., Lime, D.: Efficient on-the-fly algorithms for the analysis of timed games. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 66\u201380. Springer, Heidelberg (2005)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Cimatti, A., Hunsberger, L., Micheli, A., Posenato, R., Roveri, M.: Sound and complete algorithms for checking the dynamic controllability of temporal networks with uncertainty, disjunction and observation. In: TIME 2014. pp. 27\u201336. IEEE Computer Society, September 2014","DOI":"10.1109\/TIME.2014.21"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Cimatti, A., Hunsberger, L., Micheli, A., Roveri, M.: Using timed game automata to synthesize execution strategies for simple temporal networks with uncertainty. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014) (2014)","DOI":"10.1609\/aaai.v28i1.9040"},{"key":"18_CR6","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 30th AAAI Conference on Artificial Intelligence (AAAI 2016) (2016)","DOI":"10.1609\/aaai.v30i1.10401"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Comin, C., Rizzi, R.: Dynamic consistency of conditional simple temporal networks via mean payoff games: a singly-exponential time DC-checking. In: 22st International Symposium on Temporal Representation and Reasoning (TIME 2015), pp. 19\u201328. IEEE CPS, September 2015","DOI":"10.1109\/TIME.2015.18"},{"issue":"1\u20133","key":"18_CR8","doi-asserted-by":"crossref","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). http:\/\/dx.doi.org\/10.1016\/0004-3702(91)90006-6","journal-title":"Artif. Intell."},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"1856","DOI":"10.1016\/j.artint.2011.03.007","volume":"175","author":"S Gelly","year":"2011","unstructured":"Gelly, S., Silver, D.: Monte-carlo tree search and rapid action value estimation in computer go. Artif. Intell. 175, 1856\u20131875 (2011)","journal-title":"Artif. Intell."},{"key":"18_CR10","unstructured":"Harvey, W., Ginsberg, M.: Limited discrepancy search. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pp. 607\u2013613 (1995)"},{"key":"18_CR11","unstructured":"Hunsberger, L.: Group decision making and temporal reasoning. Ph.D. thesis, Harvard University, available as Harvard Technical Report TR-05-02 (2002)"},{"key":"18_CR12","unstructured":"Hunsberger, L., Posenato, R., Combi, C.: The dynamic controllability of conditional STNs with uncertainty. In: Proceedings of the Workshop on Planning and Plan Execution for Real-World Systems: Principles and Practices (PlanEx), ICAPS-2012, pp. 1\u20138 (2012)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Hunsberger, L., Posenato, R., Combi, C.: A sound-and-complete propagation-based algorithm for checking the dynamic consistency of conditional simple temporal networks. In: 22st International Symposium on Temporal Representation and Reasoning (TIME 2015), pp. 4\u201318. IEEE CPS, September 2015","DOI":"10.1109\/TIME.2015.26"},{"key":"18_CR14","unstructured":"Lanz, A., Reichert, M.: Enabling time-aware process support with the atapis toolset. In: Limonad, L., Weber, B. (eds.) Proceedings of the BPM Demo Sessions 2014. CEUR Workshop Proceedings, vol. 1295, pp. 41\u201345. CEUR (2014)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BFb0055040","volume-title":"Automata, Languages and Programming","author":"X Liu","year":"1998","unstructured":"Liu, X., Smolka, S.A.: Simple linear-time algorithms for minimal fixed points. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 53\u201366. Springer, Heidelberg (1998)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1007\/978-3-319-07046-9_33","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"P Morris","year":"2014","unstructured":"Morris, P.: Dynamic controllability and dispatchability relationships. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 464\u2013479. Springer, Heidelberg (2014)"},{"key":"18_CR17","unstructured":"Morris, P.H., Muscettola, N., Vidal, T.: Dynamic control of plans with temporal uncertainty. In: Nebel, B. (ed.) Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), pp. 494\u2013502. Kaufmann (2001)"},{"key":"18_CR18","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1023\/A:1025894003623","volume":"8","author":"I Tsamardinos","year":"2003","unstructured":"Tsamardinos, I., Vidal, T., Pollack, M.E.: CTP: a new constraint-based formalism for conditional, temporal planning. Constraints 8, 365\u2013388 (2003)","journal-title":"Constraints"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44953-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T17:21:32Z","timestamp":1657128092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_18","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}