{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:18:19Z","timestamp":1740122299380,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T00:00:00Z","timestamp":1530489600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10601-018-9293-6","type":"journal-article","created":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T01:37:37Z","timestamp":1530495457000},"page":"383-402","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Translation-based approaches for solving disjunctive temporal problems with preferences"],"prefix":"10.1007","volume":"23","author":[{"given":"Enrico","family":"Giunchiglia","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9034-2527","authenticated-orcid":false,"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Pulina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,2]]},"reference":[{"key":"9293_CR1","unstructured":"Bourguet, J.R., Maratea, M., Pulina, L. (2013). A reduction-based approach for solving disjunctive temporal problems with preferences. In M. Baldoni, C. Baroglio, G. Boella, R. Micalizio (Eds.) Proceedings of the 13th international conference of the Italian association for artificial intelligence (AI*IA): advances in artificial intelligence. Volume 8249 of lecture notes in computer science (pp. 445\u2013456). Berlin: Springer."},{"issue":"1\u20133","key":"9293_CR2","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. (1991). Temporal constraint networks. Artificial Intelligence, 49(1\u20133), 61\u201395.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"9293_CR3","first-page":"9","volume":"26","author":"ME Pollack","year":"2005","unstructured":"Pollack, M.E. (2005). Intelligent technology for an aging population: the use of AI to assist elders with cognitive impairment. AI Magazine, 26(2), 9\u201324.","journal-title":"AI Magazine"},{"key":"9293_CR4","unstructured":"Berry, P.M., Gervasio, M.T., Uribe, T.E., Pollack, M.E., Moffitt, M.D. (2005). A personalized time management assistant: research directions. In Persistent assistants: living and working with ai, papers from the 2005 AAAI spring symposium, technical Report SS-05-05 (pp. 1\u20136). Stanford: AAAI."},{"key":"9293_CR5","unstructured":"Berry, P.M., Gervasio, M.T., Peintner, B., Yorke-Smith, N. (2007). A preference model for over-constrained meeting requests. In Proceedings of the AAAI 2007 workshop on preference handling for artificial intelligence (pp. 7\u201314)."},{"issue":"7\u20138","key":"9293_CR6","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1016\/j.artint.2010.11.016","volume":"175","author":"MD Moffitt","year":"2011","unstructured":"Moffitt, M.D. (2011). On the modelling and optimization of preferences in constraint-based temporal reasoning. Artificial Intelligence, 175(7\u20138), 1390\u20131409.","journal-title":"Artificial Intelligence"},{"key":"9293_CR7","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. (2003). Efficient solution techniques for disjunctive temporal reasoning problems. Artificial Intelligence, 151, 43\u201389.","journal-title":"Artificial Intelligence"},{"key":"9293_CR8","unstructured":"Sheini, H.M., Peintner, B., Sakallah, K.A., Pollack, M.E. (2005). On solving soft temporal constraints using SAT techniques. In P. van Beek (Ed.) Proceedings of the 11th international conference on principles and practice of constraint programming (CP 2005). Volume 3709 of lecture notes in computer science (pp. 607\u2013621). Berlin: Springer."},{"key":"9293_CR9","unstructured":"Moffitt, M.D., & Pollack, M.E. (2005). Partial constraint satisfaction of disjunctive temporal problems. In I. Russell, & Z. Markov (Eds.) Proceedings of the 18th international conference of the Florida artificial intelligence research society (FLAIRS 2005) (pp. 715\u2013720). AAAI Press."},{"key":"9293_CR10","unstructured":"Moffitt, M.D., & Pollack, M.E. (2006). Temporal preference optimization as weighted constraint satisfaction. In Proceedings of the 21st national conference on artificial intelligence (AAAI 2006). AAAI Press."},{"key":"9293_CR11","unstructured":"Peintner, B., & Pollack, M.E. (2004). Low-cost addition of preferences to DTPs and TCSPs. In D.L. McGuinness, & G. Ferguson (Eds.) Proceedings of the 19th national conference on artificial intelligence (AAAI 2004) (pp. 723\u2013728). AAAI Press\/The MIT Press."},{"key":"9293_CR12","unstructured":"Peintner, B., Moffitt, M.D., Pollack, M.E. (2005). Solving over-constrained disjunctive temporal problems with preferences. In S. Biundo, K.L. Myers, K. Rajan (Eds.) Proceedings of the 15th international conference on automated planning and scheduling (ICAPS 2005) (pp. 202\u2013211). AAAI."},{"issue":"2","key":"9293_CR13","doi-asserted-by":"crossref","first-page":"137","DOI":"10.3233\/AIC-2012-0527","volume":"25","author":"M Maratea","year":"2012","unstructured":"Maratea, M., & Pulina, L. (2012). Solving disjunctive temporal problems with preferences using maximum satisfiability. AI Commuications, 25(2), 137\u2013156.","journal-title":"AI Commuications"},{"key":"9293_CR14","unstructured":"Stergiou, K., & Koubarakis, M. (1998). Backtracking algorithms for disjunctions of temporal constraints. In H.E. Shrobe, T.M. Mitchell, R.G. Smith (Eds.) Proceedings of the 15th national conference on artificial intelligence (AAAI 1998) (pp. 248\u2013253). AAAI Press\/The MIT Press."},{"key":"9293_CR15","unstructured":"Armando, A., Castellini, C., Giunchiglia, E. (1999). SAT-based procedures for temporal reasoning. In S. Biundo, & M. Fox (Eds.) Proceedings of the 5th European conference on planning (ICAPS 1999). Volume 1809 of lecture notes in computer science (pp. 97\u2013108). Berlin: Springer."},{"key":"9293_CR16","unstructured":"Cimatti, A., Griggio, A., Schaafsma, B.J., Sebastiani, R. (2013). The MathSAT5 SMT solver. In N. Piterman, & S.A. Smolka (Eds.) Proceedings of the 19th international conference on tools and algorithms for the construction and analysis of systems (TACAS 2013). Volume 7795 of lecture notes in computer science (pp. 93\u2013107). Berlin: Springer."},{"key":"9293_CR17","unstructured":"Sebastiani, R., & Trentin, P. (2015). OptiMathSAT: a tool for optimization modulo theories. In D. Kroening, & C.S. Pasareanu (Eds.) Proceedings of the 27th international conference of computer aided verification (CAV 2015). Volume 9206 of lecture notes in computer science (pp. 447\u2013454). Berlin: Springer."},{"key":"9293_CR18","unstructured":"Dutertre, B., & Moura, L.D. (2006). A fast linear-arithmetic solver for DPLL (T). In T. Ball, & R.B. Jones (Eds.) Proceedings of the 18th international conference on computer aided verification (CAV 2006). Volume 4144 of lecture notes in computer science (pp. 81\u201394). Berlin: Springer."},{"key":"9293_CR19","unstructured":"Dutertre, B., & De Moura, L. (2006). The Yices SMT solver. Tool paper at http:\/\/yices.csl.sri.com\/tool-paper.pdf 2(2)."},{"key":"9293_CR20","volume-title":"Algorithms for constraint-based temporal reasoning with preferences","author":"BM Peintner","year":"2005","unstructured":"Peintner, B.M. (2005). Algorithms for constraint-based temporal reasoning with preferences. Ann Arbor: University of Michigan."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-018-9293-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-018-9293-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-018-9293-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T21:33:57Z","timestamp":1604525637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-018-9293-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,2]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["9293"],"URL":"https:\/\/doi.org\/10.1007\/s10601-018-9293-6","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2018,7,2]]},"assertion":[{"value":"2 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}