{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T20:55:58Z","timestamp":1772830558148,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319147253","type":"print"},{"value":"9783319147260","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-14726-0_2","type":"book-chapter","created":{"date-parts":[[2015,1,6]],"date-time":"2015-01-06T22:37:32Z","timestamp":1420583852000},"page":"17-32","source":"Crossref","is-referenced-by-count":14,"title":["Ricochet Robots Reloaded: A Case-Study in Multi-shot ASP Solving"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gebser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Kaminski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Obermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Bobrow, D. (ed.): Special issue on nonmonotonic logic, vol.\u00a013. Artificial Intelligence (1980)","DOI":"10.1016\/0004-3702(80)90009-0"},{"key":"2_CR2","unstructured":"Brewka, G.: Nonmonotonic Reasoning: From Theoretical Foundation to Efficient Computation. Dissertation, Universit\u00e4t Hamburg (1989), revised version appeared as: Cambridge Tracts in Theoretical Computer Science. Cambridge University Press (1990)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511543357"},{"issue":"12","key":"2_CR4","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G. Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczy\u0144ski, M.: Answer set programming at a glance. Communications of the ACM\u00a054(12), 92\u2013103 (2011)","journal-title":"Communications of the ACM"},{"key":"2_CR5","unstructured":"Butko, N., Lehmann, K., Ramenzoni, V.: Ricochet Robots \u2014 a case study for human complex problem solving. In: Proceedings of the Annual Santa Fe Institute Summer School on Complex Systems (CSSS 2005) (2005)"},{"key":"2_CR6","unstructured":"Engels, B., Kamphans, T.: On the complexity of Randolph\u2019s robot game. Research Report 005, Institut f\u00fcr Informatik, Universit\u00e4t Bonn (2005)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.endm.2006.06.062","volume":"25","author":"B. Engels","year":"2006","unstructured":"Engels, B., Kamphans, T.: Randolph\u2019s robot game is NP-hard? Electronic Notes in Discrete Mathematics\u00a025, 49\u201353 (2006)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"2_CR8","unstructured":"Engels, B., Kamphans, T.: Randolph\u2019s robot game is NP-complete? In: Proceedings of the Twenty-second European Workshop on Computational Geometry (EWCG 2006), pp. 157\u2013160 (2006)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-40564-8_35","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2013","unstructured":"Gebser, M., Jost, H., Kaminski, R., Obermeier, P., Sabuncu, O., Schaub, T., Schneider, M.: Ricochet robots: A transverse ASP benchmark. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol.\u00a08148, pp. 348\u2013360. Springer, Heidelberg (2013)"},{"key":"2_CR10","unstructured":"http:\/\/potassco.sourceforge.net\/apps.html"},{"key":"2_CR11","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo = ASP + control: Preliminary report. In: Leuschel, M., Schrijvers, T. (eds.) Technical Communications of the Thirtieth International Conference on Logic Programming (ICLP 2014). Theory and Practice of Logic Programming, Online Supplement (2014) see also arXiv:1405.3694v1"},{"key":"2_CR12","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo = ASP + control: Extended report (2014), \n                    \n                      http:\/\/www.cs.uni-potsdam.de\/wv\/pdfformat\/gekakasc14a.pdf"},{"key":"2_CR13","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":"2_CR14","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":"2_CR15","unstructured":"Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) Proceedings of the Seventeenth European Conference on Artificial Intelligence (ECAI 2006), pp. 412\u2013416. IOS Press (2006)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-20895-9_39","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., K\u00f6nig, A., Schaub, T.: Advances in gringo series 3. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol.\u00a06645, pp. 345\u2013351. Springer, Heidelberg (2011)"},{"key":"2_CR17","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: A user\u2019s guide to gringo, clasp, clingo, and iclingo. (2010) \n                    \n                      http:\/\/sourceforge.net\/projects\/potassco\/files\/potassco_guide\/2010-10-04\/guide.pdf"},{"key":"2_CR18","unstructured":"Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., Leone, N., Ricca, F., Schaub, T.: ASP-Core-2: Input language format (2012), \n                    \n                      https:\/\/www.mat.unical.it\/aspcomp2013\/files\/ASP-CORE-2.03b.pdf"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14726-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:15:29Z","timestamp":1559085329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14726-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319147253","9783319147260"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14726-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}