Skip to main content
SpringerLink
Log in

On the Complexity of Computing the Justification Status of an Argument

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

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

Abstract

We address the problem of determining the acceptance status of an argument w.r.t. labeling-based semantics. Wu and Caminada recently proposed a labeling-based justification status of arguments to distinguish different levels of acceptability for arguments. We generalize their approach, which was originally restricted to complete semantics, to arbitrary argumentation semantics and provide a comprehensive study of the computational properties.

This work was supported by the Vienna Science and Technology Fund (WWTF) under grant ICT08-028.

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. Baroni, P., Dunne, P.E., Giacomin, M.: On the resolution-based family of abstract argumentation semantics and its grounded instance. Artif. Intell. 175(3-4), 791–813 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  2. Baroni, P., Giacomin, M.: Comparing Argumentation Semantics with Respect to Skepticism. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol. 4724, pp. 210–221. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Baroni, P., Giacomin, M.: Semantics of abstract argument systems. In: Argumentation in Artificial Intelligence, pp. 25–44. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Caminada, M.: Semi-stable semantics. In: Proc. COMMA 2006, pp. 121–130 (2006)

    Google Scholar 

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

  6. Caminada, M.: Comparing two unique extension semantics for formal argumentation: ideal and eager. In: Proc. BNAIC 2007, pp. 81–87 (2007)

    Google Scholar 

  7. Caminada, M.: A labelling approach for ideal and stage semantics. Argument & Computation 2, 1–21 (2011)

    Article  Google Scholar 

  8. Caminada, M., Gabbay, D.M.: A logical account of formal argumentation. Studia Logica 93(2), 109–145 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Caminada, M., Pigozzi, G.: On judgment aggregation in abstract argumentation. Autonomous Agents and Multi-Agent Systems 22(1), 64–102 (2011)

    Article  Google Scholar 

  10. Coste-Marquis, S., Devred, C., Marquis, P.: Symmetric Argumentation Frameworks. In: Godo, L. (ed.) ECSQARU 2005. LNCS (LNAI), vol. 3571, pp. 317–328. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Dimopoulos, Y., Torres, A.: Graph theoretical structures in logic programs and default theories. Theor. Comput. Sci. 170(1-2), 209–244 (1996)

    MathSciNet  MATH  Google Scholar 

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

  13. Dung, P.M., Mancarella, P., Toni, F.: Computing ideal sceptical argumentation. Artif. Intell. 171(10-15), 642–674 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  14. Dunne, P.E.: Computational properties of argument systems satisfying graph-theoretic constraints. Artif. Intell. 171(10-15), 701–729 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  15. Dunne, P.E., Bench-Capon, T.J.M.: Coherence in finite argument systems. Artif. Intell. 141(1/2), 187–203 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  16. Dunne, P.E., Caminada, M.: Computational Complexity of Semi-Stable Semantics in Abstract Argumentation Frameworks. In: Hölldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol. 5293, pp. 153–165. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  17. Dunne, P.E., Wooldridge, M.: Complexity of abstract argumentation. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence, pp. 85–104. Springer, US (2009)

    Chapter  Google Scholar 

  18. Dvořák, W., Dunne, P.E., Woltran, S.: Parametric Properties of Ideal Semantics. In: Proc. IJCAI 2011, pp. 851–856 (2011)

    Google Scholar 

  19. Dvořák, W., Woltran, S.: Complexity of semi-stable and stage semantics in argumentation frameworks. Inf. Process. Lett. 110(11), 425–430 (2010)

    Article  MATH  Google Scholar 

  20. Dvořák, W., Woltran, S.: On the intertranslatability of argumentation semantics. J. Artif. Intell. Res. 41, 445–475 (2011)

    MATH  Google Scholar 

  21. Verheij, B.: Two approaches to dialectical argumentation: admissible sets and argumentation stages. In: Proc. NAIC 1996, pp. 357–368 (1996)

    Google Scholar 

  22. Verheij, B.: A Labeling Approach to the Computation of Credulous Acceptance in Argumentation. In: Proc. IJCAI 2007, pp. 623–628 (2007)

    Google Scholar 

  23. Wu, Y., Caminada, M.: A labelling-based justification status of arguments. Studies in Logic 3(4), 12–29 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Information Systems 184/2, Technische Universität Wien, Favoritenstrasse 9-11, 1040, Vienna, Austria

    Wolfgang Dvořák

Authors
  1. Wolfgang Dvořák
    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

Dvořák, W. (2012). On the Complexity of Computing the Justification Status of an Argument. 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_3

Download citation

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

  • 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