Skip to main content
SpringerLink
Log in

Infinite Argumentation Frameworks

On the Existence and Uniqueness of Extensions

  • Chapter
Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation

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

Abstract

Abstract properties satisfied for finite structures do not necessarily carry over to infinite structures. Two of the most basic properties are existence and uniqueness of something. In this work we study these properties for acceptable sets of arguments, so-called extensions, in the field of abstract argumentation. We review already known results, present new proofs or explain sketchy old ones in more detail. We also contribute new results and introduce as well as study the question of existence-(in)dependence between argumentation semantics.

This research has been supported by DFG (project BR 1817/7-1) and FWF (project I1102).

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bárány, V., Grädel, E., Rubin, S.: Automata-based presentations of infinite structures. In: Finite and Algorithmic Model Theory, pp. 1–76. Cambridge University Press (2011)

    Google Scholar 

  2. Baroni, P., Caminada, M., Giacomin, M.: An introduction to argumentation semantics. Knowledge Engineering Review 26(4), 365–410 (2011)

    Article  Google Scholar 

  3. Baroni, P., Cerutti, F., Dunne, P.E., Giacomin, M.: Automata for infinite argumentation structures. Artificial Intelligence 203, 104–150 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  4. Baroni, P., Giacomin, M.: Semantics of abstract argument systems. In: Rahwan, I., Simari, G.R. (eds.) Argumentation in Artificial Intelligence, pp. 25–44. Springer (2009)

    Google Scholar 

  5. Baroni, P., Giacomin, M., Guida, G.: SCC-recursiveness: A general schema for argumentation semantics. Artificial Intelligence 168(1-2), 162–210 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Baumann, R.: Context-free and context-sensitive kernels: Update and deletion equivalence in abstract argumentation. In: ECAI, pp. 63–68 (2014)

    Google Scholar 

  7. Baumann, R.: Metalogical Contributions to the Nonmonotonic Theory of Abstract Argumentation. College Publications (2014)

    Google Scholar 

  8. Baumann, R., Brewka, G.: Expanding argumentation frameworks: Enforcing and monotonicity results. In: COMMA. FAIA, vol. 216, pp. 75–86. IOS Press (2010)

    Google Scholar 

  9. Trevor, J.M.: Bench-Capon and Paul E. Dunne. Argumentation in AI and law: Editors’ introduction. Artificial Intelligence and Law 13(1), 1–8 (2005)

    Article  Google Scholar 

  10. Trevor, J.M.: Bench-Capon and Paul E. Dunne. Argumentation in artificial intelligence. Artificial Intelligence 171(10-15), 619–641 (2007)

    Article  MathSciNet  Google Scholar 

  11. Blumensath, A., Grädel, E.: Finite presentations of infinite structures: Automata and interpretations. Theory of Computing Systems 37(6), 641–674 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  12. Caminada, M.W.A.: Comparing two unique extension semantics for formal argumentation: Ideal and eager. In: BNAIC, pp. 81–87 (2007)

    Google Scholar 

  13. Martin, W.A.: Caminada and Bart Verheij. On the existence of semi-stable extensions. In: BNAIC (2010)

    Google Scholar 

  14. Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77(2), 321–357 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  15. Dvořák, W., Gaggl, S.A.: Stage semantics and the SCC-recursive schema for argumentation semantics. Journal of Logic and Computation (2014)

    Google Scholar 

  16. Grossi, D.: On the logic of argumentation theory. In: AAMAS, pp. 409–416. International Foundation for Autonomous Agents and Multiagent Systems (2010)

    Google Scholar 

  17. Halmos, P.R.: Naive Set Theory. In: Undergraduate Texts in Mathematics. Springer (1960)

    Google Scholar 

  18. Verheij, B.: Deflog: on the logical interpretation of prima facie justified assumptions. Journal of Logic and Computation 13(3), 319–346 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  19. Weydert, E.: Semi-stable extensions for infinite frameworks. In: BNAIC, pp. 336–343 (2011)

    Google Scholar 

  20. Zorn, M.: A remark on method in transfinite algebra. Bulletin of the American Mathematical Society 41, 667–670 (1935)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Institute, Leipzig University, Germany

    Ringo Baumann

  2. Department of Computer Science, University of Liverpool, UK

    Christof Spanring

  3. Institute of Information Systems, Vienna University of Technology, Austria

    Christof Spanring

Authors
  1. Ringo Baumann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christof Spanring
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informationssysteme, Technische Universität Wien, 184/3, Abteilung für wissensbasierte Systeme, Favoritenstraße 9-11, 1040, Wien, Austria

    Thomas Eiter

  2. Institut für Informatik, Abteilung Intelligente Systeme, Universität Leipzig, PF 100920, 04009, Leipzig, Germany

    Hannes Strass

  3. Department of Computer Science, University of Kentucky, 309 Davis Marksbury Building, 329 Rose Street, 40506-0633, Lexington, KY, USA

    Mirosław Truszczyński

  4. Institut für Informationssysteme, Technische Universität Wien, 184/2, Abteilung für Datenbanken und Artificial Intelligence, Favoritenstraße 9-11, 1040, Wien, Austria

    Stefan Woltran

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Baumann, R., Spanring, C. (2015). Infinite Argumentation Frameworks. In: Eiter, T., Strass, H., Truszczyński, M., Woltran, S. (eds) Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation. Lecture Notes in Computer Science(), vol 9060. Springer, Cham. https://doi.org/10.1007/978-3-319-14726-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-14726-0_19

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-14725-3

  • Online ISBN: 978-3-319-14726-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation