Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Instantiations and Computational Aspects of Non-Flat Assumption-based Argumentation (2404.11431v1)

Published 17 Apr 2024 in cs.AI

Abstract: Most existing computational tools for assumption-based argumentation (ABA) focus on so-called flat frameworks, disregarding the more general case. In this paper, we study an instantiation-based approach for reasoning in possibly non-flat ABA. We make use of a semantics-preserving translation between ABA and bipolar argumentation frameworks (BAFs). By utilizing compilability theory, we establish that the constructed BAFs will in general be of exponential size. In order to keep the number of arguments and computational cost low, we present three ways of identifying redundant arguments. Moreover, we identify fragments of ABA which admit a poly-sized instantiation. We propose two algorithmic approaches for reasoning in possibly non-flat ABA. The first approach utilizes the BAF instantiation while the second works directly without constructing arguments. An empirical evaluation shows that the former outperforms the latter on many instances, reflecting the lower complexity of BAF reasoning. This result is in contrast to flat ABA, where direct approaches dominate instantiation-based approaches.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (45)
  1. On bipolarity in argumentation frameworks. Int. J. Intell. Syst., 23(10):1062–1093, 2008.
  2. Towards artificial argumentation. AI Mag., 38(3):25–36, 2017.
  3. ABAplus: Attack reversal in abstract and structured argumentation with preferences. In Proc. PRIMA, volume 10621 of Lecture Notes in Computer Science, pages 420–437. Springer, 2017.
  4. Handbook of Formal Argumentation. College Publications, 2018.
  5. Checking the acceptability of a set of arguments. In Proc. NMR, pages 59–64, 2004.
  6. Introduction to structured argumentation. Argument Comput., 5(1):1–4, 2014.
  7. CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020. In Proc. of SAT Competition 2020 – Solver and Benchmark Descriptions, volume B-2020-1 of Department of Computer Science Report Series B, pages 51–53. University of Helsinki, 2020.
  8. Handbook of Satisfiability - Second Edition, volume 336 of Frontiers in Artificial Intelligence and Applications. IOS Press, 2021.
  9. Summary report for the third international competition on computational models of argumentation. AI Mag., 42(3):70–73, 2021.
  10. An abstract, argumentation-theoretic approach to default reasoning. Artif. Intell., 93:63–101, 1997.
  11. Preprocessing of intractable problems. Inf. Comput., 176(2):89–120, 2002.
  12. On the evaluation of argumentation formalisms. Artif. Intell., 171(5-6):286–310, 2007.
  13. Counterexample-guided abstraction refinement for symbolic model checking. J.ACM, 50(5):752–794, 2003.
  14. SAT-based counterexample-guided abstraction refinement. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 23(7):1113–1123, 2004.
  15. Argument graphs and assumption-based argumentation. Artif. Intell., 233:1–59, 2016.
  16. Capturing bipolar argumentation in non-flat assumption-based argumentation. In Proc. PRIMA, volume 10621 of Lecture Notes in Computer Science, pages 386–402. Springer, 2017.
  17. Assumption-based argumentation: Disputes, explanations, preferences. In Handbook of Formal Argumentation, chapter 7, pages 365–408. College Publications, 2018.
  18. Computational complexity of flat and generic assumption-based argumentation, with and without probabilities. Artif. Intell., 293:103449, 2021.
  19. Argumentative XAI: a survey. In Proc. IJCAI, pages 4392–4399. ijcai.org, 2021.
  20. Flexible dispute derivations with forward and backward arguments for assumption-based argumentation. In Proc. CLAR, volume 13040 of Lecture Notes in Computer Science, pages 147–168. Springer, 2021.
  21. On the computational complexity of assumption-based argumentation for default reasoning. Artif. Intell., 141(1/2):57–78, 2002.
  22. Dialectic proof procedures for assumption-based, admissible argumentation. Artif. Intell., 170(2):114–159, 2006.
  23. Phan Minh Dung. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell., 77(2):321–358, 1995.
  24. Design and results of the second international competition on computational models of argumentation. Artif. Intell., 279, 2020.
  25. Domain-specific heuristics in answer set programming. In Proc. AAAI, pages 350–356. AAAI Press, 2013.
  26. Theory solving made easy with Clingo 5. In Technical Communications of ICLP, OASICS, pages 2:1–2:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
  27. The stable model semantics for logic programming. In Proc. ICLP/SLP, pages 1070–1080. MIT Press, 1988.
  28. PySAT: A Python toolkit for prototyping with SAT oracles. In Proc. SAT, volume 10929 of Lecture Notes in Computer Science, pages 428–437. Springer, 2018.
  29. Design of ICCMA 2023, 5th international competition on computational models of argumentation: A preliminary report (invited paper). In Proc. First International Workshop on Argumentation and Applications, volume 3472 of CEUR Workshop Proceedings, pages 4–10. CEUR-WS.org, 2023.
  30. Complexity results and algorithms for bipolar argumentation. In Proc. AAMAS, pages 1713–1721. IFAAMAS, 2019.
  31. Introducing the fourth international competition on computational models of argumentation. In Proc. SAFA, volume 2672 of CEUR Workshop Proceedings, pages 80–85. CEUR-WS.org, 2020.
  32. From structured to abstract argumentation: Assumption-based acceptance via AF reasoning. In Proc. ECSQARU, volume 10369 of Lecture Notes in Computer Science, pages 57–68. Springer, 2017.
  33. An answer set programming approach to argumentative reasoning in the ASPIC+ framework. In Proc. KR, pages 636–646. IJCAI, 2020.
  34. Declarative algorithms and complexity results for assumption-based argumentation. J. Artif. Intell. Res., 71:265–318, 2021.
  35. Harnessing incremental answer set solving for reasoning in assumption-based argumentation. Theory Pract. Log. Program., 21(6):717–734, 2021.
  36. Algorithms for reasoning in a default logic instantiation of assumption-based argumentation. In Proc. COMMA, volume 353 of Frontiers in Artificial Intelligence and Applications, pages 236–247. IOS Press, 2022.
  37. Computing stable conclusions under the weakest-link principle in the ASPIC+ argumentation formalism. In Proc. KR, pages 215–225. IJCAI, 2022.
  38. Argumentation frameworks induced by assumption-based argumentation: Relating size and complexity. In Proc. KR, pages 440–450. IJCAI, 2023.
  39. A general account of argumentation with preferences. Artif. Intell., 195:361–397, 2013.
  40. Ilkka Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell., 25(3-4):241–273, 1999.
  41. On dynamics in structured argumentation formalisms. J. Artif. Intell. Res., 77:563–643, 2023.
  42. The first international competition on computational models of argumentation: Results and analysis. Artif. Intell., 252:267–294, 2017.
  43. Matthias Thimm. The tweety library collection for logical aspects of artificial intelligence and knowledge representation. Künstliche Intell., 31(1):93–97, 2017.
  44. Francesca Toni. A tutorial on assumption-based argumentation. Argument Comput., 5(1):89–117, 2014.
  45. Non-flat ABA is an instance of bipolar argumentation. CoRR, abs/2305.12453, 2024.
Citations (5)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now