{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:24:43Z","timestamp":1725686683076},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642307423"},{"type":"electronic","value":"9783642307430"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30743-0_20","type":"book-chapter","created":{"date-parts":[[2012,6,2]],"date-time":"2012-06-02T03:49:46Z","timestamp":1338608986000},"page":"296-310","source":"Crossref","is-referenced-by-count":4,"title":["Gearing Up for Effective ASP Planning"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gebser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"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\u20131080. MIT Press (1988)"},{"issue":"1-2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0004-3702(02)00186-8","volume":"138","author":"V. Lifschitz","year":"2002","unstructured":"Lifschitz, V.: Answer set programming and plan generation. Artificial Intelligence\u00a0138(1-2), 39\u201354 (2002)","journal-title":"Artificial Intelligence"},{"key":"20_CR3","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185. IOS Press (2009)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM\u00a07, 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM\u00a05, 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"issue":"1-2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P. Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence\u00a0138(1-2), 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"key":"20_CR7","unstructured":"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\u2013392. AAAI Press\/The MIT Press (2007)"},{"key":"20_CR8","unstructured":"Kautz, H., Selman, B.: Planning as satisfiability. In: Neumann, B. (ed.) Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI 1992), pp. 359\u2013363. John Wiley & Sons (1992)"},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1011276507260","volume":"19","author":"E. Clarke","year":"2001","unstructured":"Clarke, E., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Formal Methods in System Design\u00a019(1), 7\u201334 (2001)","journal-title":"Formal Methods in System Design"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013545. ACM Press (2001)","DOI":"10.1145\/378239.379019"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Temporal induction by incremental SAT solving. Electronic Notes in Theoretical Computer Science\u00a089(4) (2003)","DOI":"10.1016\/S1571-0661(05)82542-3"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Subrahmanian, V., Zaniolo, C.: Relating stable models and AI planning domains. In: Proceedings of the Twelfth International Conference on Logic Programming, pp. 233\u2013247. MIT Press (1995)","DOI":"10.7551\/mitpress\/4298.003.0030"},{"key":"20_CR13","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-63912-8_84","volume-title":"Recent Advances in AI Planning","author":"Y. Dimopoulos","year":"1997","unstructured":"Dimopoulos, Y., Nebel, B., K\u00f6hler, J.: Encoding Planning Problems in Nonmonotonic Logic Programs. In: Steel, S., Alami, R. (eds.) ECP 1997. LNCS (LNAI), vol.\u00a01348, pp. 169\u2013181. Springer, Heidelberg (1997)"},{"key":"20_CR14","unstructured":"Lifschitz, V.: Answer set planning. In: de Schreye, D. (ed.) Proceedings of the International Conference on Logic Programming (ICLP 1999), pp. 23\u201337. MIT Press (1999)"},{"key":"20_CR15","unstructured":"Rintanen, J.: Planning and SAT. In: [3], ch.15, pp. 483\u2013504"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaminski, R., Knecht, M., Schaub, T.: plasp: A prototype for PDDL-based planning in ASP. In: [31], pp. 358\u2013363","DOI":"10.1007\/978-3-642-20895-9_41"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-540-89982-2_23","volume-title":"Logic Programming","author":"M. Gebser","year":"2008","unstructured":"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.\u00a05366, pp. 190\u2013205. Springer, Heidelberg (2008)"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511543357"},{"key":"20_CR19","unstructured":"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\u20131201. AAAI Press (1996)"},{"key":"20_CR20","unstructured":"McDermott, D.: PDDL \u2014 the planning domain definition language. Technical Report CVC TR-98-003\/DCS TR-1165, Yale Center for Computational Vision and Control (1998)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Nau, D., Ghallab, M., Traverso, P.: Automated Planning: Theory and Practice. Morgan Kaufmann Publishers (2004)","DOI":"10.1016\/B978-155860856-6\/50020-X"},{"key":"20_CR22","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-30227-8_27","volume-title":"Logics in Artificial Intelligence","author":"J. Rintanen","year":"2004","unstructured":"Rintanen, J., Heljanko, K., Niemel\u00e4, I.: Parallel Encodings of Classical Planning as Satisfiability. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol.\u00a03229, pp. 307\u2013319. Springer, Heidelberg (2004)"},{"key":"20_CR23","unstructured":"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\u2013384. Morgan Kaufmann Publishers (1996)"},{"issue":"1-2","key":"20_CR24","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0004-3702(96)00047-1","volume":"90","author":"A. Blum","year":"1997","unstructured":"Blum, A., Furst, M.: Fast planning through planning graph analysis. Artificial Intelligence\u00a090(1-2), 279\u2013298 (1997)","journal-title":"Artificial Intelligence"},{"key":"20_CR25","unstructured":"Knecht, M.: Efficient domain-independent planning using declarative programming. M.Sc. thesis, Institute for Informatics, University of Potsdam (2009)"},{"key":"20_CR26","doi-asserted-by":"crossref","unstructured":"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\u2013288. AAAI Press (2009)","DOI":"10.1609\/icaps.v19i1.13368"},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-642-15675-5_32","volume-title":"Logics in Artificial Intelligence","author":"M. Gebser","year":"2010","unstructured":"Gebser, M., Grote, T., Schaub, T.: Coala: A Compiler from Action Languages to ASP. In: Janhunen, T., Niemel\u00e4, I. (eds.) JELIA 2010. LNCS, vol.\u00a06341, pp. 360\u2013364. Springer, Heidelberg (2010)"},{"issue":"2","key":"20_CR28","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/AIC-2011-0496","volume":"24","author":"M. Gebser","year":"2011","unstructured":"Gebser, M., Sabuncu, O., Schaub, T.: An incremental answer set programming based system for finite model computation. AI Communications\u00a024(2), 195\u2013212 (2011)","journal-title":"AI Communications"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Gebser, M., Grote, T., Kaminski, R., Schaub, T.: Reactive answer set programming. In: [31], pp. 54\u201366","DOI":"10.1007\/978-3-642-20895-9_7"},{"key":"20_CR30","unstructured":"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)"},{"key":"20_CR31","series-title":"LNAI","volume-title":"Logic Programming and Nonmonotonic Reasoning","year":"2011","unstructured":"Delgrande, J.P., Faber, W. (eds.): LPNMR 2011. LNCS (LNAI), vol.\u00a06645. Springer, Heidelberg (2011)"},{"key":"20_CR32","unstructured":"oclingo, http:\/\/www.cs.uni-potsdam.de\/oclingo"}],"container-title":["Lecture Notes in Computer Science","Correct Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30743-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T22:35:20Z","timestamp":1713998120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30743-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642307423","9783642307430"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30743-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}