Advertisement

Dialectical Proof Procedures for Probabilistic Abstract Argumentation

  • Phan Minh ThangEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

Logic Programming Dispute Resolution Normative Reasoning Proof Theory Abstract Argumentation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. Baral, C., Gelfond, M., Rushton, N.: Probabilistic reasoning with answer sets. Theor. Pract. Logic Program. 9(1), 57–144 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 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
  3. 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)MathSciNetzbMATHGoogle Scholar
  4. 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
  5. Hunter, A.: A probabilistic approach to modelling uncertain logical arguments. Int. J. Approximate Reasoning 54(1), 47–81 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  6. Hunter, A.: Probabilistic qualification of attack in abstract argumentation. Int. J. Approximate Reasoning 55, 607–638 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  7. Hunter, A., Thimm, M.: Probabilistic argument graphs for argumentation lotteries. In: Computational Models of Argument (COMMA 2014). IOS Press (2014)Google Scholar
  8. 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
  9. 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
  10. Poole, D.: Abducing through negation as failure, stable models within independent choice logic. J. Logic Program. 44(1–3), 5–35 (1998)MathSciNetzbMATHGoogle Scholar
  11. 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
  12. 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)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.BUUIC CollegeBurapha UniversityChon BuriThailand

Personalised recommendations