{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:52:56Z","timestamp":1762102376496,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030195694"},{"type":"electronic","value":"9783030195700"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19570-0_38","type":"book-chapter","created":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T16:27:54Z","timestamp":1557160074000},"page":"576-592","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Abstraction for Non-ground Answer Set Programs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8690-5043","authenticated-orcid":false,"given":"Zeynep G.","family":"Saribatur","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1837-126X","authenticated-orcid":false,"given":"Peter","family":"Sch\u00fcller","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6003-6345","authenticated-orcid":false,"given":"Thomas","family":"Eiter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,6]]},"reference":[{"key":"38_CR1","unstructured":"ASPCOMP-11: Third (open) answer set programming competition: Disjunctive scheduling (2011). www.mat.unical.it\/aspcomp2011"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Banihashemi, B., De Giacomo, G., Lesp\u00e9rance, Y.: Abstraction in situation calculus action theories. In: Proceedings of AAAI, pp. 1048\u20131055 (2017)","DOI":"10.1609\/aaai.v31i1.10693"},{"key":"38_CR3","unstructured":"Belardinelli, F., Lomuscio, A.: Abstraction-based verification of infinite-state reactive modules. In: Proceedings of ECAI, pp. 725\u2013733 (2016)"},{"key":"38_CR4","unstructured":"Belardinelli, F., Lomuscio, A., Michaliszyn, J.: Agent-based refinement for predicate abstraction of multi-agent systems. In: ECAI, pp. 286\u2013294 (2016)"},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-72200-7_5","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Brain","year":"2007","unstructured":"Brain, M., Gebser, M., P\u00fchrer, J., Schaub, T., Tompits, H., Woltran, S.: Debugging ASP programs by means of ASP. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 31\u201343. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72200-7_5"},{"issue":"3","key":"38_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0743-1066(96)00115-X","volume":"32","author":"S Brass","year":"1997","unstructured":"Brass, S., Dix, J.: Characterizations of the disjunctive stable semantics by partial evaluation. J. Log. Program. 32(3), 207\u2013228 (1997)","journal-title":"J. Log. Program."},{"issue":"12","key":"38_CR7","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. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1145\/186025.186051","volume":"16","author":"EM Clarke","year":"1994","unstructured":"Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM TOPLAS 16, 1512\u20131542 (1994)","journal-title":"ACM TOPLAS"},{"issue":"2","key":"38_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation and application to logic programs. J. Log. Program. 13(2), 103\u2013179 (1992)","journal-title":"J. Log. Program."},{"key":"38_CR10","unstructured":"Edelkamp, S.: Planning with pattern databases. In: Sixth European Conference on Planning (2001)"},{"key":"38_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30227-8_19","volume-title":"Logics in Artificial Intelligence","author":"W Faber","year":"2004","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: semantics and complexity. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 200\u2013212. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30227-8_19"},{"key":"38_CR12","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. 5366, pp. 190\u2013205. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89982-2_23"},{"issue":"2","key":"38_CR13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","volume":"24","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., Schneider, M.: Potassco: the potsdam answer set solving collection. AI Commun. 24(2), 107\u2013124 (2011)","journal-title":"AI Commun."},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"Gei\u00dfer, F., Keller, T., Mattm\u00fcller, R.: Abstractions for planning with state-dependent action costs. In: ICAPS, pp. 140\u2013148 (2016)","DOI":"10.1609\/icaps.v26i1.13742"},{"key":"38_CR15","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP\/SLP, pp. 1070\u20131080 (1988)"},{"issue":"2\u20133","key":"38_CR16","first-page":"323","volume":"57","author":"F Giunchiglia","year":"1992","unstructured":"Giunchiglia, F., Walsh, T.: A theory of abstraction. AIJ 57(2\u20133), 323\u2013389 (1992)","journal-title":"AIJ"},{"issue":"3","key":"38_CR17","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/2559951","volume":"61","author":"M Helmert","year":"2014","unstructured":"Helmert, M., Haslum, P., Hoffmann, J., Nissim, R.: Merge-and-shrink abstraction: a method for generating lower bounds in factored state spaces. JACM 61(3), 16 (2014)","journal-title":"JACM"},{"key":"38_CR18","unstructured":"Hoffmann, J., Sabharwal, A., Domshlak, C.: Friends or Foes? An AI planning perspective on abstraction and search. In: ICAPS, pp. 294\u2013303 (2006)"},{"key":"38_CR19","unstructured":"Illanes, L., McIlraith, S.A.: Numeric planning via search space abstraction. In: Proceedings of KnowProS@IJCAI (2016)"},{"key":"38_CR20","doi-asserted-by":"crossref","unstructured":"Illanes, L., McIlraith, S.A.: Generalized planning via abstraction: arbitrary numbers of objects. In: AAAI (2019)","DOI":"10.1609\/aaai.v33i01.33017610"},{"issue":"1","key":"38_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1119439.1119440","volume":"7","author":"T Janhunen","year":"2006","unstructured":"Janhunen, T., Niemel\u00e4, I., Seipel, D., Simons, P., You, J.H.: Unfolding partiality and disjunctions in stable model semantics. ACM TOCL 7(1), 1\u201337 (2006)","journal-title":"ACM TOCL"},{"issue":"2","key":"38_CR22","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0004-3702(94)90069-8","volume":"68","author":"CA Knoblock","year":"1994","unstructured":"Knoblock, C.A.: Automatically generating abstractions for planning. Artif. Intell. 68(2), 243\u2013302 (1994)","journal-title":"Artif. Intell."},{"key":"38_CR23","doi-asserted-by":"crossref","unstructured":"Kouvaros, P., Lomuscio, A.: A counter abstraction technique for the verification of robot swarms. In: Proceedings of AAAI (2015)","DOI":"10.1609\/aaai.v29i1.9442"},{"key":"38_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-319-61660-5_2","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J Leite","year":"2017","unstructured":"Leite, J.: A bird\u2019s-eye view of forgetting in answer-set programming. In: Balduccini, M., Janhunen, T. (eds.) LPNMR 2017. LNCS (LNAI), vol. 10377, pp. 10\u201322. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61660-5_2"},{"key":"38_CR25","unstructured":"Lomuscio, A., Michaliszyn, J.: Verification of multi-agent systems via predicate abstraction against ATLK specifications. In: Proceedings of AAMAS, pp. 662\u2013670 (2016)"},{"key":"38_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-27775-0_15","volume-title":"Logic Programming","author":"D Pearce","year":"2004","unstructured":"Pearce, D.: Simplifying logic programs under answer set semantics. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 210\u2013224. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27775-0_15"},{"key":"38_CR27","unstructured":"Riddle, P., Douglas, J., Barley, M., Franco, S.: Improving performance by reformulating PDDL into a bagged representation. In: HSDIP@ICAPS, pp. 28\u201336 (2016)"},{"issue":"2","key":"38_CR28","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0004-3702(74)90026-5","volume":"5","author":"ED Sacerdoti","year":"1974","unstructured":"Sacerdoti, E.D.: Planning in a hierarchy of abstraction spaces. Artif. Intell. 5(2), 115\u2013135 (1974)","journal-title":"Artif. Intell."},{"key":"38_CR29","unstructured":"Saribatur, Z.G., Eiter, T.: Omission-based abstraction for answer set programs. In: Proceedings of KR, pp. 42\u201351 (2018)"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19570-0_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T08:40:51Z","timestamp":1694853651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19570-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030195694","9783030195700"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19570-0_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rende","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/jelia2019.mat.unical.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}