{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:02:37Z","timestamp":1742925757277,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319035239"},{"type":"electronic","value":"9783319035246"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03524-6_38","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T12:35:00Z","timestamp":1386592500000},"page":"445-456","source":"Crossref","is-referenced-by-count":0,"title":["A Reduction-Based Approach for Solving Disjunctive Temporal Problems with Preferences"],"prefix":"10.1007","author":[{"given":"Jean-R\u00e9mi","family":"Bourguet","sequence":"first","affiliation":[]},{"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Pulina","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"38_CR1","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. Artificial Intelligence\u00a049(1-3), 61\u201395 (1991)","journal-title":"Artificial Intelligence"},{"issue":"7-8","key":"38_CR2","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1016\/j.artint.2010.11.016","volume":"175","author":"M.D. Moffitt","year":"2011","unstructured":"Moffitt, M.D.: On the modelling and optimization of preferences in constraint-based temporal reasoning. Artificial Intelligence\u00a0175(7-8), 1390\u20131409 (2011)","journal-title":"Artificial Intelligence"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(03)00113-9","volume":"151","author":"I. Tsamardinos","year":"2003","unstructured":"Tsamardinos, I., Pollack, M.: Efficient solution techniques for disjunctive temporal reasoning problems. Artificial Intelligence\u00a0151, 43\u201389 (2003)","journal-title":"Artificial Intelligence"},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/11564751_45","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"H.M. Sheini","year":"2005","unstructured":"Sheini, H.M., Peintner, B., Sakallah, K.A., Pollack, M.E.: On solving soft temporal constraints using SAT techniques. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 607\u2013621. Springer, Heidelberg (2005)"},{"key":"38_CR5","unstructured":"Moffitt, M.D., Pollack, M.E.: Partial constraint satisfaction of disjunctive temporal problems. In: Russell, I., Markov, Z. (eds.) Proc. of the 18th International Conference of the Florida Artificial Intelligence Research Society (FLAIRS 2005), pp. 715\u2013720. AAAI Press (2005)"},{"key":"38_CR6","unstructured":"Moffitt, M.D., Pollack, M.E.: Temporal preference optimization as weighted constraint satisfaction. In: Proc. of the 21st National Conference on Artificial Intelligence (AAAI 2006). AAAI Press (2006)"},{"key":"38_CR7","unstructured":"Peintner, B., Pollack, M.E.: Low-cost addition of preferences to DTPs and TCSPs. In: McGuinness, D.L., Ferguson, G. (eds.) Proc. of the 19th National Conference on Artificial Intelligence (AAAI 2004), pp. 723\u2013728. AAAI Press\/The MIT Press (2004)"},{"key":"38_CR8","unstructured":"Peintner, B., Moffitt, M.D., Pollack, M.E.: Solving over-constrained disjunctive temporal problems with preferences. In: Biundo, S., Myers, K.L., Rajan, K. (eds.) Proc. of the 15th International Conference on Automated Planning and Scheduling (ICAPS 2005), pp. 202\u2013211. AAAI (2005)"},{"issue":"2","key":"38_CR9","first-page":"137","volume":"25","author":"M. Maratea","year":"2012","unstructured":"Maratea, M., Pulina, L.: Solving disjunctive temporal problems with preferences using maximum satisfiability. AI Commununications\u00a025(2), 137\u2013156 (2012)","journal-title":"AI Commununications"},{"key":"38_CR10","unstructured":"Stergiou, K., Koubarakis, M.: Backtracking algorithms for disjunctions of temporal constraints. In: Shrobe, H.E., Mitchell, T.M., Smith, R.G. (eds.) Proc. of the 15th National Conference on Artificial Intelligence (AAAI 1998), pp. 248\u2013253. AAAI Press\/The MIT Press (1998)"},{"key":"38_CR11","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/10720246_8","volume-title":"Recent Advances in AI Planning","author":"A. Armando","year":"2000","unstructured":"Armando, A., Castellini, C., Giunchiglia, E.: SAT-based procedures for temporal reasoning. In: Biundo, S., Fox, M. (eds.) ECP 1999. LNCS (LNAI), vol.\u00a01809, pp. 97\u2013108. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2013: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03524-6_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T09:16:30Z","timestamp":1676366190000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-03524-6_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035239","9783319035246"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03524-6_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}