{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T03:44:45Z","timestamp":1777434285368,"version":"3.51.4"},"reference-count":36,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T00:00:00Z","timestamp":1700784000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Argument &amp; Computation"],"published-print":{"date-parts":[[2024,11,12]]},"abstract":"<jats:p>The motivation of this study is that Reiter\u2019s default theory as well as assumption-based argumentation frameworks corresponding to default theories have difficulties in handling disjunctive information, while a disjunctive default theory ( ddt) avoids them. This paper presents the semantic correspondence between generalized assumption-based argumentation (ABA) and extended disjunctive logic programming as well as the correspondence between ABA and nonmonotonic reasoning approaches such as disjunctive default logic and prioritized circumscription. To overcome the above-mentioned difficulties of ABA frameworks corresponding to default theories, we propose an assumption-based framework (ABF) translated from an extended disjunctive logic program (EDLP) since an EDLP can be translated into a ddt. Our ABF incorporates explicit negation and the connective of disjunction \u201c|\u201d to Heyninck and Arieli\u2019s ABF induced by a disjunctive logic program. In this paper, first, we show how arguments are constructed from disjunctive rules in our proposed ABF. Then, we show the correspondence between answer sets of an EDLP P and stable extensions of the ABF translated from P with trivialization rules. After defining rationality postulates, we show answer sets of a consistent EDLP are captured by consistent stable extensions of the translated ABF with no trivialization rules. Finally, we show the correspondence between ABA and disjunctive default logic (resp. prioritized circumscription). The relation between ABA and possible model semantics of EDLPs is also discussed.<\/jats:p>","DOI":"10.3233\/aac-220019","type":"journal-article","created":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T12:36:02Z","timestamp":1700829362000},"page":"309-353","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["Assumption-based argumentation for extended disjunctive logic programming and its relation to nonmonotonic reasoning"],"prefix":"10.1177","volume":"15","author":[{"given":"Toshiko","family":"Wakaki","sequence":"first","affiliation":[{"name":"Shibaura Institute of Technology, 307 Fukasaku, Minuma-ku, Saitama-city, Saitama, 337\u20138570, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2023,11,24]]},"reference":[{"issue":"6","key":"ref001","first-page":"1793","volume":"8","author":"Arieli O.","year":"2021","journal-title":"IfCoLog Journal of Logics and their Applications"},{"key":"ref002","doi-asserted-by":"crossref","unstructured":"M.\u00a0Beirlaen, J.\u00a0Heyninck and C.\u00a0Stra\u00dfer, Reasoning by cases in structured argumentation, in: Proceedings of the 2017 ACM Symposium on Applied Computing, ACM, 2017, pp.\u00a0989\u2013994.","DOI":"10.1145\/3019612.3019716"},{"key":"ref003","unstructured":"M.\u00a0Beirlaen, J.\u00a0Heyninck and C.\u00a0Stra\u00dfer, A critical assessment of Pollock\u2019s work on logic-based argumentation with suppositions, in: Proceedings of the 17th International Workshop on Non-monotonic Reasoning (NMR-2018), 2018, pp.\u00a063\u201372."},{"key":"ref004","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530761"},{"key":"ref005","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00015-5"},{"key":"ref006","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.02.003"},{"key":"ref007","doi-asserted-by":"publisher","DOI":"10.1613\/jair.5581"},{"key":"ref008","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"ref009","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2005.07.002"},{"key":"ref010","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98197-0_10"},{"key":"ref011","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.05.003"},{"key":"ref012","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4107"},{"key":"ref013","unstructured":"T.\u00a0Eiter and G.\u00a0Gottlob, Complexity results for disjunctive logic programming and application to nonmonotonic logics, in: Logic Programming, Proceedings of the 10th International Symposium (ILPS-1993), MIT Press, 1993, pp.\u00a0266\u2013278."},{"key":"ref014","unstructured":"M.\u00a0Gelfond and V.\u00a0Lifschitz, The stable model semantics for logic programming, in: Logic Programming, Proceedings of the Fifth International Conference and Symposium (ICLP\/SLP-1988), MIT Press, 1988, pp.\u00a01070\u20131080."},{"key":"ref015","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"ref016","unstructured":"M.\u00a0Gelfond, V.\u00a0Lifschitz, H.\u00a0Przymusinska and M.\u00a0Truszczynski, Disjunctive defaults, in: Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR-1991), 1991, pp.\u00a0230\u2013237."},{"key":"ref017","unstructured":"J.\u00a0Heyninck and O.\u00a0Arieli, On the semantics of simple contrapositive assumption-based argumentation frameworks, in: Proceedings of the Seventh International Conference on Computational Models of Argument (COMMA-2018), IOS Press, 2018, pp.\u00a09\u201320."},{"key":"ref018","doi-asserted-by":"crossref","unstructured":"J.\u00a0Heyninck and O.\u00a0Arieli, An argumentative characterization of disjunctive logic programming, in: Proceedings of the 19th EPIA Conference on Artificial Intelligence (EPIA-2019), 2019, pp.\u00a0526\u2013538.","DOI":"10.1007\/978-3-030-30244-3_44"},{"key":"ref019","doi-asserted-by":"crossref","unstructured":"T.\u00a0Lehtonen, J.P.\u00a0Wallner and M.\u00a0J\u00e4rvisalo, Algorithms for reasoning in a default logic instantiation of assumption-based argumentation, in: Proceedings of the 9th International Conference on Computational Models of Argument (COMMA-2022), IOS Press, 2022, pp.\u00a0236\u2013247.","DOI":"10.3233\/FAIA220156"},{"key":"ref020","unstructured":"V.\u00a0Lifschitz, Computing circumscription, in: Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI-1985), 1985, pp.\u00a0121\u2013127."},{"key":"ref021","doi-asserted-by":"publisher","DOI":"10.1017\/S147106840700302X"},{"key":"ref022","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(80)90011-9"},{"key":"ref023","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(86)90032-9"},{"key":"ref024","doi-asserted-by":"publisher","DOI":"10.1080\/19462166.2013.869766"},{"key":"ref025","doi-asserted-by":"publisher","DOI":"10.1080\/19462160903564592"},{"key":"ref026","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037171"},{"key":"ref027","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(80)90014-4"},{"key":"ref028","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/5.3.265"},{"key":"ref029","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59487-6_25"},{"key":"ref030","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00073-4"},{"key":"ref031","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068414000702"},{"key":"ref032","doi-asserted-by":"publisher","DOI":"10.1111\/coin.12111"},{"key":"ref033","unstructured":"T.\u00a0Wakaki, Consistency in assumption-based argumentation, in: Proceedings of the 8th International Conference on Computational Models of Argument (COMMA-2020), IOS Press, 2020, pp.\u00a0371\u2013382."},{"key":"ref034","doi-asserted-by":"crossref","unstructured":"T.\u00a0Wakaki, Assumption-based argumentation for extended disjunctive logic programming, in: Proceedings of the 12th International Symposium on Foundations of Information and Knowledge Systems (FoIKS-2022), 2022, pp.\u00a035\u201354.","DOI":"10.1007\/978-3-031-11321-5_3"},{"key":"ref035","unstructured":"T.\u00a0Wakaki and K.\u00a0Satoh, Compiling prioritized circumscription into extended logic programs, in: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-1997), 1997, pp.\u00a0182\u2013187."},{"key":"ref036","unstructured":"https:\/\/arxiv.org\/pdf\/2106.10966.pdf."}],"container-title":["Argument &amp; Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AAC-220019","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/AAC-220019","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AAC-220019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:53:27Z","timestamp":1777377207000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/AAC-220019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,24]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,11,12]]}},"alternative-id":["10.3233\/AAC-220019"],"URL":"https:\/\/doi.org\/10.3233\/aac-220019","relation":{},"ISSN":["1946-2166","1946-2174"],"issn-type":[{"value":"1946-2166","type":"print"},{"value":"1946-2174","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,24]]}}}