Skip to main content
SpringerLink
Log in

Towards a General Theory of Decomposability in Abstract Argumentation

  • Conference paper
  • First Online:
Logic and Argumentation (CLAR 2021)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 13040))

Included in the following conference series:

Abstract

The paper introduces a general model for the study of decomposability in abstract argumentation, i.e. the possibility of determining the semantics outcome based on local evaluations in subframeworks. As such, the paper extends a previous work by generalizing over the kind of information locally exploited. While not concerned with specific semantics, the paper shows the range of decomposable semantics with varying degrees of local information. It also introduces the notion of a canonical local function, which can enforce decomposability whenever this is possible.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    In the general definition, the set of arguments may be infinite.

  2. 2.

    It is immediate to see that \(\sqsubseteq \) is stricter than \(\subseteq \), i.e. \({AF}_1 \sqsubseteq {AF}_2\) entails \({AF}_1 \subseteq {AF}_2\).

  3. 3.

    This local information function is the one implicitly adopted in [4].

References

  1. Atkinson, K., et al.: Towards artificial argumentation. AI Mag. 38(3), 25–36 (2017)

    Google Scholar 

  2. Baroni, P., Caminada, M., Giacomin, M.: An introduction to argumentation semantics. Knowl. Eng. Rev. 26(4), 365–410 (2011)

    Article  Google Scholar 

  3. Baroni, P., Giacomin, M.: On principle-based evaluation of extension-based argumentation semantics. Artif. Intell. (Spec. Issue Argument. A.I.) 171(10/15), 675–700 (2007)

    MathSciNet  MATH  Google Scholar 

  4. Baroni, P., Boella, G., Cerutti, F., Giacomin, M., van der Torre, L.W.N., Villata, S.: On the input/output behavior of argumentation frameworks. Artif. Intell. 217, 144–197 (2014)

    Article  MathSciNet  Google Scholar 

  5. Baroni, P., Giacomin, M.: Some considerations on epistemic and practical reasoning in abstract argumentation. In: Proceedings of the 2nd Workshop on Advances in Argumentation In Artificial Intelligence, pp. 1–5 (2018)

    Google Scholar 

  6. Baumann, R., Brewka, G.: Analyzing the equivalence zoo in abstract argumentation. In: Leite, J., Son, T.C., Torroni, P., van der Torre, L., Woltran, S. (eds.) CLIMA 2013. LNCS (LNAI), vol. 8143, pp. 18–33. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40624-9_2

    Chapter  MATH  Google Scholar 

  7. Baumann, R., Brewka, G., Wong, R.: Splitting argumentation frameworks: an empirical evaluation. In: Modgil, S., Oren, N., Toni, F. (eds.) TAFA 2011. LNCS (LNAI), vol. 7132, pp. 17–31. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29184-5_2

    Chapter  Google Scholar 

  8. Baumann, R.: Splitting an argumentation framework. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 40–53. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20895-9_6

    Chapter  Google Scholar 

  9. Caminada, M.: On the issue of reinstatement in argumentation. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 111–123. Springer, Heidelberg (2006). https://doi.org/10.1007/11853886_11

    Chapter  MATH  Google Scholar 

  10. Caminada, M.W.A.: A labelling approach for ideal and stage semantics. Argument Comput. 2(1), 1–21 (2011)

    Article  Google Scholar 

  11. Cerutti, F., Giacomin, M., Vallati, M., Zanella, M.: A SCC recursive meta-algorithm for computing preferred labellings in abstract argumentation. In: Proceedings of the 14th International Conference on Principles of Knowledge Representation and Reasoning (KR 2014) (2014, to appear)

    Google Scholar 

  12. Cerutti, F., Tachmazidis, I., Vallati, M., Batsakis, S., Giacomin, M., Antoniou, G.: Exploiting parallelism for hard problems in abstract argumentation. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, vol. 29 (2015)

    Google Scholar 

  13. Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games. Artif. Intell. 77, 321–357 (1995)

    Article  MathSciNet  Google Scholar 

  14. Gabbay, D.M.: Fibring argumentation frames. Stud. Log. 93(2–3), 231–295 (2009)

    Article  MathSciNet  Google Scholar 

  15. Giacomin, M.: Handling heterogeneous disagreements through abstract argumentation (extended abstract). In: An, B., Bazzan, A., Leite, J., Villata, S., van der Torre, L. (eds.) PRIMA 2017. LNCS (LNAI), vol. 10621, pp. 3–11. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-69131-2_1

    Chapter  Google Scholar 

  16. Liao, B., Huang, H.: Partial semantics of argumentation: basic properties and empirical results. J. Log. Comput. 23(3), 541–562 (2013)

    Article  MathSciNet  Google Scholar 

  17. Liao, B., Jin, L., Koons, R.C.: Dynamics of argumentation systems: a division-based method. Artif. Intell. 175, 1790–1814 (2011)

    Article  MathSciNet  Google Scholar 

  18. Rienstra, T., Perotti, A., Villata, S., Gabbay, D.M., van der Torre, L.: Multi-sorted argumentation. In: Modgil, S., Oren, N., Toni, F. (eds.) TAFA 2011. LNCS (LNAI), vol. 7132, pp. 215–231. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29184-5_14

    Chapter  Google Scholar 

  19. Villata, S., Boella, G., van Der Torre, L.: Argumentation patterns. In: Proceedings of ARGMAS 2011 8th International Workshop on Argumentation in Multi-Agent Systems, pp. 133–150 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Brescia, Brescia, Italy

    Massimiliano Giacomin, Pietro Baroni & Federico Cerutti

  2. Cardiff University, Cardiff, UK

    Federico Cerutti

Authors
  1. Massimiliano Giacomin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pietro Baroni
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Federico Cerutti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Massimiliano Giacomin or Pietro Baroni .

Editor information

Editors and Affiliations

  1. Department of Information Engineering, University of Brescia, Brescia, Italy

    Pietro Baroni

  2. Department of Mathematics and Computer Science, Freie Universität Berlin, Berlin, Germany

    Christoph Benzmüller

  3. Department of Philosophy (Zhuhai), Sun Yat-sen University, Zhuhai, China

    Yὶ N. Wáng

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Giacomin, M., Baroni, P., Cerutti, F. (2021). Towards a General Theory of Decomposability in Abstract Argumentation. In: Baroni, P., Benzmüller, C., Wáng, Y.N. (eds) Logic and Argumentation. CLAR 2021. Lecture Notes in Computer Science(), vol 13040. Springer, Cham. https://doi.org/10.1007/978-3-030-89391-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-89391-0_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-89390-3

  • Online ISBN: 978-3-030-89391-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation