×

Gearing up for effective ASP planning. (English) Zbl 1357.68035

Erdem, Esra (ed.) et al., Correct reasoning. Essays on logic-based AI in honour of Vladimir Lifschitz. Berlin: Springer (ISBN 978-3-642-30742-3/pbk). Lecture Notes in Computer Science 7265, 296-310 (2012).
Summary: We elaborate upon incremental modeling techniques for ASP Planning, a term coined by Vladimir Lifschitz at the end of the nineties. Taking up this line of research, we argue that ASP needs both a dedicated modeling methodology and sophisticated solving technology in view of the high practical relevance of dynamic systems in real-world applications.
For the entire collection see [Zbl 1241.68016].

MSC:

68N17 Logic programming
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Proceedings of the Fifth International Conference and Symposium of Logic Programming (ICLP 1988), pp. 1070–1080. MIT Press (1988)
[2] Lifschitz, V.: Answer set programming and plan generation. Artificial Intelligence 138(1-2), 39–54 (2002) · Zbl 0995.68020
[3] Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (2009) · Zbl 1183.68568
[4] Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7, 201–215 (1960) · Zbl 0212.34203
[5] Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM 5, 394–397 (1962) · Zbl 0217.54002
[6] Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181–234 (2002) · Zbl 0995.68021
[7] Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: Veloso, M. (ed.) Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 386–392. AAAI Press/The MIT Press (2007) · Zbl 1149.68332
[8] Kautz, H., Selman, B.: Planning as satisfiability. In: Neumann, B. (ed.) Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI 1992), pp. 359–363. John Wiley & Sons (1992)
[9] Clarke, E., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Formal Methods in System Design 19(1), 7–34 (2001) · Zbl 0985.68038
[10] Whittemore, J., Kim, J., Sakallah, K.: SATIRE: a new incremental satisfiability engine. In: Proceedings of the Thirty-eighth Conference on Design Automation (DAC 2001), pp. 542–545. ACM Press (2001)
[11] Eén, N., Sörensson, N.: Temporal induction by incremental SAT solving. Electronic Notes in Theoretical Computer Science 89(4) (2003) · Zbl 1271.68215
[12] Subrahmanian, V., Zaniolo, C.: Relating stable models and AI planning domains. In: Proceedings of the Twelfth International Conference on Logic Programming, pp. 233–247. MIT Press (1995)
[13] Dimopoulos, Y., Nebel, B., Köhler, J.: Encoding Planning Problems in Nonmonotonic Logic Programs. In: Steel, S., Alami, R. (eds.) ECP 1997. LNCS (LNAI), vol. 1348, pp. 169–181. Springer, Heidelberg (1997)
[14] Lifschitz, V.: Answer set planning. In: de Schreye, D. (ed.) Proceedings of the International Conference on Logic Programming (ICLP 1999), pp. 23–37. MIT Press (1999)
[15] Rintanen, J.: Planning and SAT. In: [3], ch.15, pp. 483–504
[16] Gebser, M., Kaminski, R., Knecht, M., Schaub, T.: plasp: A prototype for PDDL-based planning in ASP. In: [31], pp. 358–363
[17] Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: Engineering an Incremental ASP Solver. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 190–205. Springer, Heidelberg (2008) · Zbl 1185.68159
[18] Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press (2003) · Zbl 1056.68139
[19] Kautz, H., Selman, B.: Pushing the envelope: Planning, propositional logic, and stochastic search. In: Shrobe, H., Senator, T. (eds.) Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 1194–1201. AAAI Press (1996)
[20] McDermott, D.: PDDL – the planning domain definition language. Technical Report CVC TR-98-003/DCS TR-1165, Yale Center for Computational Vision and Control (1998)
[21] Nau, D., Ghallab, M., Traverso, P.: Automated Planning: Theory and Practice. Morgan Kaufmann Publishers (2004) · Zbl 1074.68613
[22] Rintanen, J., Heljanko, K., Niemelä, I.: Parallel Encodings of Classical Planning as Satisfiability. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 307–319. Springer, Heidelberg (2004) · Zbl 1111.68660
[23] Kautz, H., McAllester, D., Selman, B.: Encoding plans in propositional logic. In: Aiello, L., Doyle, J., Shapiro, S. (eds.) Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR 1996), pp. 374–384. Morgan Kaufmann Publishers (1996)
[24] Blum, A., Furst, M.: Fast planning through planning graph analysis. Artificial Intelligence 90(1-2), 279–298 (1997) · Zbl 1017.68533
[25] Knecht, M.: Efficient domain-independent planning using declarative programming. M.Sc. thesis, Institute for Informatics, University of Potsdam (2009)
[26] Robinson, N., Gretton, C., Pham, D., Sattar, A.: SAT-based parallel planning using a split representation of actions. In: Gerevini, A., Howe, A., Cesta, A., Refanidis, I. (eds.) Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling (ICAPS 2009), pp. 281–288. AAAI Press (2009)
[27] Gebser, M., Grote, T., Schaub, T.: Coala: A Compiler from Action Languages to ASP. In: Janhunen, T., Niemelä, I. (eds.) JELIA 2010. LNCS, vol. 6341, pp. 360–364. Springer, Heidelberg (2010) · Zbl 1306.68014
[28] Gebser, M., Sabuncu, O., Schaub, T.: An incremental answer set programming based system for finite model computation. AI Communications 24(2), 195–212 (2011) · Zbl 1215.68209
[29] Gebser, M., Grote, T., Kaminski, R., Schaub, T.: Reactive answer set programming. In: [31], pp. 54–66 · Zbl 1327.68063
[30] Gebser, M., Grote, T., Kaminski, R., Obermeier, P., Sabuncu, O., Schaub, T.: Stream reasoning with answer set programming: Preliminary report. In: Eiter, T., McIlraith, S. (eds.) Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2012). AAAI Press (to appear, 2012)
[31] Delgrande, J.P., Faber, W. (eds.): LPNMR 2011. LNCS (LNAI), vol. 6645. Springer, Heidelberg (2011) · Zbl 1214.68009
[32] oclingo, http://www.cs.uni-potsdam.de/oclingo
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.