{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:54:06Z","timestamp":1762102446963,"version":"3.40.5"},"reference-count":41,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:00:00Z","timestamp":1568937600000},"content-version":"unspecified","delay-in-days":19,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2019,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Abstract solvers are a method to formally analyze algorithms that have been profitably used for describing, comparing and composing solving techniques in various fields such as Propositional Satisfiability (SAT), Quantified SAT, Satisfiability Modulo Theories, Answer Set Programming (ASP), and Constraint ASP.<\/jats:p><jats:p>In this paper, we design, implement and test novel abstract solutions for cautious reasoning tasks in ASP. We show how to improve the current abstract solvers for cautious reasoning in ASP with new techniques borrowed from backbone computation in SAT, in order to design new solving algorithms. By doing so, we also formally show that the algorithms for solving cautious reasoning tasks in ASP are strongly related to those for computing backbones of Boolean formulas. We implement some of the new solutions in the ASP solver wasp and show that their performance are comparable to state-of-the-art solutions on the benchmark problems from the past ASP Competitions.<\/jats:p>","DOI":"10.1017\/s1471068419000164","type":"journal-article","created":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T13:06:21Z","timestamp":1568984781000},"page":"740-756","source":"Crossref","is-referenced-by-count":1,"title":["Abstract Solvers for Computing Cautious Consequences of ASP programs"],"prefix":"10.1017","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2111-9671","authenticated-orcid":false,"given":"GIOVANNI","family":"AMENDOLA","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5617-5286","authenticated-orcid":false,"given":"CARMINE","family":"DODARO","sequence":"additional","affiliation":[]},{"given":"MARCO","family":"MARATEA","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2019,9,20]]},"reference":[{"key":"S1471068419000164_ref27","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/1149114.1149117","article-title":"The DLV system for knowledge representation and reasoning","volume":"3","author":"Leone","year":"2006","journal-title":"ACM Transactions on Computational Logic 7"},{"key":"S1471068419000164_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45193-8_64"},{"key":"S1471068419000164_ref17","doi-asserted-by":"publisher","DOI":"10.1145\/261124.261126"},{"key":"S1471068419000164_ref41","doi-asserted-by":"crossref","first-page":"141","DOI":"10.3233\/SAT190034","article-title":"Lazy satisability modulo theories","volume":"3","author":"Sebastiani","year":"2007","journal-title":"Journal fo Satisfiability, Boolean Modeling and Computation 3"},{"key":"S1471068419000164_ref40","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1145\/1217856.1217859","article-title":"Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T)","volume":"53","author":"Nieuwenhuis","year":"2006","journal-title":"Journal of the ACM"},{"key":"S1471068419000164_ref36","unstructured":"Lynce, I. and Silva, J. P. M. 2004. On computing minimum unsatisfiable cores. In Proc. of the 7th International Conference on Theory and Applications of Satisfiability Testing (SAT 2004)."},{"key":"S1471068419000164_ref35","unstructured":"Lierler, Y. and Truszczynski, M. 2016. On abstract modular inference systems and solvers. Artificial Intelligence 236, 65\u201389."},{"key":"S1471068419000164_ref29","unstructured":"Lierler, Y. 2011. Abstract answer set solvers with backjumping and learning. Theory and Practice of Logic Programming 11, 135\u2013169."},{"key":"S1471068419000164_ref26","doi-asserted-by":"crossref","first-page":"161","DOI":"10.3233\/AIC-140640","article-title":"Algorithms for computing backbones of propositional formulae","volume":"2","author":"Janota","year":"2015","journal-title":"AI Communications 28"},{"key":"S1471068419000164_ref19","unstructured":"Gebser, M. , Kaufmann, B. , and Schaub, T. 2012. Conflict-driven answer set solving: From theory to practice. Artificial Intelligence 187, 52\u201389."},{"key":"S1471068419000164_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.04.002"},{"key":"S1471068419000164_ref15","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s10601-010-9095-y","article-title":"Solving satisfiability problems with preferences","volume":"4","author":"Di Rosa","year":"2010","journal-title":"Constraints 15"},{"key":"S1471068419000164_ref14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1017\/S1471068412000105","article-title":"The third open answer set programming competition","volume":"1","author":"Calimeri","year":"2014","journal-title":"Theory and Practice of Logic Programming 14"},{"key":"S1471068419000164_ref12","first-page":"205","volume-title":"Proc. of AI*IA 2015: Advances in Artificial Intelligence - XIVth International Conference of the Italian Association for Artificial Intelligence","volume":"9336","author":"Brochenin","year":"2015"},{"key":"S1471068419000164_ref11","volume-title":"Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015)","volume":"1433","author":"Brochenin","year":"2015"},{"key":"S1471068419000164_ref7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"Baral","year":"2003"},{"key":"S1471068419000164_ref4","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/978-3-319-23264-5_5","volume-title":"Proceedings of the 13th International Conference of Logic Programming and Nonmonotonic Reasoning (LPNMR 2015)","volume":"9345","author":"Alviano","year":"2015"},{"key":"S1471068419000164_ref21","first-page":"1070","volume-title":"Proceedings of the 5th International Conference and Symposium on Logic Programming (ICLP\/SLP 1988)","author":"Gelfond","year":"1988"},{"key":"S1471068419000164_ref8","first-page":"385","volume-title":"Proceedings of National conference on Artificial Intelligence (AAAI 2007)","author":"Brewka","year":"2007"},{"key":"S1471068419000164_ref2","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1017\/S147106841600020X","article-title":"Anytime answer set optimization via unsatisfiable core shrinking","volume":"5","author":"Alviano","year":"2016","journal-title":"Theory and Practice of Logic Programming 16"},{"key":"S1471068419000164_ref20","unstructured":"Gebser, M. , Maratea, M. , and Ricca, F. 2017. The sixth answer set programming competition. Journal of Artificial Intelligence Research 60, 41\u201395."},{"key":"S1471068419000164_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/11546207_2"},{"key":"S1471068419000164_ref37","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1017\/S1471068411000640","article-title":"Consistent query answering via ASP from different perspectives: Theory and practice","volume":"2","author":"Manna","year":"2013","journal-title":"Theory and Practica of Logic Programming 13"},{"key":"S1471068419000164_ref22","unstructured":"Gelfond, M. and Lifschitz, V. 1991. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, 365\u2013385."},{"key":"S1471068419000164_ref31","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1017\/S1471068411000214","article-title":"Transition systems for model generators \u2014 a unifying approach","volume":"4","author":"Lierler","year":"2011","journal-title":"Theory and Practice of Logic Programming 11"},{"key":"S1471068419000164_ref34","first-page":"1532","volume-title":"Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015)","author":"Lierler","year":"2015"},{"volume-title":"Late-Breaking Developments in the Field of Artificial Intelligence","year":"2013","author":"Lierler","key":"S1471068419000164_ref32"},{"key":"S1471068419000164_ref24","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/3-540-45757-7_25","volume-title":"Proc. of the European Conference on Logics in Artificial Intelligence (JELIA 2002)","volume":"2424","author":"Giunchiglia","year":"2002"},{"key":"S1471068419000164_ref33","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-3-319-04132-2_4","volume-title":"Proceedings of the 16th International Symposium on Practical Aspects of Declarative Languages (PADL 2014)","volume":"8324","author":"Lierler","year":"2014"},{"key":"S1471068419000164_ref28","first-page":"377","volume-title":"Proceedings of the 24th International Conference on Logic Programming (ICLP 2008)","volume":"5366","author":"Lierler","year":"2008"},{"key":"S1471068419000164_ref10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.3233\/AAC-170031","article-title":"Abstract solvers for Dung\u2019s argumentation frameworks","volume":"1","author":"Brochenin","year":"2018","journal-title":"Argument and Computation 9"},{"key":"S1471068419000164_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000145"},{"key":"S1471068419000164_ref38","doi-asserted-by":"crossref","unstructured":"Marek, V. W. and Truszczy\u0144ski, M. 1998. Stable models and an alternative logic programming paradigm. CoRR cs.LO\/9809032.","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"S1471068419000164_ref23","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s10472-009-9113-1","article-title":"On the relation among answer set solvers","volume":"1","author":"Giunchiglia","year":"2008","journal-title":"Annals of Mathematics and Artificial Intelligence 53"},{"key":"S1471068419000164_ref39","unstructured":"Niemel\u00e4, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 241\u2013273."},{"key":"S1471068419000164_ref30","unstructured":"Lierler, Y. 2014. Relating constraint answer set programming languages and algorithms. Artificial Intelligence 207, 1\u201322."},{"key":"S1471068419000164_ref13","unstructured":"Calimeri, F. , Gebser, M. , Maratea, M. , and Ricca, F. 2016. Design and results of the Fifth Answer Set Programming Competition. Artificial Intelligence 231, 151\u2013181."},{"key":"S1471068419000164_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-20528-7_18"},{"key":"S1471068419000164_ref9","first-page":"165","volume-title":"Proceedings of the 21st European Conference on Artificial Intelligence (ECAI 2014)","volume":"263","author":"Brochenin","year":"2014"},{"key":"S1471068419000164_ref5","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1017\/S1471068414000325","article-title":"Anytime computation of cautious consequences in answer set programming","volume":"4","author":"Alviano","year":"2014","journal-title":"Theory and Practice of Logic Programming 14"},{"key":"S1471068419000164_ref6","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1017\/S1471068403001832","article-title":"Answer sets for consistent query answering in inconsistent databases","volume":"4","author":"Arenas","year":"2003","journal-title":"Theory and Practice of Logic Programming 3"}],"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\/S1471068419000164","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T18:07:20Z","timestamp":1611252440000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068419000164\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":41,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["S1471068419000164"],"URL":"https:\/\/doi.org\/10.1017\/s1471068419000164","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2019,9]]}}}