{"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":1762102446644,"version":"3.40.5"},"reference-count":65,"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>In the last years, abstract argumentation has met with great success in AI, since it has served to capture several non-monotonic logics for AI. Relations between argumentation framework (AF) semantics and logic programming ones are investigating more and more. In particular, great attention has been given to the well-known stable extensions of an AF, that are closely related to the answer sets of a logic program. However, if a framework admits a small incoherent part, no stable extension can be provided. To overcome this shortcoming, two semantics generalizing stable extensions have been studied, namely semi-stable and stage. In this paper, we show that another perspective is possible on incoherent AFs, called paracoherent extensions, as they have a counterpart in paracoherent answer set semantics. We compare this perspective with semi-stable and stage semantics, by showing that computational costs remain unchanged, and moreover an interesting symmetric behaviour is maintained.<\/jats:p>","DOI":"10.1017\/s1471068419000139","type":"journal-article","created":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T09:06:21Z","timestamp":1568970381000},"page":"688-704","source":"Crossref","is-referenced-by-count":2,"title":["Paracoherent Answer Set Semantics meets Argumentation Frameworks"],"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-0001-8218-3178","authenticated-orcid":false,"given":"FRANCESCO","family":"RICCA","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2019,9,20]]},"reference":[{"key":"S1471068419000139_ref64","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s11225-009-9210-5","article-title":"Complete extensions in argumentation coincide with 3-valued stable models in logic programming","volume":"2","author":"Wu","year":"2009","journal-title":"Studia Logica 93"},{"key":"S1471068419000139_ref48","unstructured":"Lin, F. and Zhao, X. 2004. On odd and even cycles in normal logic programs. In AAAI. AAAI Press \/ The MIT Press, 80\u201385."},{"key":"S1471068419000139_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2004.07.012"},{"key":"S1471068419000139_ref24","first-page":"747","article-title":"Normal forms for answer sets programming","volume":"6","author":"Costantini","year":"2005","journal-title":"TPLP 5"},{"key":"S1471068419000139_ref40","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":"J. Log. Comput. 18"},{"key":"S1471068419000139_ref9","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exu009"},{"key":"S1471068419000139_ref23","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1093\/logcom\/exr033","article-title":"Semi-stable semantics","volume":"5","author":"Caminada","year":"2012","journal-title":"J. Log. Comput. 22"},{"key":"S1471068419000139_ref12","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1093\/logcom\/exu012","article-title":"Introduction to the special issue on loops in argumentation","volume":"4","author":"Baroni","year":"2016","journal-title":"J. Log. Comput. 26"},{"key":"S1471068419000139_ref65","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":"49","author":"You","year":"1994","journal-title":"J. Comput. Syst. Sci"},{"key":"S1471068419000139_ref7","unstructured":"Amendola, G. , Eiter, T. , Fink, M. , Leone, N. , and Moura, J. 2016. Semi-equilibrium models for paracoherent answer set programs. Artif. Intell. 234, 219\u2013271."},{"key":"S1471068419000139_ref34","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1093\/logcom\/exu007","article-title":"The handling of loops in argumentation networks","volume":"4","author":"Gabbay","year":"2016","journal-title":"J. Log. Comput. 26"},{"key":"S1471068419000139_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.05.001"},{"key":"S1471068419000139_ref38","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1093\/logcom\/exs011","article-title":"The cf2 argumentation semantics revisited","volume":"5","author":"Gaggl","year":"2013","journal-title":"J. Log. Comput. 23"},{"key":"S1471068419000139_ref2","unstructured":"Amendola, G. 2018. Solving the stable roommates problem using incoherent answer set programs. In RiCeRcA@AI*IA. CEUR Workshop Proceedings, vol. 2272. CEUR-WS.org."},{"key":"S1471068419000139_ref62","unstructured":"Verheij, B. 1996. Two approaches to dialectical argumentation: Admissible sets and argumentation stages. In FAPR. 357\u2013368."},{"key":"S1471068419000139_ref60","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","article-title":"Extending and implementing the stable model semantics","volume":"1","author":"Simons","year":"2002","journal-title":"Artif. Intell. 138"},{"key":"S1471068419000139_ref42","first-page":"620","article-title":"The well-founded semantics for general logic programs","volume":"3","author":"Gelder","year":"1991","journal-title":"J. ACM 38"},{"key":"S1471068419000139_ref58","unstructured":"Seipel, D. 1997. Partial evidential stable models for disjunctive deductive databases. In LPKR. Lecture Notes in Computer Science, vol. 1471. Springer, 66\u201384."},{"key":"S1471068419000139_ref47","unstructured":"Lifschitz, V. 1999. Answer set planning. In ICLP. MIT Press, 23\u201337."},{"key":"S1471068419000139_ref33","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018947420290"},{"key":"S1471068419000139_ref25","unstructured":"Cramer, M. and Guillaume, M. 2019. Empirical study on human evaluation of complex argumentation frameworks. In JELIA. Lecture Notes in Computer Science, vol. 11468. Springer, 102\u2013115."},{"key":"S1471068419000139_ref45","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1093\/logcom\/9.2.215","article-title":"Robust semantics for argumentation frameworks","volume":"2","author":"Jakobovits","year":"1999","journal-title":"J. Log. Comput. 9"},{"key":"S1471068419000139_ref4","unstructured":"Amendola, G. , Dodaro, C. , Faber, W. , Pulina, L. , and Ricca, F. 2019. Algorithm selection for paracoherent answer set computation. In JELIA. Lecture Notes in Computer Science, vol. 11468. Springer, 479\u2013489."},{"key":"S1471068419000139_ref3","unstructured":"Amendola, G. , Dodaro, C. , Faber, W. , Leone, N. , and Ricca, F. 2017. On the computation of paracoherent answer sets. In AAAI. AAAI Press, 1034\u20131040."},{"key":"S1471068419000139_ref35","unstructured":"Gaggl, S. A. , Linsbichler, T. , Maratea, M. , and Woltran, S. 2016. Introducing the second international competition on computational models of argumentation. In SAFA@COMMA. 4\u20139."},{"key":"S1471068419000139_ref31","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/j.ipl.2010.04.005","article-title":"Complexity of semi-stable and stage semantics in argumentation frameworks","volume":"110","author":"Dvor\u00e1k","year":"2010","journal-title":"Inf. Process. Lett"},{"key":"S1471068419000139_ref20","unstructured":"Caminada, M. 2006. Semi-stable semantics. In COMMA\u201906. 121\u2013130."},{"key":"S1471068419000139_ref6","doi-asserted-by":"crossref","unstructured":"Amendola, G. , Dodaro, C. , and Ricca, F. 2019. Better paracoherent answer sets with less resources. TPLP this volume, this number, to appear.","DOI":"10.1017\/S1471068419000176"},{"key":"S1471068419000139_ref44","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Generation Comput"},{"key":"S1471068419000139_ref18","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exu004"},{"key":"S1471068419000139_ref63","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0004-3702(03)00107-3","article-title":"Artificial argument assistants for defeasible argumentation","volume":"1","author":"Verheij","year":"2003","journal-title":"Artif. Intell. 150"},{"key":"S1471068419000139_ref5","unstructured":"Amendola, G. , Dodaro, C. , Faber, W. , and Ricca, F. 2018. Externally supported models for efficient computation of paracoherent answer sets. In AAAI. AAAI Press, 1720\u20131727."},{"key":"S1471068419000139_ref59","doi-asserted-by":"crossref","unstructured":"Simari, G. R. and Rahwan, I. , Eds. 2009. Argumentation in Artificial Intelligence. Springer.","DOI":"10.1007\/978-0-387-98197-0"},{"key":"S1471068419000139_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.11.005"},{"key":"S1471068419000139_ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.05.003"},{"key":"S1471068419000139_ref22","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ijar.2014.12.004","article-title":"On the equivalence between logic programming semantics and argumentation semantics","volume":"58","author":"Caminada","year":"2015","journal-title":"Int. J. Approx. Reasoning"},{"key":"S1471068419000139_ref57","unstructured":"Schulz, C. and Toni, F. 2018. On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation. Artif. Intell. 262, 301\u2013335."},{"key":"S1471068419000139_ref13","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/j.artint.2007.04.004","article-title":"On principle-based evaluation of extension-based argumentation semantics","volume":"10","author":"Baroni","year":"2007","journal-title":"Artif. Intell. 171"},{"key":"S1471068419000139_ref14","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.artint.2005.05.006","article-title":"Scc-recursiveness: a general schema for argumentation semantics","volume":"1","author":"Baroni","year":"2005","journal-title":"Artif. Intell. 168"},{"key":"S1471068419000139_ref8","unstructured":"Amgoud, L. , Parsons, S. , and Maudet, N. 2000. Arguments, dialogue, and negotiation. In ECAI. IOS Press, 338\u2013342."},{"key":"S1471068419000139_ref15","unstructured":"Baumann, R. , Linsbichler, T. , and Woltran, S. 2016. Verifiability of argumentation semantics. In COMMA\u201916. 83\u201394."},{"key":"S1471068419000139_ref39","unstructured":"Gale, D. and Shapley, L. S. 1962. College admissions and the stability of marriage. The American Mathematical Monthly 69, 9\u201315."},{"key":"S1471068419000139_ref54","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0004-3702(91)90013-A","article-title":"Three-valued nonmonotonic formalisms and semantics of logic programs","volume":"1","author":"Przymusinski","year":"1991","journal-title":"Artif. Intell. 49"},{"key":"S1471068419000139_ref21","unstructured":"Caminada, M. 2007. Comparing two unique extension semantics for formal argumentation: ideal and eager. In BNAIC\u201907."},{"key":"S1471068419000139_ref29","doi-asserted-by":"crossref","unstructured":"Dunne, P. E. and Wooldridge, M. 2009. Complexity of abstract argumentation. In Argumentation in Artificial Intelligence. 85\u2013104.","DOI":"10.1007\/978-0-387-98197-0_5"},{"key":"S1471068419000139_ref28","doi-asserted-by":"crossref","unstructured":"Dunne, P. E. and Caminada, M. 2008. Computational complexity of semi-stable semantics in abstract argumentation frameworks. In JELIA\u201908. 153\u2013165.","DOI":"10.1007\/978-3-540-87803-2_14"},{"key":"S1471068419000139_ref36","unstructured":"Gaggl, S. A. , Linsbichler, T. , Maratea, M. , and Woltran, S. 2018. Summary report of the second international competition on computational models of argumentation. 39, 4, 77\u201379."},{"key":"S1471068419000139_ref41","first-page":"953","article-title":"On elementary loops of logic programs","volume":"6","author":"Gebser","year":"2011","journal-title":"TPLP 11"},{"key":"S1471068419000139_ref37","unstructured":"Gaggl, S. A. , Rudolph, S. , and Thomazo, M. 2015. What is a reasonable argumentation semantics? In Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation. 309\u2013324."},{"key":"S1471068419000139_ref43","unstructured":"Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, August 15-19, 1988 (2 Volumes). 1070\u20131080."},{"key":"S1471068419000139_ref46","unstructured":"Lee, J. and Lifschitz, V. 2003. Loop formulas for disjunctive logic programs. In ICLP. Lecture Notes in Computer Science, vol. 2916. Springer, 451\u2013465."},{"key":"S1471068419000139_ref55","unstructured":"Sacc\u00e0, D. and Zaniolo, C. 1991. Partial models and three-valued models in logic programs with negation. In LPNMR. The MIT Press, 87\u2013101."},{"key":"S1471068419000139_ref61","unstructured":"Strass, H. 2013. Approximating operators and semantics for abstract dialectical frameworks. Artif. Intell. 205, 39\u201370."},{"key":"S1471068419000139_ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"S1471068419000139_ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043195"},{"key":"S1471068419000139_ref32","unstructured":"Eiter, T. , Fink, M. , and Moura, J. 2010. Paracoherent answer set programming. In KR. AAAI Press."},{"key":"S1471068419000139_ref10","unstructured":"Balduccini, M. and Gelfond, M. 2003. Logic programs with consistency-restoring rules. In ISLFCR, AAAI 2003 Spring Symposium Series. 9\u201318."},{"key":"S1471068419000139_ref52","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF00118496","article-title":"A dialectical model of assessing conflicting arguments in legal reasoning","volume":"3","author":"Prakken","year":"1996","journal-title":"Artif. Intell. Law 4"},{"key":"S1471068419000139_ref53","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF03037171","article-title":"Stable semantics for disjunctive programs","volume":"9","author":"Przymusinski","year":"1991","journal-title":"New Generation Comput"},{"key":"S1471068419000139_ref49","doi-asserted-by":"crossref","unstructured":"Pereira, L. M. and Pinto, A. M. 2005. Revised stable models - a semantics for logic programs. In EPIA. 29\u201342.","DOI":"10.1007\/11595014_4"},{"key":"S1471068419000139_ref51","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0004-3702(98)00100-3","article-title":"The logical foundations of goal-regression planning in autonomous agents","volume":"2","author":"Pollock","year":"1998","journal-title":"Artif. Intell. 106"},{"key":"S1471068419000139_ref56","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":"J. Log. Comput. 5"},{"key":"S1471068419000139_ref50","doi-asserted-by":"crossref","unstructured":"Pereira, L. M. and Pinto, A. M. 2007. Approved models for normal logic programs. In LPAR. 454\u2013468.","DOI":"10.1007\/978-3-540-75560-9_33"},{"key":"S1471068419000139_ref30","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exu006"},{"key":"S1471068419000139_ref16","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exu011"}],"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\/S1471068419000139","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T04:29:35Z","timestamp":1571113775000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068419000139\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":65,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["S1471068419000139"],"URL":"https:\/\/doi.org\/10.1017\/s1471068419000139","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2019,9]]}}}