{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T01:31:56Z","timestamp":1785202316701,"version":"3.55.0"},"reference-count":23,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T00:00:00Z","timestamp":1600646400000},"content-version":"unspecified","delay-in-days":20,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2020,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Generalising and re-using knowledge learned while solving one problem instance has been neglected by state-of-the-art answer set solvers. We suggest a new approach that generalises learned nogoods for re-use to speed-up the solving of future problem instances. Our solution combines well-known ASP solving techniques with deductive logic-based machine learning. Solving performance can be improved by adding learned non-ground constraints to the original program. We demonstrate the effects of our method by means of realistic examples, showing that our approach requires low computational cost to learn constraints that yield significant performance benefits in our test cases. These benefits can be seen with ground-and-solve systems as well as lazy-grounding systems. However, ground-and-solve systems suffer from additional grounding overheads, induced by the additional constraints in some cases. By means of conflict minimization, non-minimal learned constraints can be reduced. This can result in significant reductions of grounding and solving efforts, as our experiments show.<\/jats:p>","DOI":"10.1017\/s1471068420000368","type":"journal-article","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T05:25:42Z","timestamp":1600665942000},"page":"799-814","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":4,"title":["Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints"],"prefix":"10.1017","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7639-1616","authenticated-orcid":false,"given":"RICHARD","family":"TAUPE","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2040-6123","authenticated-orcid":false,"given":"ANTONIUS","family":"WEINZIERL","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"GERHARD","family":"FRIEDRICH","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2020,9,21]]},"reference":[{"key":"S1471068420000368_ref18","unstructured":"18. Ryabokon, A. 2015. Knowledge-based (re)configuration of complex products and services. Ph.D. thesis, Alpen-Adria-Universit\u00e4t Klagenfurt."},{"key":"S1471068420000368_ref7","unstructured":"7. Gebser, M. , Kaminski, R. , Kaufmann, B. , and Schaub, T. 2014. Clingo = ASP + control: Preliminary report. CoRR abs\/1405.3694."},{"key":"S1471068420000368_ref11","volume-title":"In IJCAI","author":"Hirsh","year":"1987"},{"key":"S1471068420000368_ref2","unstructured":"2. Bogaerts, B. and Weinzierl, A. 2018. Exploiting justifications for lazy grounding of answer set programs. In IJCAI. ijcai.org, 1737\u20131745."},{"key":"S1471068420000368_ref9","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000061"},{"key":"S1471068420000368_ref17","volume-title":"Artificial Intelligence \u2013 A Modern Approach, Third International Edition","author":"Russell","year":"2010"},{"key":"S1471068420000368_ref16","unstructured":"16. Redl, C. 2016. Automated benchmarking of KR-systems. In RCRA@AI*IA. CEUR Workshop Proceedings, vol. 1745. CEUR-WS.org, 45\u201356."},{"key":"S1471068420000368_ref13","unstructured":"13. Lintao, Zhang , Madigan, C. F. , Moskewicz, M. H. , and Malik, S. 2001. Efficient conflict driven learning in a boolean satisfiability solver. In ICCAD. IEEE, 279\u2013285."},{"key":"S1471068420000368_ref12","unstructured":"12. Leutgeb, L. and Weinzierl, A. 2017. Techniques for efficient lazy-grounding ASP solving. In DECLARE. LNCS, vol. 10997. Springer, 132\u2013148."},{"key":"S1471068420000368_ref5","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.artint.2010.04.002","article-title":"Semantics and complexity of recursive aggregates in answer set programming","volume":"1","author":"Faber","year":"2011","journal-title":"Artif. Intell. 175"},{"key":"S1471068420000368_ref20","unstructured":"20. Silva, J. P. M. , Lynce, I. , and Malik, S. 2009. Conflict-driven clause learning SAT solvers. In Handbook of Satisfiability. IOS Press, 131\u2013153."},{"key":"S1471068420000368_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116250"},{"key":"S1471068420000368_ref1","unstructured":"1. Alviano, M. , Calimeri, F. , Dodaro, C. , Fusc\u00e0, D. , Leone, N. , Perri, S. , Ricca, F. , Veltri, P. , and Zangari, J. 2017. The ASP system DLV2. In LPNMR. LNCS, vol. 10377. Springer, 215\u2013221."},{"key":"S1471068420000368_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(88)90088-4"},{"key":"S1471068420000368_ref23","unstructured":"23. Weinzierl, A. 2017. Blending lazy-grounding and CDNL search for answer-set solving. In LPNMR. LNCS, vol. 10377. Springer, 191\u2013204."},{"key":"S1471068420000368_ref8","unstructured":"8. Gebser, M. , Kaufmann, B. , and Schaub, T. 2012. Conflict-driven answer set solving: From theory to practice. Artif. Intell. 187, 52\u201389."},{"key":"S1471068420000368_ref14","volume-title":"Computer Science","author":"Mitchell","year":"1997"},{"key":"S1471068420000368_ref22","unstructured":"22. Weinzierl, A. 2013. Learning non-ground rules for answer-set solving. In 2nd Workshop on Grounding and Transformations for Theories With Variables. 25\u201337."},{"key":"S1471068420000368_ref4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF00114116","article-title":"Explanation-based learning: An alternative view","volume":"2","author":"DeJong","year":"1986","journal-title":"Mach. Learn. 1"},{"key":"S1471068420000368_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000450"},{"key":"S1471068420000368_ref19","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0743-1066(84)90023-2","article-title":"Negation as failure: A comparison of clark\u2019s completed data base and reiter\u2019s closed world assumption","volume":"1","author":"Shepherdson","year":"1984","journal-title":"J. Log. Program. 1"},{"key":"S1471068420000368_ref21","unstructured":"21. Taupe, R. , Weinzierl, A. , and Friedrich, G. 2019. Degrees of laziness in grounding \u2013 effects of lazy-grounding strategies on ASP solving. In LPNMR. LNCS, vol. 11481. Springer, 298\u2013311."},{"key":"S1471068420000368_ref6","unstructured":"6. Friedrich, G. , Ryabokon, A. , Falkner, A. A. , Haselb\u00f6ck, A. , Schenner, G. , and Schreiner, H. 2011. (Re)configuration using answer set programming. In Configuration Workshop. CEUR-WS.org."}],"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\/S1471068420000368","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T08:51:29Z","timestamp":1610614289000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068420000368\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["S1471068420000368"],"URL":"https:\/\/doi.org\/10.1017\/s1471068420000368","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9]]},"assertion":[{"value":"\u00a9 The Author(s), 2020. 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-NonCommercial-NoDerivatives licence (http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the original work is unaltered and is properly cited. The written permission of Cambridge University Press must be obtained for commercial re-use or in order to create a derivative work.","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"}]}}