Skip to main content
Log in

Argument diagram extraction from evidential Bayesian networks

  • Published:
Artificial Intelligence and Law Aims and scope Submit manuscript

Abstract

Bayesian networks (BN) and argumentation diagrams (AD) are two predominant approaches to legal evidential reasoning, that are often treated as alternatives to one another. This paper argues that they are, instead, complimentary and proposes the beginnings of a method to employ them in such a manner. The Bayesian approach tends to be used as a means to analyse the findings of forensic scientists. As such, it constitutes a means to perform evidential reasoning. The design of Bayesian networks that accurately and comprehensively represent the relationships between investigative hypotheses and evidence remains difficult and sometimes contentious, however. Argumentation diagrams are representations of reasoning, and are used as a means to scrutinise reasoning (among other applications). In evidential reasoning, they tend to be used to represent and scrutinise the way humans reason about evidence. This paper examines how argumentation diagrams can be used to scrutinise Bayesian evidential reasoning by developing a method to extract argument diagrams from BN.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

Notes

  1. For example, to derive P(c|a 1,a 2) from CPTs expressing P(A 1|C) and P(A 2|C), Bayes’ law is applied as follows:

    $$ P(c|a_1,a_2)=\frac{P(a_1|c)P(a_2|c)P(c)}{P(a_1|c)P(a_2|c)P(c)+P(a_1|\overline{c})P(a_2|\overline{c})P(\overline{c})} $$

    The values for P(a i |c) and \(P(a_i|\overline{c})\) are given by the CPTs for P(A i |C). However, the calculation of P(c) and \(P(\overline{c})\) relies on prior probabilities.

  2. In our algorithm, a path from V 1 to V 2 to V 3 via edges \(V_1 \rightarrow V_2\) and \(V_2 \rightarrow V_3\) is denoted \(V_1 \rightarrow V_2 \rightarrow V_3\).

