Skip to main content
SpringerLink
Log in

Open Problems in Abstract Argumentation

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

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

  • 967 Accesses

Abstract

We give a list of currently unsolved problems in abstract argumentation. For each of the problems, we motivate why it is interesting and what makes it (apparently) hard to solve.

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. Baroni, P., Caminada, M., Giacomin, M.: An introduction to argumentation semantics. Knowledge Engineering Review 26(4), 365–410 (2011)

    Article  Google Scholar 

  2. Baroni, P., Dunne, P.E., Giacomin, M.: On the resolution-based family of abstract argumentation semantics and its grounded instance. Artificial Intelligence 175(3), 791–813 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Baroni, P., Giacomin, M.: On principle-based evaluation of extension-based argumentation semantics. Artificial Intelligence 171(10-15), 675–700 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. 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 

  5. Baumann, R.: Splitting an argumentation framework. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 40–53. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Baumann, R.: Normal and strong expansion equivalence for argumentation frameworks. Artificial Intelligence 193, 18–44 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Baumann, R.: What does it take to enforce an argument? Minimal change in abstract argumentation. In: ECAI, pp. 127–132 (2012)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  11. Baumann, R., Brewka, G.: Spectra in abstract argumentation: An analysis of minimal change. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 174–186. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  12. Baumann, R., Brewka, G.: The equivalence zoo for dung-style semantics. Journal of Logic and Computation: Special Issue (2014)

    Google Scholar 

  13. Baumann, R., Dvořák, W., Linsbichler, T., Strass, H., Woltran, S.: Compact Argumentation Frameworks. In: ECAI, pp. 69–74 (2014)

    Google Scholar 

  14. Baumann, R., Strass, H.: On the Maximal and Average Numbers of Stable Extensions. In: Black, E., Modgil, S., Oren, N. (eds.) TAFA 2013. LNCS, vol. 8306, pp. 111–126. Springer, Heidelberg (2014)

    Google Scholar 

  15. Baumann, R., Woltran, S.: The role of self-attacking arguments in characterizations of equivalence notions. Journal of Logic and Computation: Special Issue (2014)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  17. Bisquert, P., Cayrol, C., de Saint-Cyr, F.D., Lagasquie-Schiex, M.-C.: Change in argumentation systems: Exploring the interest of removing an argument. In: Benferhat, S., Grant, J. (eds.) SUM 2011. LNCS, vol. 6929, pp. 275–288. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  18. Boella, G., Kaci, S., van der Torre, L.W.N.: Dynamics in argumentation with single extensions: Abstraction principles and the grounded extension. In: ECSQARU, pp. 107–118 (2009)

    Google Scholar 

  19. Cayrol, C., de Saint-Cyr, F.D., Lagasquie-Schiex, M.-C.: Change in abstract argumentation frameworks: Adding an argument. Journal of Artificial Intelligence Research, 49–84 (2010)

    Google Scholar 

  20. 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 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  21. Dung, P.M., Mancarella, P., Toni, F.: Computing ideal sceptical argumentation. Artificial Intelligence 171(10), 642–674 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  22. Dunne, P.E.: The computational complexity of ideal semantics. Artificial Intelligence 173(18), 1559–1591 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  23. Dunne, P.E., Dvořák, W., Woltran, S.: Parametric properties of ideal semantics. Artificial Intelligence 202, 1–28 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  24. Dunne, P.E., Dvořák, W., Linsbichler, T., Woltran, S.: Characteristics of multiple viewpoints in abstract argumentation. In: Proceedings of DKB, pp. 16–30 (2013)

    Google Scholar 

  25. Dunne, P.E., Dvořák, W., Linsbichler, T., Woltran, S.: Characteristics of multiple viewpoints in abstract argumentation. In: KR, pp. 72–81 (2014)

    Google Scholar 

  26. Dvořák, W., Linsbichler, T., Oikarinen, E., Woltran, S.: Resolution-based grounded semantics revisited. In: COMMA. IOS Press (2014)

    Google Scholar 

  27. Liao, B.S., Jin, L., Koons, R.C.: Dynamics of argumentation systems: A division-based method. Artificial Intelligence, 1790–1814 (2011)

    Google Scholar 

  28. Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic, 526–541 (2001)

    Google Scholar 

  29. Moon, J.W., Moser, L.: On cliques in graphs. Israel Journal of Mathematics, 23–28 (1965)

    Google Scholar 

  30. Oikarinen, E., Woltran, S.: Characterizing strong equivalence for argumentation frameworks. Artificial Intelligence 175(14-15), 1985–2009 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  31. Papadimitriou, C.H.: Computational complexity. John Wiley and Sons Ltd (2003)

    Google Scholar 

  32. Scholz, H.: Ein ungelöstes Problem in der symbolischen Logik. Journal of Symbolic Logic 17, 160 (1952)

    Article  Google Scholar 

  33. Truszczyński, M.: Strong and uniform equivalence of nonmonotonic theories – an algebraic approach. In: Annals of Mathematics and Artificial Intelligence, pp. 245–265 (2006)

    Google Scholar 

  34. Turner, H.: Strong equivalence for causal theories. In: LPNMR, pp. 289–301 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Institute, Leipzig University, Germany

    Ringo Baumann & Hannes Strass

Authors
  1. Ringo Baumann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hannes Strass
    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., Strass, H. (2015). Open Problems in Abstract Argumentation. 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_22

Download citation

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

  • 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