Skip to main content

On the Maximal and Average Numbers of Stable Extensions

  • Conference paper
Theory and Applications of Formal Argumentation (TAFA 2013)

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

Abstract

We present an analytical and empirical study of the maximal and average numbers of stable extensions in abstract argumentation frameworks. As one of the analytical main results, we prove a tight upper bound on the maximal number of stable extensions that depends only on the number of arguments in the framework. More interestingly, our empirical results indicate that the distribution of stable extensions as a function of the number of attacks in the framework seems to follow a universal pattern that is independent of the number of arguments.

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

Access this chapter

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. Dung, P.M.: On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games. Artificial Intelligence 77, 321–358 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  2. Baroni, P., Dunne, P.E., Giacomin, M.: On extension counting problems in argumentation frameworks. In: Proceedings of COMMA, pp. 63–74 (2010)

    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  MATH  MathSciNet  Google Scholar 

  4. Sperner, E.: Ein Satz über Untermengen einer endlichen Menge. Mathematische Zeitschrift 27(1), 544–548 (1928)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Wood, D.: On the number of maximal independent sets in a graph. Discrete Mathematics & Theoretical Computer Science 13(3), 17–20 (2011)

    MathSciNet  Google Scholar 

  7. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Schneider, M.: Potassco: The Potsdam Answer Set Solving Collection. AI Communications 24(2), 105–124 (2011), http://potassco.sourceforge.net

    MathSciNet  Google Scholar 

  8. Dunne, P.E., Dvořák, W., Linsbichler, T., Woltran, S.: Characteristics of multiple viewpoints in abstract argumentation. In: Proceedings of the Fourth Workshop on Dynamics of Knowledge and Belief, DKB 2013 (2013)

    Google Scholar 

  9. Modgil, S., Toni, F., Bex, F., Bratko, I., Chesñevar, C., Dvořák, W., Falappa, M., Fan, X., Gaggl, S.A., García, A.J., González, M.P., Gordon, T.F., Leite, J., Možina, M., Reed, C., Simari, G.R., Szeider, S., Torroni, P., Woltran, S.: The Added Value of Argumentation. In: Ossowski, S. (ed.) Agreement Technologies. Law, Governance and Technology Series, vol. 8, pp. 357–403. Springer, Netherlands (2013)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baumann, R., Strass, H. (2014). On the Maximal and Average Numbers of Stable Extensions. In: Black, E., Modgil, S., Oren, N. (eds) Theory and Applications of Formal Argumentation. TAFA 2013. Lecture Notes in Computer Science(), vol 8306. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54373-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54373-9_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54372-2

  • Online ISBN: 978-3-642-54373-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics