{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T13:54:02Z","timestamp":1768744442439,"version":"3.49.0"},"reference-count":41,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T00:00:00Z","timestamp":1570665600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2020,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper formally compares some central notions from two well-known formalisms for rule-based argumentation, <jats:italic>DeLP<\/jats:italic> and <jats:italic>ASPIC<\/jats:italic><jats:sup>+<\/jats:sup>. The comparisons especially focus on intuitive adequacy and inter-translatability, consistency, and closure properties. As for differences in the definitions of arguments and attack, it turns out that <jats:italic>DeLP<\/jats:italic>\u2019s definitions are intuitively appealing but that they may not fully comply with Caminada and Amgoud\u2019s rationality postulates of strict closure and indirect consistency. For some special cases, the <jats:italic>DeLP<\/jats:italic> definitions are shown to fare better than <jats:italic>ASPIC<\/jats:italic><jats:sup>+<\/jats:sup>. Next, it is argued that there are reasons to consider a variant of <jats:italic>DeLP<\/jats:italic> with grounded semantics, since in some examples its current notion of warrant arguably has counterintuitive consequences and may lead to sets of warranted arguments that are not admissible. Finally, under some minimality and consistency assumptions on <jats:italic>ASPIC<\/jats:italic><jats:sup>+<\/jats:sup> arguments, a one-to-many correspondence between <jats:italic>ASPIC<\/jats:italic><jats:sup>+<\/jats:sup> arguments and <jats:italic>DeLP<\/jats:italic> arguments is identified in such a way that if the <jats:italic>DeLP<\/jats:italic> warranting procedure is changed to grounded semantics, then \u2019s <jats:italic>DeLP<\/jats:italic> notion of warrant and <jats:italic>ASPIC<\/jats:italic><jats:sup>+<\/jats:sup> \u2019s notion of justification are equivalent. This result is proven for three alternative definitions of attack.<\/jats:p>","DOI":"10.1017\/s1471068419000437","type":"journal-article","created":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T07:28:43Z","timestamp":1570692523000},"page":"358-390","source":"Crossref","is-referenced-by-count":7,"title":["A Comparative Study of Some Central Notions of <i>ASPIC<\/i><sup>+<\/sup> and <i>DeLP<\/i>"],"prefix":"10.1017","volume":"20","author":[{"given":"ALEJANDRO J.","family":"GARC\u00cdA","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3431-7757","authenticated-orcid":false,"given":"HENRY","family":"PRAKKEN","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6247-0428","authenticated-orcid":false,"given":"GUILLERMO R.","family":"SIMARI","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2019,10,10]]},"reference":[{"key":"S1471068419000437_ref15","unstructured":"Garc\u00eda, A. J. and Simari, G. R. 2014. Defeasible logic programming: DeLP-servers, contextual queries, and explanations for answers. Argument and Computation 5, 63\u201388."},{"key":"S1471068419000437_ref18","unstructured":"Garc\u00eda, A. J. 2000. Defeasible Logic Programming: Definition, Operational Semantics and Parallelism. Ph.D. thesis, Computer Science and Engineering Department, Universidad Nacional del Sur, Bah\u00eda Blanca, Argentina."},{"key":"S1471068419000437_ref23","unstructured":"Mart\u00ednez, M. V. , Garc\u00eda, A. J. and Simari, G. R. 2012. On the use of presumptions in structured defeasible reasoning. In Computational Models of Argument. Proceedings of COMMA 2012, Verheij, B. , Szeider, S. , and Woltran, S. , Eds. Frontiers in Artificial Intelligence and Applications, vol. 245. IOS Press, 185\u2013196."},{"key":"S1471068419000437_ref29","first-page":"293","volume-title":"Argumentation-based Proofs of Endearment. Essays in Honor of Guillermo R. Simari on the Occasion of his 70th Birthday","author":"Parsons","year":"2018"},{"key":"S1471068419000437_ref17","unstructured":"Garc\u00eda, A. J. , Simari, G. R. and Ches\u00f1evar, C. I. 1998. An argumentative framework for reasoning with inconsistent and incomplete information. In Proceedings of the ECAI\u201998 Workshop on Practical Reasoning and Rationality, Brighton, UK."},{"key":"S1471068419000437_ref11","first-page":"149","article-title":"A structured argumentation system with backing and undercutting","volume":"49","author":"Cohen","year":"2016","journal-title":"Engineering Applications of AI"},{"key":"S1471068419000437_ref30","doi-asserted-by":"publisher","DOI":"10.1207\/s15516709cog1104_4"},{"key":"S1471068419000437_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00071-6"},{"key":"S1471068419000437_ref16","first-page":"408","volume-title":"Handbook of Formal Argumentation","volume":"1","author":"Garc\u00eda","year":"2018"},{"key":"S1471068419000437_ref31","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1887.001.0001"},{"key":"S1471068419000437_ref8","unstructured":"Caminada, M. , Modgil, S. and Oren, N. 2014. Preferences and unrestricted rebut. In Computational Models of Argument. Proceedings of COMMA 2014, Parsons, S. , Oren, N. , Reed, C. , and Cerutti, F. , Eds. IOS Press, Amsterdam etc, 209\u2013220."},{"key":"S1471068419000437_ref28","doi-asserted-by":"publisher","DOI":"10.1215\/00318108-109-3-373"},{"key":"S1471068419000437_ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.10.008"},{"key":"S1471068419000437_ref36","unstructured":"Simari, G. R. , Ches\u00f1evar, C. I. and Garc\u00eda, A. J. 1994a. Focusing inference in defeasible argumentation. In IV Iberoamerican Conference on Artificial Intelligence. IBERAMIA\u201994."},{"key":"S1471068419000437_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98197-0_6"},{"key":"S1471068419000437_ref26","doi-asserted-by":"publisher","DOI":"10.1080\/19462166.2013.869766"},{"key":"S1471068419000437_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"S1471068419000437_ref32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46581-2_14"},{"key":"S1471068419000437_ref14","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001674"},{"key":"S1471068419000437_ref6","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262026437.001.0001"},{"key":"S1471068419000437_ref9","unstructured":"Caminada, M. and Wu, Y. 2011. On the limitations of abstract argumentation. In Proceedings of the 23rd Benelux Conference on Artificial Intelligence (BNAIC-11), Gent, Belgium."},{"key":"S1471068419000437_ref41","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exu017"},{"key":"S1471068419000437_ref33","doi-asserted-by":"publisher","DOI":"10.1080\/19462160903564592"},{"key":"S1471068419000437_ref22","first-page":"69","volume-title":"Principles of Knowledge Representation","author":"Lifschitz","year":"1996"},{"key":"S1471068419000437_ref39","unstructured":"Tucat, M. , Garc\u00eda, A. J. and Simari, G. R. 2009. Using defeasible logic programming with contextual queries for developing recommender servers. In AAAI Fall Symposium Series."},{"key":"S1471068419000437_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888911000166"},{"key":"S1471068419000437_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-9805-0_27"},{"key":"S1471068419000437_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.02.003"},{"key":"S1471068419000437_ref40","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(96)00041-0"},{"key":"S1471068419000437_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.12.003"},{"key":"S1471068419000437_ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.06.048"},{"key":"S1471068419000437_ref20","unstructured":"Garc\u00eda, A. J. , Rotstein, N. D. , Tucat, M. and Simari, G. R. 2007. An argumentative reasoning service for deliberative agents. In Knowledge Science, Engineering and Management, Second International Conference, KSEM 2007, Zhang, Z. and Siekmann, J. H. , Eds. Lecture Notes in Computer Science, vol. 4798. Springer, 128\u2013139."},{"key":"S1471068419000437_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.12.036"},{"key":"S1471068419000437_ref10","unstructured":"Cayrol, C. 1995. On the relation between argumentation and non-monotonic coherence-based entailment. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, 1443\u20131448."},{"key":"S1471068419000437_ref4","first-page":"157","volume-title":"Handbook of Formal Argumentation","volume":"1","author":"Baroni","year":"2018"},{"key":"S1471068419000437_ref1","doi-asserted-by":"publisher","DOI":"10.1080\/11663081.2013.830381"},{"key":"S1471068419000437_ref34","unstructured":"Prakken, H. 2016. Rethinking the rationality postulates for argumentation-based inference. In Computational Models of Argument. Proceedings of COMMA 2016, Baroni, P. , Gordon, T. , Scheffler, T. and Stede, M. , Eds. IOS Press, Amsterdam etc, 419\u2013430."},{"key":"S1471068419000437_ref37","unstructured":"Simari, G. R. , Ches\u00f1evar, C. I. and Garc\u00eda, A. J. 1994b. The role of dialectics in defeasible argumentation. In XIV International Conference of the Chilean Computer Society, November 1994, Concepcin, Chile, 111\u2013122."},{"key":"S1471068419000437_ref27","first-page":"73","volume-title":"Handbook of Formal Argumentation","volume":"1","author":"Modgil","year":"2018"},{"key":"S1471068419000437_ref2","unstructured":"Amgoud, L. , Bodenstaff, L. , Caminada, M. , McBurney, P. , Parsons, S. , Prakken, H. , van Veenen, J. and Vreeswijk, G. 2006. Final review and report on formal argumentation system. Deliverable D2.6, ASPIC IST-FP6-002307."},{"key":"S1471068419000437_ref35","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90069-A"}],"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\/S1471068419000437","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T09:10:24Z","timestamp":1604567424000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068419000437\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,10]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["S1471068419000437"],"URL":"https:\/\/doi.org\/10.1017\/s1471068419000437","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,10]]}}}