Abstract
Disjunctive Temporal Problems with Preferences (DTPPs) extend DTPs with piece-wise constant preference functions associated to each constraint of the form l ≤ x − y ≤ u, where x,y are (real or integer) variables, and l,u are numeric constants. The goal is to find an assignment to the variables of the problem that maximizes the sum of the preference values of satisfied DTP constraints, where such values are obtained by aggregating the preference functions of the satisfied constraints in it under a “max” semantic. The state-of-the-art approach in the field, implemented in the DTPP solver Maxilitis, extends the approach of the DTP solver Epilitis.
In this paper we present an alternative approach that reduces DTPPs to Maximum Satisfiability of a set of Boolean combination of constraints of the form l ⋈ x − y ⋈ u, ⋈ ∈ { < , ≤ }, that extends previous work that dealt with constant preference functions only. Results obtained with the Satisfiability Modulo Theories (SMT) solver Yices on randomly generated DTPPs show that our approach is competitive to, and can be faster than, Maxilitis.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49(1-3), 61–95 (1991)
Moffitt, M.D.: On the modelling and optimization of preferences in constraint-based temporal reasoning. Artificial Intelligence 175(7-8), 1390–1409 (2011)
Tsamardinos, I., Pollack, M.: Efficient solution techniques for disjunctive temporal reasoning problems. Artificial Intelligence 151, 43–89 (2003)
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. 3709, pp. 607–621. Springer, Heidelberg (2005)
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–720. AAAI Press (2005)
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)
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–728. AAAI Press/The MIT Press (2004)
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–211. AAAI (2005)
Maratea, M., Pulina, L.: Solving disjunctive temporal problems with preferences using maximum satisfiability. AI Commununications 25(2), 137–156 (2012)
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–253. AAAI Press/The MIT Press (1998)
Armando, A., Castellini, C., Giunchiglia, E.: SAT-based procedures for temporal reasoning. In: Biundo, S., Fox, M. (eds.) ECP 1999. LNCS (LNAI), vol. 1809, pp. 97–108. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Bourguet, JR., Maratea, M., Pulina, L. (2013). A Reduction-Based Approach for Solving Disjunctive Temporal Problems with Preferences. In: Baldoni, M., Baroglio, C., Boella, G., Micalizio, R. (eds) AI*IA 2013: Advances in Artificial Intelligence. AI*IA 2013. Lecture Notes in Computer Science(), vol 8249. Springer, Cham. https://doi.org/10.1007/978-3-319-03524-6_38
Download citation
DOI: https://doi.org/10.1007/978-3-319-03524-6_38
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03523-9
Online ISBN: 978-3-319-03524-6
eBook Packages: Computer ScienceComputer Science (R0)