{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:00:47Z","timestamp":1747173647403,"version":"3.40.5"},"reference-count":51,"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>Answer Set Programming (ASP) is a well-established formalism for logic programming. Problem solving in ASP requires to write an ASP program whose answers sets correspond to solutions. Albeit the non-existence of answer sets for some ASP programs can be considered as a modeling feature, it turns out to be a weakness in many other cases, and especially for query answering. Paracoherent answer set semantics extend the classical semantics of ASP to draw meaningful conclusions also from incoherent programs, with the result of increasing the range of applications of ASP. State of the art implementations of paracoherent ASP adopt the semi-equilibrium semantics, but cannot be lifted straightforwardly to compute efficiently the (better) split semi-equilibrium semantics that discards undesirable semi-equilibrium models. In this paper an efficient evaluation technique for computing a split semi-equilibrium model is presented. An experiment on hard benchmarks shows that better paracoherent answer sets can be computed consuming less computational resources than existing methods.<\/jats:p>","DOI":"10.1017\/s1471068419000176","type":"journal-article","created":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T13:06:21Z","timestamp":1568984781000},"page":"757-772","source":"Crossref","is-referenced-by-count":1,"title":["Better Paracoherent Answer Sets with Less Resources"],"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":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8218-3178","authenticated-orcid":false,"given":"FRANCESCO","family":"RICCA","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2019,9,20]]},"reference":[{"doi-asserted-by":"publisher","key":"S1471068419000176_ref44","DOI":"10.1007\/s10472-006-9028-z"},{"doi-asserted-by":"crossref","unstructured":"Niemel\u00e4, I. 1996. A tableau calculus for minimal model reasoning. In Proceedings of the International Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX). 278\u2013294.","key":"S1471068419000176_ref43","DOI":"10.1007\/3-540-61208-4_18"},{"key":"S1471068419000176_ref30","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/978-3-319-23264-5_31","volume-title":"Proceedings of the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)","volume":"9345","author":"Gebser","year":"2015"},{"doi-asserted-by":"publisher","key":"S1471068419000176_ref28","DOI":"10.1017\/S1471068415000149"},{"key":"S1471068419000176_ref27","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1609\/aimag.v37i3.2678","article-title":"Applications of answer set programming","volume":"3","author":"Erdem","year":"2016","journal-title":"AI Magazine 37"},{"key":"S1471068419000176_ref20","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1017\/S1471068416000478","article-title":"Query answering in resource-based answer set semantics","volume":"5","author":"Costantini","year":"2016","journal-title":"Theory and Practice of Logic Programming 16"},{"doi-asserted-by":"publisher","key":"S1471068419000176_ref16","DOI":"10.1023\/A:1006291616338"},{"key":"S1471068419000176_ref13","first-page":"439","volume-title":"Proceedings of the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)","volume":"2173","author":"Balduccini","year":"2001"},{"doi-asserted-by":"publisher","key":"S1471068419000176_ref4","DOI":"10.1007\/978-3-319-61660-5_19"},{"doi-asserted-by":"publisher","key":"S1471068419000176_ref3","DOI":"10.1007\/978-3-030-20528-7_18"},{"doi-asserted-by":"publisher","key":"S1471068419000176_ref1","DOI":"10.1016\/j.jal.2004.07.012"},{"volume-title":"Algorithm design","year":"2006","author":"Kleinberg","key":"S1471068419000176_ref37"},{"key":"S1471068419000176_ref48","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/BFb0054790","volume-title":"Proceedings of the International Workshop on Logic Programming and Knowledge Representation (LPKR)","volume":"1471","author":"Seipel","year":"1997"},{"key":"S1471068419000176_ref31","doi-asserted-by":"crossref","DOI":"10.2200\/S00457ED1V01Y201211AIM019","volume-title":"Answer Set Solving in Practice","author":"Gebser","year":"2012"},{"unstructured":"Gebser, M. , Maratea, M. , and Ricca, F. 2017. The sixth answer set programming competition. Journal of Artificial Intelligence Research 60, 41\u201395.","key":"S1471068419000176_ref34"},{"key":"S1471068419000176_ref22","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1017\/S1471068416000284","article-title":"Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)","volume":"5","author":"Dodaro","year":"2016","journal-title":"Theory and Practice of Logic Programming 16"},{"doi-asserted-by":"crossref","unstructured":"Alviano, M. , Dodaro, C. , Leone, N. , and Ricca, F. 2015. Advances in WASP. In Proceedings of the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). Lecture Notes in Computer Science. 40\u201354.","key":"S1471068419000176_ref6","DOI":"10.1007\/978-3-319-23264-5_5"},{"doi-asserted-by":"publisher","key":"S1471068419000176_ref19","DOI":"10.1080\/0952813X.2014.993503"},{"unstructured":"Janota, M. and Marques-Silva, J. 2016. On the query complexity of selecting minimal sets for monotone predicates. Artificial Intelligence 233, 73\u201383.","key":"S1471068419000176_ref36"},{"key":"S1471068419000176_ref40","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1609\/aimag.v37i3.2675","article-title":"Systems, engineering environments, and competitions","volume":"3","author":"Lierler","year":"2016","journal-title":"AI Magazine 37"},{"key":"S1471068419000176_ref2","first-page":"1669","volume-title":"Proceedings of the International Conference on Artificial Intelligence (IJCAI)","author":"Alviano","year":"2018"},{"key":"S1471068419000176_ref38","first-page":"49","volume-title":"Proceedings of the International Workshop on First-Order Theorem Proving (FTP)","volume":"556","author":"Koshimura","year":"2009"},{"unstructured":"Angiulli, F. , Ben-Eliyahu, R. , Fassetti, F. , and Palopoli, L. 2014. On the tractability of minimal model computation for some CNF theories. Artificial Intelligence 210, 56\u201377.","key":"S1471068419000176_ref10"},{"key":"S1471068419000176_ref39","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":"S1471068419000176_ref33","first-page":"4327","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence (AAAI)","author":"Gebser","year":"2016"},{"key":"S1471068419000176_ref25","first-page":"40","volume-title":"Proceedings of the Reasoning Web International Summer School","volume":"5689","author":"Eiter","year":"2009"},{"key":"S1471068419000176_ref46","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF03037171","article-title":"Stable semantics for disjunctive programs","volume":"3\/4","author":"Przymusinski","year":"1991","journal-title":"New Generation Computing 9"},{"key":"S1471068419000176_ref26","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1018947420290","article-title":"On the partial semantics for disjunctive deductive databases","volume":"1","author":"Eiter","year":"1997","journal-title":"Annals of Mathematics and Artificial Intelligence 19"},{"unstructured":"Eiter, T. , Fink, M. , and Moura, J. 2010. Paracoherent answer set programming. In Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR).","key":"S1471068419000176_ref24"},{"key":"S1471068419000176_ref42","first-page":"23","volume-title":"Proceedings of the International Conference on Logic Programming (ICLP)","author":"Lifschitz","year":"1994"},{"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":"S1471068419000176_ref18"},{"key":"S1471068419000176_ref23","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-319-22002-4_7","volume-title":"Proceedings of the International Conference on Web Reasoning and Rule Systems (RR)","volume":"9209","author":"Dodaro","year":"2015"},{"key":"S1471068419000176_ref8","first-page":"1720","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence (AAAI)","author":"Amendola","year":"2018"},{"key":"S1471068419000176_ref5","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":"S1471068419000176_ref21","first-page":"289","volume-title":"Proceedings of the Italian Conference on Computational Logic (CILC). CEUR Workshop Proceedings","volume":"2396","author":"Cuteri","year":"2019"},{"key":"S1471068419000176_ref11","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"},{"key":"S1471068419000176_ref32","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1017\/S1471068418000054","article-title":"Multi-shot ASP solving with clingo","volume":"1","author":"Gebser","year":"2019","journal-title":"Theory and Practice of Logic Programming 19"},{"unstructured":"van Harmelen, F. , Lifschitz, V. , and Porter, B. W. , Eds. 2008. Handbook of Knowledge Representation. Foundations of Artificial Intelligence, vol. 3. Elsevier.","key":"S1471068419000176_ref50"},{"doi-asserted-by":"crossref","unstructured":"Amendola, G. , Dodaro, C. , Faber, W. , Leone, N. , and Ricca, F. 2017. On the computation of paracoherent answer sets. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI). 1034\u20131040.","key":"S1471068419000176_ref7","DOI":"10.1609\/aaai.v31i1.10679"},{"key":"S1471068419000176_ref17","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1109\/69.877512","article-title":"Enhancing disjunctive datalog by constraints","volume":"5","author":"Buccafurri","year":"2000","journal-title":"IEEE Transactions on Knowledge and Data Engineering 12"},{"key":"S1471068419000176_ref51","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/S0022-0000(05)80053-4","article-title":"A three-valued semantics for deductive databases and logic programs","volume":"2","author":"You","year":"1994","journal-title":"Journal of Computer and System Sciences 49"},{"key":"S1471068419000176_ref15","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/2043174.2043195","article-title":"Answer set programming at a glance","volume":"12","author":"Brewka","year":"2011","journal-title":"Communications of the ACM 54"},{"key":"S1471068419000176_ref47","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1093\/logcom\/5.3.265","article-title":"Paraconsistent stable semantics for extended disjunctive programs","volume":"3","author":"Sakama","year":"1995","journal-title":"Journal of Logic and Computation 5"},{"unstructured":"Pereira, L. M. and Pinto, A. M. 2007. Approved models for normal logic programs. In Proceedings of the International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR). Lecture Notes in Computer Science, vol. 4790. 454\u2013468.","key":"S1471068419000176_ref45"},{"key":"S1471068419000176_ref49","first-page":"620","article-title":"The well-founded semantics for general logic programs","volume":"3","author":"van Gelder","year":"1991","journal-title":"Journal of the ACM 38"},{"unstructured":"Balduccini, M. and Gelfond, M. 2003. Logic programs with consistency-restoring rules. In Proceedings of the International Symposium on Logical Formalization of Commonsense Reasoning, AAAI Spring Symposium Series. Vol. 102. 9\u201318.","key":"S1471068419000176_ref12"},{"unstructured":"Amendola, G. , Eiter, T. , Fink, M. , Leone, N. , and Moura, J. 2016. Semi-equilibrium models for paracoherent answer set programs. Artificial Intelligence 234, 219\u2013271.","key":"S1471068419000176_ref9"},{"doi-asserted-by":"publisher","key":"S1471068419000176_ref14","DOI":"10.1017\/CBO9780511543357"},{"key":"S1471068419000176_ref35","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","volume":"3\/4","author":"Gelfond","year":"1991","journal-title":"New Generation Computing 9"},{"key":"S1471068419000176_ref29","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1093\/logcom\/exn015","article-title":"Logical weak completions of paraconsistent logics","volume":"6","author":"Galindo","year":"2008","journal-title":"Journal of Logic and Computation 18"},{"key":"S1471068419000176_ref41","first-page":"23","volume-title":"Proceedings of the International Conference on Logic Programming (ICLP)","author":"Lifschitz","year":"1999"}],"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\/S1471068419000176","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T04:41:55Z","timestamp":1664426515000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068419000176\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":51,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["S1471068419000176"],"URL":"https:\/\/doi.org\/10.1017\/s1471068419000176","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2019,9]]}}}