Abstract
In this work we present an assessment of state-of-the-art Boolean optimization solvers from different AI communities on over-subscription planning problems. The goal of the empirical analysis here presented is to assess the current respective performance of a wide variety of Boolean optimization solvers for solving such problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
van den Briel, M., Nigenda, R.S., Do, M.B., Kambhampati, S.: Effective approaches for partial satisfaction (over-subscription) planning. In: Proc. of AAAI 2004, pp. 562–569 (2004)
Smith, D.E.: Choosing objectives in over-subscription planning. In: Proc. of ICAPS 2004, pp. 393–401. AAAI, Menlo Park (2004)
Maratea, M.: Planning as satisfiability with IPC simple preferences and action costs. Technical report (2011), http://www.star.dist.unige.it/~marco/Data/TR-planning.pdf
Robinson, N., Gretton, C., Nghia Pham, D., Sattar, A.: Partial weighted maxsat for optimal planning. In: Zhang, B.-T., Orgun, M.A. (eds.) PRICAI 2010. LNCS, vol. 6230, pp. 231–243. Springer, Heidelberg (2010)
Bailleux, O., Boufkhad, Y.: Efficient CNF encoding of boolean cardinality constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 108–122. Springer, Heidelberg (2003)
Kautz, H., Selman, B.: Unifying SAT-based and graph-based planning. In: Dean, T. (ed.) Proc. of IJCAI 1999, pp. 318–325. Morgan Kaufmann, San Francisco (1999)
Pednault, E.: ADL and the state-transition model of action. Journal of Logic and Computation 4, 467–512 (1994)
Gazen, B.C., Knoblock, C.A.: Combining the expressivity of UCPOP with the efficiency of Graphplan. In: Steel, S. (ed.) ECP 1997. LNCS, vol. 1348, pp. 221–233. Springer, Heidelberg (1997)
Gerevini, A., Haslum, P., Long, D., Saetti, A., Dimopoulos, Y.: Deterministic planning in the 5th IPC: PDDL3 and experimental evaluation of the planners. Artificial Intelligence 173(5-6), 619–668 (2009)
Argelich, J., Li, C.M., Manyà , F., Planes, J.: The first and second Max-SAT evaluations. Journal od Satisfiability, Boolean Modeling and Computation 4(2-4), 251–278 (2008)
Manquinho, V.M., Roussel, O.: The first evaluation of pseudo-Boolean solvers (PB’05). Journal on Satisfiability, Boolean Modeling and Computation 2, 103–143 (2006)
Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: Proc. of IJCAI 2007, pp. 386–392 (2007)
Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczynski, M.: The second Answer Set Programming Competition. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 637–654. Springer, Heidelberg (2009)
Franzle, M., Herde, C., Teige, T., Ratschan, S., Schubert, T.: Efficient solving of large non-linear arithmetic constraint systems with complex boolean structure. Journal of Satisfiability, Boolean Modeling and Computation 1, 209–236 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maratea, M., Pulina, L. (2011). Over-Subscription Planning with Boolean Optimization: An Assessment of State-of-the-Art Solutions. In: Pirrone, R., Sorbello, F. (eds) AI*IA 2011: Artificial Intelligence Around Man and Beyond. AI*IA 2011. Lecture Notes in Computer Science(), vol 6934. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23954-0_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-23954-0_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23953-3
Online ISBN: 978-3-642-23954-0
eBook Packages: Computer ScienceComputer Science (R0)