Skip to main content

Ranking-Based Semantics for Argumentation Frameworks

  • Conference paper
Scalable Uncertainty Management (SUM 2013)

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

Included in the following conference series:

Abstract

An argumentation system consists of a set of interacting arguments and a semantics for evaluating them. This paper proposes a new family of semantics which rank-orders arguments from the most acceptable to the weakest one(s). The new semantics enjoy two other main features: i) an attack weakens its target but does not kill it, ii) the number of attackers has a great impact on the acceptability of an argument. We start by proposing a set of rational postulates that such semantics could satisfy, then construct various semantics that enjoy them.

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. Amgoud, L., Vesic, S.: A new approach for preference-based argumentation frameworks. Annals of Mathematics and Artificial Intelligence 63(2), 149–183 (2011)

    Article  MathSciNet  Google Scholar 

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

  3. Baroni, P., Giacomin, M., Guida, G.: Scc-recursiveness: a general schema for argumentation semantics. Artificial Intelligence Journal 168, 162–210 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cayrol, C., Lagasquie-Schiex, M.-C.: Graduality in Argumentation. Journal of Artificial Intelligence Research (JAIR) 23, 245–297 (2005)

    MathSciNet  MATH  Google Scholar 

  5. Dung, P., Mancarella, P., Toni, F.: Computing ideal skeptical argumentation. Artificial Intelligence Journal 171, 642–674 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dung, P.M.: On the Acceptability of Arguments and its Fundamental Role in Non-Monotonic Reasoning, Logic Programming and n-Person Games. AIJ 77, 321–357 (1995)

    MathSciNet  MATH  Google Scholar 

  7. Dunne, P.E., Hunter, A., McBurney, P., Parsons, S., Wooldridge, M.: Weighted argument systems: Basic definitions, algorithms, and complexity results. Artificial Intelligence 175(2), 457–486 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. García, A., Simari, G.: Defeasible logic programming: an argumentative approach. Theory and Practice of Logic Programming 4(1-2), 95–138 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Amgoud, L., Ben-Naim, J. (2013). Ranking-Based Semantics for Argumentation Frameworks. In: Liu, W., Subrahmanian, V.S., Wijsen, J. (eds) Scalable Uncertainty Management. SUM 2013. Lecture Notes in Computer Science(), vol 8078. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40381-1_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40381-1_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40380-4

  • Online ISBN: 978-3-642-40381-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics