Skip to main content
SpringerLink
Log in

Splitting Argumentation Frameworks: An Empirical Evaluation

  • Conference paper
Book cover Theorie and Applications of Formal Argumentation (TAFA 2011)

Part of the book series: Lecture Notes in Computer Science ((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.

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

  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)

    Chapter  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)

    Article  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)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

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

    Article  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

  1. Universität Leipzig, Johannisgasse 26, 04103, Leipzig, Germany

    Ringo Baumann, Gerhard Brewka & Renata Wong

Authors
  1. Ringo Baumann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerhard Brewka
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Renata Wong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. King’s College London, Strand, WC2R 2LS, London, UK

    Sanjay Modgil

  2. University of Aberdeen, AB24 3UE, Aberdeen, Scotland, UK

    Nir Oren

  3. Department of Computing, Imperial College London, South Kensington Campus, SW7 2AZ, London, UK

    Francesca Toni

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)

Publish with us

Policies and ethics

Search

Navigation