Skip to main content

Splitting Argumentation Frameworks: An Empirical Evaluation

  • Conference paper

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

Abstract

In a recent paper Baumann [1] has shown that splitting results, similar to those known for logic programs under answer set semantics and default logic, can also be obtained for Dung argumentation frameworks (AFs). Under certain conditions a given AF A can be split into subparts A 1 and A 2 such that extensions of A can be computed by (1) computing an extension E 1 of A 1, (2) modifying A 2 based on E 1, and (3) combining E 1 and an extension E 2 of the modified variant of A 2. In this paper we perform a systematic empirical evaluation of the effects of splitting on the computation of extensions. Our study shows that the performance of algorithms may drastically improve when splitting is applied.

Keywords

  • Empirical Evaluation
  • Average Runtime
  • Argumentation Framework
  • Default Theory
  • Labelling Algorithm

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    CrossRef  Google Scholar 

  2. 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)

    CrossRef  Google Scholar 

  3. Dung, P.M.: 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)

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Lifschitz, V., Turner, H.: Splitting a logic program. In: ICLP, pp. 23–37 (1994)

    Google Scholar 

  5. Modgil, S., Caminada, M.: Proof theories and algorithms for abstract argumentation frameworks. In: Rahwan, I., Simari, G.R. (eds.) Argumentation in Artificial Intelligence, pp. 105–132. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  6. Prakken, H.: An abstract framework for argumentation with structured arguments. Argument and Computation 1, 93–124 (2010)

    CrossRef  Google Scholar 

  7. Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146–160 (1972)

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Turner, H.: Splitting a default theory. In: Proc. AAAI 1996, pp. 645–651 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baumann, R., Brewka, G., Wong, R. (2012). Splitting Argumentation Frameworks: An Empirical Evaluation. In: Modgil, S., Oren, N., Toni, F. (eds) Theorie and Applications of Formal Argumentation. TAFA 2011. Lecture Notes in Computer Science(), vol 7132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29184-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29184-5_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29183-8

  • Online ISBN: 978-3-642-29184-5

  • eBook Packages: Computer ScienceComputer Science (R0)