Abstract
A basic form of an instantiated argument is as a pair (support, conclusion) standing for a conditional relation ‘if support then conclusion’. When this relation is not fully conclusive, a natural choice is to model the argument strength with the conditional probability of the conclusion given the support. In this paper, using a very simple language with conditionals, we explore a framework for probabilistic logic-based argumentation based on an extensive use of conditional probability, where uncertain and possibly inconsistent domain knowledge about a given scenario is represented as a set of defeasible rules quantified with conditional probabilities. We then discuss corresponding notions of attack and defeat relations between arguments, providing a basis for appropriate acceptability semantics, e.g. based on extensions or on DeLP-style dialogical trees.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Since there is no place to confusion, we will use the same symbol P to denote the probability distribution over \(\varOmega \) and its associated probability over Fm.
- 2.
According to \(\vdash \).
- 3.
Standing for factual or conditioned arguments.
References
Bamber, D., Goodman, I.R., Nguyen, H.T.: Robust reasoning with rules that have exceptions: from second-order probability to argumentation via upper envelopes of probability and possibility plus directed graphs. Ann. Math. Artif. Intell. 45, 83–171 (2005)
Bodanza, G.A., Alessio, C.A.: Rethinking specificity in defeasible reasoning and its effect in argument reinstatement. Inf. Comput. 255, 287–310 (2017)
Cerutti, F., Thimm, M.: A general approach to reasoning with probabilities. Int. J. Approximate Reasoning 111, 35–50 (2019)
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–357 (1995)
P. M. Dung and P. M. Thang. Towards probabilistic argumentation for jury-based dispute resolution. In: Baroni, P., Cerutti, F., Giacomin, M., Simari, G.R. (eds.) Proceedings of COMMA 2010, volume 216 of Frontiers in Artificial Intelligence and Applications, pp. 171–182. IOS Press Inc. (2010)
Flaminio, T., Godo, L., Hosni, H.: Boolean algebras of conditionals, probability and logic. Artif. Intell. 286, 103347 (2020)
Garcia, A., Simari, G.: Defeasible logic programming: an argumentative approach. Theory Pract. Logic Program. 4(1–2), 95–138 (2004)
Garcia, A., Simari, G.: Argumentation based on logic programming. In: Baroni, P., Gabbay, D.M., Giacomin, M., van der Torre, L. (eds.) Handbook of Formal Argumentation, pp. 409–437. College Publications (2018)
Gilio, A., Pfeifer, N., Sanfilippo, G.: Transitivity in coherence-based probability logic. J. Appl. Logic 14, 46–64 (2016)
Hunter, A.: A probabilistic approach to modelling uncertain logical arguments. Int. J. Approximate Reasoning 54(1), 47–81 (2013)
Hunter, A.: Probabilistic qualification of attack in abstract argumentation. IJAR 55(2), 607–638 (2014)
Hunter, A., Thimm, M.: On partial information and contradictions in probabilistic abstract argumentation. In: Baral, C., et al. (eds.) Proceedings of KR 2016, pp. 53–62. AAAI Press (2016)
Hunter, A., Thimm, M.: Probabilistic reasoning with abstract argumentation frameworks. J. Artif. Intell. Res. 59, 565–611 (2017)
Kern-Isberner, G. (ed.): Conditionals in Nonmonotonic Reasoning and Belief Revision. LNCS (LNAI), vol. 2087. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44600-1
Li, H., Oren, N., Norman, T.J.: Probabilistic argumentation frameworks. In: Modgil, S., Oren, N., Toni, F. (eds.) TAFA 2011. LNCS (LNAI), vol. 7132, pp. 1–16. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29184-5_1
Modgil, S., Prakken, H.: Abstract rule-based argumentation. In: Baroni, P., Gabbay, D.M., Giacomin, M., van der Torre, L. (eds.) Handbook of Formal Argumentation, pp. 409–437. College Publications (2018)
Pollock, J.L.: Justification and defeat. Artif. Intell. 67, 377–408 (1994)
Pollock, J.L.: Cognitive Carpentry. A Blueprint for How to Build a Person. MIT Press, Cambridge (1995)
Prakken, H.: Historical overview of formal argumentation. In: Baroni, P., Gabbay, D., Giacomin, M., van der Torre, L. (eds.) Handbook of Formal Argumentation, vol. 1, pp. 73–141. College Publications (2018)
Prakken, H.: Probabilistic strength of arguments with structure. In: Thielscher, M., Toni, F., Wolter, F. et al. (eds.) Proceedings of KR 2018, pp. 158–167. AAAI Press (2018)
Talbott, W.: Bayesian epistemology. In: Zalta, E.N. (eds.) The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University (2016)
Thimm, M., Kern-Isberner, G., Fisseler, J.: Relational probabilistic conditional reasoning at maximum entropy. In: Liu, W. (ed.) ECSQARU 2011. LNCS (LNAI), vol. 6717, pp. 447–458. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22152-1_38
Timmer, S., Meyer, J.J.C., Prakken, H., Renooij, S., Verheij, B.: A two-phase method for extracting explanatory arguments from Bayesian networks. Int. J. Approximate Reasoning 80, 475–494 (2017)
Toni, F.: A tutorial on assumption-based argumentation. Argument Comput. 5(1), 89–117 (2014)
Verheij, B.: Jumping to conclusions: a logico-probabilistic foundation for defeasible rule-based arguments. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS (LNAI), vol. 7519, pp. 411–423. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33353-8_32
Wilhelm, M., Kern-Isberner, G., Ecke, A.: Propositional probabilistic reasoning at maximum entropy modulo theories. In: Markov, Z., Russell, I. (eds.) Proceedings of the 29th International Florida Artificial Intelligence Research Society Conference, FLAIRS 2016, pp. 690–694. AAAI Press (2016)
Acknowledgments
The authors acknowledge partial support by the Spanish projects TIN2015-71799-C2-1-P and PID2019-111544GB-C21.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Dellunde, P., Godo, L., Vidal, A. (2021). Probabilistic Argumentation: An Approach Based on Conditional Probability –A Preliminary Report–. In: Faber, W., Friedrich, G., Gebser, M., Morak, M. (eds) Logics in Artificial Intelligence. JELIA 2021. Lecture Notes in Computer Science(), vol 12678. Springer, Cham. https://doi.org/10.1007/978-3-030-75775-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-75775-5_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-75774-8
Online ISBN: 978-3-030-75775-5
eBook Packages: Computer ScienceComputer Science (R0)