References

  • Aitken C, Taroni F, Garbolino P (2003) A graphical model for the evaluation of cross-transfer evidence in DNA profiles. Theor Popul Biol 63:179–190

    Article  MATH  Google Scholar 

  • Bench-Capon T, Dunne P (2007) Argumentation in artificial intelligence. Artif Intell 171(10–15):619–641

    Article  MathSciNet  MATH  Google Scholar 

  • Bex F, van Koppen P, Prakken H, Verheij B (2010) A hybrid formal theory of arguments, stories and criminal evidence. Artif Intell Law 18(2):123–152

    Article  Google Scholar 

  • Biedermann A, Taroni F, Delemont O, Semadeni C, Davison A (2005) The evaluation of evidence in the forensic investigation of fire incidents. part ii. practical examples of the use of bayesian networks. Forensic Sci Int 147:59–69

    Article  Google Scholar 

  • Buckleton J, Triggs C, Champod C (2006) An extended likelihood ratio framework for interpreting evidence. Sci Justice 46(2):69–78

    Article  Google Scholar 

  • Condliffe P, Abrahams B, Zeleznikow J (2010) An OWL ontology and bayesian network to suport legal reasoning in the owners corporation domain. In: Proceedings of the 6th international workshop on online dispute resolution. pp 51–62

  • Conway D (1991) On the distinction between convergent and linked arguments. Informal Log 13(3):145–158

    MathSciNet  Google Scholar 

  • Cook R, Evett I, Jackson G, Jones P, Lambert J (1998) A model for case assessment and interpretation. Sci Justice 38(6):151–156

    Article  Google Scholar 

  • Corfield D, Williamson J (2001) Foundations of Bayesianism. Springer, Berlin

    MATH  Google Scholar 

  • Davis G (2003) Bayesian reconstruction of traffic accidents. Law Probab Risk 2:69–89

    Article  Google Scholar 

  • Dawid A, Mortera J, Vicard P (2007) Object-oriented bayesian networks for complex forensic DNA profiling problems. Forensic Sci Int 169(2–3):195–205

    Article  Google Scholar 

  • de Campos L, Gámez J, Moral S (2001) Simplifying explanations in bayesian belief networks. Int J Uncertain Fuzziness Knowl Based Syst 9(4):461–489

    Article  MATH  Google Scholar 

  • Druzdzel M, van der Gaag L (2000) Building probabilistic networks: where do the numbers come from?. IEEE Trans Knowl Data Eng 12(4):481–486

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Evett I, Jackson G, Lambert J, McCrossan S (2000) The impact of the principles of evidence interpretation on the structure and content of statements. Sci Justice 40(4):233–239

    Article  Google Scholar 

  • Gordon T, Prakken H, Walton D (2007) The carneades model of argument and burden of proof. Artif Intell 171(10–15):875–896

    Article  MathSciNet  MATH  Google Scholar 

  • Governatori G, Maher M, Antoniou G, Billington D (2004) Argumentation semantics for defeasible logic. J Log Comput 14(5):675–702

    Article  MathSciNet  MATH  Google Scholar 

  • Grabmair M, Gordon T, Walton D (2010) Probabilistic semantics for the carneades argument model using bayesian networks. In: Proceedings of the international conference on computational models of argument. IOS Press, Amsterdam, pp 255–266

  • Green N (2011) Causal argumentation schemes to support sense-making in clinical genetics and law. In: Proceedings of the 13th international conference on artificial intelligence and law. pp 56–60

  • Halpern J (2003) Reasoning about uncertainty. MIT Press, Cambridge, MA

    MATH  Google Scholar 

  • Hepler A, Dawid P, Leucari V (2007) Object-oriented graphical representations of complex patterns of evidence. Law Probab Risk 6(1–4):275–293

    Article  Google Scholar 

  • Keppens J (2007) Towards qualitative approaches to bayesian evidential reasoning. In: Proceedings of the 11th international conference on artificial intelligence and law. pp 17–25

  • Keppens J, Schafer B (2006) Knowledge based crime scenario modelling. Expert Syst Appl 30(2):203–222

    Article  Google Scholar 

  • Keppens J, Shen Q, Schafer B (2005) Probabilistic abductive computation of evidence collection strategies in crime investigation. In: Proceedings of the 10th international conference on artificial intelligence and law. pp 215–224

  • Keppens J, Shen Q, Price C (2011) Compositional bayesian modelling for computation of evidence collection strategies. Appl Intell 35(1):134–161

    Article  Google Scholar 

  • Koller D, Pfeffer A (1997) Object-oriented bayesian networks. In: Proceedings of the 13th annual conference on uncertainty in artificial intelligence. pp 302–313

  • Lacave C, Díez F (2002) A review of explanation methods for Bayesian networks. Knowl Eng Rev 17(2):107–127

    Article  Google Scholar 

  • Lacave C, Atienza R, Díez F (2000) Graphical explanation in bayesian networks. In: Proceedings 1st international symposium on medical data analysis. pp 122–129

  • Laronge J (2009) A generalizable argument structure using defeasible class-inclusion transitivity for evaluating evidentiary probabive relevancy in litigation. J Log Comput. doi:10.1093/logcom/exp066

  • Mortera J, Dawid A, Lauritzen S (2003) Probabilistic expert systems for dna mixture profiling. Theor Popul Biol 63:191–205

    Article  MATH  Google Scholar 

  • Parsons S (1997) Qualitative and quantitative practical reasoning, lecture notes in computer science, vol. 1244, chap. Normative argumentation and qualitative probability. Springer, Berlin, pp 466–480

  • Pearl J (1988) Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, Los Altos, CA

    Google Scholar 

  • Prakken H, Reed C, Walton D (2005) Dialogues about the burden of proof. In: Proceedings of the 10th international conference on artificial intelligence and law. pp 115–124

  • Reed C, Walton D, Macagno F (2007) Argument diagramming in logic, law and artificial intelligence. Knowl Eng Rev 22:87–109

    Article  Google Scholar 

  • Schum D (1994) The evidential foundations of probabilistic reasoning. Northwestern University Press, Evanston, IL

    Google Scholar 

  • Shimony S (1991) A probabilistic framework for explanation. PhD thesis, Brown University, Department of Computer Science

  • Suermondt H (1992) Explanation in bayesian belief networks. PhD thesis, Stanford University, Department of Computer Science

  • Thomas S (1986) Practical reasoning in natural language. Prentice-Hall, Englewood, NJ

    Google Scholar 

  • Toulmin S (1958) The uses of argument. Cambridge University Press, Cambridge

    Google Scholar 

  • Walton D (2005) Argumentation methods for artificial intelligence in law. Springer, Berlin

    Google Scholar 

  • Wellman M, Henrion M (1993) Explaining "explaining away". IEEE Trans Pattern Anal Mach Intell 15:287–291

    Article  Google Scholar 

  • Wigmore J (1913) The principles of judicial proof. Little, Brown and Company, Boston, NY

    Google Scholar 

  • Yanal R (1991) Dependent and independent reasons. Informal Log 13(3):137–144

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jeroen Keppens.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Keppens, J. Argument diagram extraction from evidential Bayesian networks. Artif Intell Law 20, 109–143 (2012). https://doi.org/10.1007/s10506-012-9121-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10506-012-9121-z

Keywords

Navigation