Skip to main content
SpringerLink
Log in

Dialectical Proof Procedures for Probabilistic Abstract Argumentation

  • Conference paper
  • First Online:
PRIMA 2016: Principles and Practice of Multi-Agent Systems (PRIMA 2016)

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

Abstract

A dialectical proof procedure for computing grounded semantics of probabilistic abstract argumentation is presented based on the notion of probabilistic dispute tree. We also present an algorithm for top-down construction of probabilistic dispute trees.

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 EPUB and 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

References

  • Baral, C., Gelfond, M., Rushton, N.: Probabilistic reasoning with answer sets. Theor. Pract. Logic Program. 9(1), 57–144 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  • Doder, D., Woltran, S.: Probabilistic argumentation frameworks – a logical approach. In: Straccia, U., Calì, A. (eds.) SUM 2014. LNCS, vol. 8720, pp. 134–147. Springer, Heidelberg (2014)

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  • Dung, P.M., Thang, P.M.: Towards (probabilistic) argumentation for jury-based dispute resolution. In: Proceedings of COMMA, pp. 171–182. IOS Press (2010)

    Google Scholar 

  • Hunter, A.: A probabilistic approach to modelling uncertain logical arguments. Int. J. Approximate Reasoning 54(1), 47–81 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  • Hunter, A.: Probabilistic qualification of attack in abstract argumentation. Int. J. Approximate Reasoning 55, 607–638 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  • Hunter, A., Thimm, M.: Probabilistic argument graphs for argumentation lotteries. In: Computational Models of Argument (COMMA 2014). IOS Press (2014)

    Google Scholar 

  • Li, H., Oren, N., Norman, T.: Probabilistic argumentation frameworks. In: Proceedings of the First International Workshop on Theory and Applications of Formal Argumentation (TAFA11) (2011)

    Google Scholar 

  • Polberg, S., Doder, D.: Probabilistic abstract dialectical frameworks. In: Fermé, E., Leite, J. (eds.) JELIA 2014. LNCS, vol. 8761, pp. 591–599. Springer, Heidelberg (2014)

    Google Scholar 

  • Poole, D.: Abducing through negation as failure, stable models within independent choice logic. J. Logic Program. 44(1–3), 5–35 (1998)

    MathSciNet  MATH  Google Scholar 

  • Riveret, R., Rotolo, N., Sartor, G., Prakken, H., Roth, B.: Success chances in argument games, a probabilistic approach to legal disputes. In: Proceedings of Jurix (2007)

    Google Scholar 

  • Thang, P.M., Dung, P.M., Hung, N.D.: Towards a common framework for dialectical proof procedure in abstaract argumentation. J. Logic Comput. 9(6), 1071–1109 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BUUIC College, Burapha University, Chon Buri, Thailand

    Phan Minh Thang

Authors
  1. Phan Minh Thang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Phan Minh Thang .

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università degli Studi di Torino , Torino, Italy

    Matteo Baldoni

  2. Computing and Communications, Lancaster University, Lancaster, United Kingdom

    Amit K. Chopra

  3. Department of Computer Science, New Mexico State University, Las Cruces, New Mexico, USA

    Tran Cao Son

  4. Graduate School of Maritime Sciences, Kobe University, Kobe, Japan

    Katsutoshi Hirayama

  5. Dept. di Informatica: Sci. e Ingegneria, Universitá di Bologna, Bologna, Italy

    Paolo Torroni

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Thang, P.M. (2016). Dialectical Proof Procedures for Probabilistic Abstract Argumentation. In: Baldoni, M., Chopra, A., Son, T., Hirayama, K., Torroni, P. (eds) PRIMA 2016: Principles and Practice of Multi-Agent Systems. PRIMA 2016. Lecture Notes in Computer Science(), vol 9862. Springer, Cham. https://doi.org/10.1007/978-3-319-44832-9_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44832-9_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44831-2

  • Online ISBN: 978-3-319-44832-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation