Skip to main content
SpringerLink
Log in

A Formal Characterization of the Outcomes of Rule-Based Argumentation Systems

  • 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

Rule-based argumentation systems are developed for reasoning about defeasible information. As a major feature, their logical language distinguishes between strict rules and defeasible ones. This paper presents the first study on the outcomes of such systems under various semantics such as naive, stable, preferred, ideal and grounded. For each of these semantics, it characterizes both the extensions and the set of plausible inferences drawn by these systems under a few intuitive postulates.

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 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., Besnard, P.: Logical limits of abstract argumentation frameworks. Journal of Applied Non-Classical Logics (2013)

    Google Scholar 

  2. Amgoud, L., Cayrol, C.: Inferring from inconsistency in preference-based argumentation frameworks. Inter. J. of Automated Reasoning 29(2), 125–169 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Caminada, M., Amgoud, L.: On the evaluation of argumentation formalisms. Artificial Intelligence J. 171(5-6), 286–310 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Dung, P.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. AI. J. 77(2), 321–357 (1995)

    MathSciNet  MATH  Google Scholar 

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

  6. Gorogiannis, N., Hunter, A.: Instantiating abstract argumentation with classical logic arguments: Postulates and properties. Artificial Intelligence J. 175(9-10), 1479–1497 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Governatori, G., Maher, M., Antoniou, G., Billington, D.: Argumentation semantics for defeasible logic. J. of Logic and Computation 14(5), 675–702 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  8. Marek, V., Nerode, A., Remmel, J.: A theory of nonmonotonic rule systems I. Annals of Mathematics and Artificial Intelligence 1, 241–273 (1990)

    Article  MATH  Google Scholar 

  9. Reiter, R.: A logic for default reasoning. Artificial Intelligence J. 13(1-2), 81–132 (1980)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRIT – CNRS, 118, route de Narbonne, 31062, Toulouse Cedex 09, France

    Leila Amgoud & Philippe Besnard

Authors
  1. Leila Amgoud
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Besnard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electronics, Electrical Engineering and Computer Science, Queen’s University Belfast, BT9 5BN, Belfast, UK

    Weiru Liu

  2. Department of Computer Science, University of Maryland, 20742, College Park, MD, USA

    V. S. Subrahmanian

  3. Département d’Informatique, Université de Mons, 7000, Mons, Belgium

    Jef Wijsen

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Amgoud, L., Besnard, P. (2013). A Formal Characterization of the Outcomes of Rule-Based Argumentation Systems. 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_7

Download citation

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

  • 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

Search

Navigation