{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T13:39:29Z","timestamp":1786541969921,"version":"build-2736575974"},"reference-count":37,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T00:00:00Z","timestamp":1757980800000},"content-version":"unspecified","delay-in-days":77,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The grounding bottleneck poses one of the key challenges that hinders the widespread adoption of answer set programming in industry. Hybrid grounding is a step in alleviating the bottleneck by combining the strength of standard bottom-up grounding with recently proposed techniques where rule bodies are decoupled during grounding. However, it has remained unclear when hybrid grounding shall use body-decoupled grounding (BDG) and when to use standard bottom-up grounding. In this paper, we address this issue by developing automated hybrid grounding: we introduce a splitting algorithm based on data-structural heuristics that detects when to use BDG and when standard grounding is beneficial. We base our heuristics on the structure of rules and an estimation procedure that incorporates the data of the instance. The experiments conducted on our prototypical implementation demonstrate promising results, which show an improvement on hard-to-ground scenarios, whereas on hard-to-solve instances, we approach state-of-the-art performance.<\/jats:p>","DOI":"10.1017\/s1471068425100173","type":"journal-article","created":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T07:50:41Z","timestamp":1758009041000},"page":"489-506","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":1,"title":["Automated Hybrid Grounding Using Structural and Data-Driven Heuristics"],"prefix":"10.1017","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-4252-1043","authenticated-orcid":false,"given":"ALEXANDER","family":"BEISER","sequence":"first","affiliation":[{"name":"TU Wien"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1594-8972","authenticated-orcid":false,"given":"STEFAN","family":"WOLTRAN","sequence":"additional","affiliation":[{"name":"TU Wien"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0131-6771","authenticated-orcid":false,"given":"MARKUS","family":"HECHER","sequence":"additional","affiliation":[{"name":"CNRS, Computer Science Research Center of Lens (CRIL), Univ. Artois"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2025,9,16]]},"reference":[{"key":"S1471068425100173_ref9","doi-asserted-by":"crossref","unstructured":"Calimeri, F. , Fusc\u00e0, D. , Perri, S. And Zangari, J. 2018. Optimizing answer set computation via heuristic-based decomposition. In PADL18, Vol. 10702, LNCS, IOS Press, 135\u2013151.","DOI":"10.1007\/978-3-319-73305-0_9"},{"key":"S1471068425100173_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s13218-018-0548-6"},{"key":"S1471068425100173_ref28","first-page":"435","article-title":"DualGrounder: Lazy instantiation via clingo multi-shot framework","volume":"12678","author":"Lierler","year":"2021","journal-title":"JELIA21"},{"key":"S1471068425100173_ref29","unstructured":"Lin, F. and Zhao, J. 2003. On tight logic programs and yet another translation from normal logic programs to propositional logic. In IJCAI03, Springer, 853\u2013858."},{"key":"S1471068425100173_ref5","first-page":"114","article-title":"popt: A Rule Optimization tool for answer set programming","volume":"10184","author":"Bichler","year":"2016","journal-title":"LOPSTR16"},{"key":"S1471068425100173_ref12","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502810"},{"key":"S1471068425100173_ref30","unstructured":"Liu, G. , Janhunen, T. and Niemela, I. 2012. Answer set programming via mixed integer programming. In KR12, Association for Computing Machinery, 32\u201342."},{"key":"S1471068425100173_ref32","first-page":"5834","article-title":"Compilation of aggregates in ASP systems","volume":"36","author":"Mazzotta","year":"2022","journal-title":"AAAI22"},{"key":"S1471068425100173_ref4","doi-asserted-by":"crossref","unstructured":"Besin, V. , Hecher, M. and Woltran, S. 2022. Body-decoupled grounding via solving: A novel approach on the ASP bottleneck. In IJCAI22, International Joint Conferences on Artificial Intelligence Organization,\u00a02546\u20132552.","DOI":"10.24963\/ijcai.2022\/353"},{"key":"S1471068425100173_ref19","unstructured":"Gebser, M. , Kaminski, R. and Schaub, T. 2016. Grounding Recursive Aggregates: Preliminary Report. CoRR. http:\/\/arxiv.org\/abs\/1603.03884."},{"key":"S1471068425100173_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.09.008"},{"key":"S1471068425100173_ref24","first-page":"133","article-title":"Un th\u00e9or\u00e8me sur les fonctions d\u2019ensembles","volume":"6","author":"Knaster","year":"1928","journal-title":"Annales de la Soci\u00e9t\u00e9 Polonaise de Math\u00e9matique"},{"key":"S1471068425100173_ref33","first-page":"247","article-title":"Preprocessing of complex non-ground rules in answer set programming","volume":"17","author":"Morak","year":"2012","journal-title":"ICLP12"},{"key":"S1471068425100173_ref3","doi-asserted-by":"crossref","unstructured":"Beiser, A. G. , Hecher, M. , Unalan, K. and Woltran, S. 2024. Bypassing the ASP bottleneck: hybrid grounding by splitting and rewriting. In IJCAI24,\u00a0International Joint Conferences on Artificial Intelligence Organization,\u00a03250\u20133258.","DOI":"10.24963\/ijcai.2024\/360"},{"key":"S1471068425100173_ref37","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068420000332"},{"key":"S1471068425100173_ref27","first-page":"132","article-title":"Techniques for efficient lazy-grounding ASP solving","volume":"10997","author":"Leutgeb","year":"2018","journal-title":"DECLARE18"},{"key":"S1471068425100173_ref36","first-page":"191","article-title":"Blending lazy-grounding and CDNL search for answer-set solving","volume":"10377","author":"Weinzierl","year":"2017","journal-title":"LPNMR17"},{"key":"S1471068425100173_ref16","volume-title":"Database Systems: The Complete Book","author":"Garcia-molina","year":"2008"},{"key":"S1471068425100173_ref20","doi-asserted-by":"crossref","unstructured":"Gebser, M. , Leone, N. , Maratea, M. , Perri, S. , Ricca, F. and Schaub, T. 2018. Evaluation techniques and systems for answer set programming: a survey. In IJCAI18, International Joint Conferences on Artificial Intelligence, 5450\u20135456.","DOI":"10.24963\/ijcai.2018\/769"},{"key":"S1471068425100173_ref25","doi-asserted-by":"crossref","unstructured":"Leone, N. , Perri, S. and Scarcello, F. 2001. Improving ASP instantiators by join-ordering methods. In LPNMR01, Vol. 2173, LNCS, Cambridge University Press, 280\u2013294.","DOI":"10.1007\/3-540-45402-0_21"},{"key":"S1471068425100173_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000102"},{"key":"S1471068425100173_ref18","unstructured":"Gebser, M. , Kaminski, R. , Kaufmann, B. , Ostrowski, M. , Schaub, T. and Wanko, P. 2016. Theory solving made easy with clingo 5. In ICLP16-TC, Vol. 52, OASIcs, Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (Dagstuhl Publishing), 1\u201315."},{"key":"S1471068425100173_ref31","doi-asserted-by":"crossref","unstructured":"Mastria, E. , Zangari, J. , Perri, S. and Calimeri, F. 2020. A machine learning guided rewriting approach for ASP logic programs. In ICLP20 - TC. EPTCS, Vol. 325, Springer, 261\u2013267.","DOI":"10.4204\/EPTCS.325.31"},{"key":"S1471068425100173_ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000450"},{"key":"S1471068425100173_ref22","doi-asserted-by":"publisher","DOI":"10.3166\/jancl.16.35-86"},{"key":"S1471068425100173_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068425100173_ref23","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068422000308"},{"key":"S1471068425100173_ref17","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068415000150"},{"key":"S1471068425100173_ref13","first-page":"557","article-title":"Compilation of tight ASP programs","volume":"372","author":"Dodaro","year":"2023","journal-title":"ECAI23"},{"key":"S1471068425100173_ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"S1471068425100173_ref8","doi-asserted-by":"publisher","DOI":"10.3233\/IA-170104"},{"key":"S1471068425100173_ref34","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1955.5.285"},{"key":"S1471068425100173_ref35","first-page":"10284","article-title":"Beyond the grounding bottleneck: Datalog techniques for inference in probabilistic logic programs","volume":"34","author":"Tsamoura","year":"2020","journal-title":"AAAI20"},{"key":"S1471068425100173_ref14","doi-asserted-by":"crossref","unstructured":"Dodaro, C. , Mazzotta, G. and Ricca, F. 2024. Blending grounding and compilation for efficient ASP solving. In KR24, International Joint Conferences on Artificial Intelligence, 317\u2013328.","DOI":"10.24963\/kr.2024\/30"},{"key":"S1471068425100173_ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000546"},{"key":"S1471068425100173_ref11","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000231"},{"key":"S1471068425100173_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000138"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068425100173","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T12:56:29Z","timestamp":1761310589000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068425100173\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["S1471068425100173"],"URL":"https:\/\/doi.org\/10.1017\/s1471068425100173","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7]]},"assertion":[{"value":"\u00a9 The Author(s), 2025. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}