Proof with and without probabilities
 1.7k Downloads
 7 Citations
Abstract
Evidential reasoning is hard, and errors can lead to miscarriages of justice with serious consequences. Analytic methods for the correct handling of evidence come in different styles, typically focusing on one of three tools: arguments, scenarios or probabilities. Recent research used Bayesian networks for connecting arguments, scenarios, and probabilities. Wellknown issues with Bayesian networks were encountered: More numbers are needed than are available, and there is a risk of misinterpretation of the graph underlying the Bayesian network, for instance as a causal model. The formalism presented here models presumptive arguments about coherent hypotheses that are compared in terms of their strength. No choice is needed between qualitative or quantitative analytic styles, since the formalism can be interpreted with and without numbers. The formalism is applied to key concepts in argumentative, scenario and probabilistic analyses of evidential reasoning, and is illustrated with a fictional crime investigation example based on Alfred Hitchcock’s film ‘To Catch A Thief’.
Keywords
Evidential reasoning Argumentation Scenarios Probabilistic reasoning Bayesian networks Forensic science1 Introduction
Establishing what has happened in a crime is often not a simple task. Many errors can be made, with confirmation bias and statistical reasoning errors among the welldocumented sources of mistakes (cf. also Kahneman 2011). Recently the number of erroneous convictions in criminal trials in the Netherlands was estimated to be in the order of 5–10% (Derksen 2016). As a result, there is a need for analytic tools that can help prevent mistakes.
In the literature on correct evidential reasoning, three structured analytic tools are distinguished: arguments, scenarios and probabilities (Anderson et al. 2005; Dawid et al. 2011; Kaptein et al. 2009). These tools are aimed at helping organize and structure the task of evidential reasoning, thereby supporting that good conclusions are arrived at, and foreseeable mistakes are prevented.
In an argumentative analysis, a structured constellation of evidence, reasons and hypotheses is considered. Typically the evidence gives rise to reasons for and against the possible conclusions considered. An argumentative analysis helps the handling of such conflicts. The early twentieth century evidence scholar John Henry Wigmore is a pioneer of argumentative analyses; cf. his famous evidence charts (Wigmore 1913).
In a scenario analysis, different hypothetical scenarios about what has happened are considered side by side, and considered in light of the evidence. A scenario analysis helps the coherent interpretation of all evidence. Scenario analyses were the basis of legal psychology research about correct reasoning with evidence (Bennett and Feldman 1981; Pennington and Hastie 1993; Wagenaar et al. 1993).
In a probabilistic analysis, it is made explicit how the probabilities of the evidence and events are related. A probabilistic analysis emphasises the various degrees of uncertainty encountered in evidential reasoning, ranging from very uncertain to very certain. Probabilistic analyses of criminal evidence go back to early forensic science in the late nineteenth century (Taroni et al. 1998) and have become prominent by the statistics related to DNA profiling.

A method to manually design a Bayesian network incorporating hypothetical scenarios and the available evidence (Vlek 2016; Vlek et al. 2014);

A case study testing the design method (Vlek 2016; Vlek et al. 2014);

A method to generate a structured explanatory text of a Bayesian network modeled according to this method (Vlek 2016; Vlek et al. 2016);

An algorithm to extract argumentative information from a Bayesian network modeling hypotheses and evidence (Timmer 2017; Timmer et al. 2017);

A method to incorporate argument schemes in a Bayesian network (Timmer 2017; Timmer et al. 2015a).
A key issue addressed in this paper is how to find an appropriate balance between qualitative and quantitative modeling styles. Building on ideas presented semiformally by Verheij (2014b), in the present paper, a formalism is proposed in which presumptive arguments about coherent hypotheses can be compared in terms of their strengths. The formalism allows for a qualitative and a quantitative interpretation. The qualitative interpretation uses total preorders, and the quantitative interpretation probability distributions.
Key concepts used in argumentative, scenario and probabilistic analyses of reasoning with evidence are discussed in terms of the proposed formalism. The idea underlying this theoretical contribution is informally explained in the next section. The crime story of Alfred Hitchcock’s famous film ‘To Catch A Thief’, featuring Cary Grant and Grace Kelly (1955) is used as an illustration.
2 General idea
In Fig. 1, on the left, we see an argument from premises P to conclusions Q. The argument is attacked by a counterargument: the negation of Q, denoted \(\lnot Q\). The case made by the argument from P to Q is \(P \wedge Q\). By considering the argument from P to the case made \(P \wedge Q\), the argument’s presumptive character as going beyond the premises is emphasised (Fig. 1, middle). An argument from P to \(\lnot Q\) makes the case \(P \wedge \lnot Q\). The two arguments from P to \(P \wedge Q\) and to \(P \wedge \lnot Q\) are conflicting and make mutually incompatible cases. When the argument from P to \(P \wedge Q\) is stronger than the argument to \(P \wedge \lnot Q\), the conflict is resolved, and leads to the presumptive conclusion Q. The relative strength is indicated in the figure using a >sign. The relative strength of these arguments corresponds to a comparative value of the two cases \(P \wedge Q\) and \(P \wedge \lnot Q\) being made, as suggested by the size of the corresponding boxes in the figure (Fig. 1, right).
The three representations in the figure can each represent the information that Q follows presumptively from P, but not when also \(\lnot Q\). On the left, this is indicated by the argument from P to Q with counterargument \(\lnot Q\). In the middle, this is indicated by the two presumptive arguments from P making the cases \(P \wedge Q\) and \(P \wedge \lnot Q\), where the former argument is stronger. Assuming both P and \(\lnot Q\), there is no conflict of arguments. On the right, this is indicated by considering that P follows from both cases, but one has a stronger relative value. Assuming both P and \(\lnot Q\), only one of the cases remains, viz. \(P \wedge \lnot Q\). In a sense, \(P \wedge Q\) represents the normal case (given P) and \(P \wedge \lnot Q\) the exceptional one.
We discuss below that the numeric strengths s(P, Q) and \(s(P, \lnot Q)\) can be derived from a probability function \(\Pr \), by treating strengths as conditional probabilities \(\Pr (Q\,\,P)\) and \(\Pr (\lnot Q\,\,P)\). The comparison of the values of the corresponding cases \(P \wedge Q\) and \(P \wedge \lnot Q\) is equivalently derived from the comparison of \(\Pr (P \wedge Q)\) and \(\Pr (P \wedge \lnot Q)\).
3 Formalism and properties
The formalism uses a classical logical language L generated from a set of propositional constants in a standard way. We write \(\lnot \) for negation, \(\wedge \) for conjunction, \(\vee \) for disjunction, \(\leftrightarrow \) for equivalence, \(\top \) for a tautology, and \(\bot \) for a contradiction. The associated classical, deductive, monotonic consequence relation is denoted \(\models \). We assume a finitely generated language, i.e., a language generated using a finite set of propositional constants.
First we define case models, formalizing the idea of cases and their preferences. Cases in a case model must be logically consistent, mutually incompatible and different. Cases are logically consistent in the sense of the classical logical language L. Cases are mutually incompatible, in the sense that the conjunction of case sentences that are not logically equivalent, is inconsistent. Cases are different in the sense that the set of case sentences cannot contain two elements that are logically equivalent. The comparison relation must be total and transitive (hence is what is called a total preorder, commonly modeling preference relations; Roberts 1985).
Definition 1
 1.
\(\not \models \lnot \varphi \);
 2.
If \(\not \models \varphi \leftrightarrow \psi \), then \(\models \lnot (\varphi \wedge \psi )\);
 3.
If \(\models \varphi \leftrightarrow \psi \), then \(\varphi = \psi \);
 4.
\(\varphi \ge \psi \) or \(\psi \ge \varphi \) ;
 5.
If \(\varphi \ge \psi \) and \(\psi \ge \chi \), then \(\varphi \ge \chi \).
The strict weak order > standardly associated with a total preorder \(\ge \) is defined as \(\varphi > \psi \) if and only if it is not the case that \(\psi \ge \varphi \) (for \(\varphi \) and \(\psi \in C\)). When \(\varphi > \psi \), we say that \(\varphi \) is (strictly) preferred to \(\psi \). The associated equivalence relation \(\sim \) is defined as \(\varphi \sim \psi \) if and only if \(\varphi \ge \psi \) and \(\psi \ge \varphi \).
Example
Corollary 1
 1.
\((C, \ge )\) is a case model;
 2.
\(\ge \) is numerically representable, i.e., there is a real valued function v on C such that for all \(\varphi \) and \(\psi \in C\), \(\varphi \ge \psi \) if and only if \(v(\varphi ) \ge v(\psi )\).
Proof
It is a standard result in order theory that total preorders on finite (or countable) sets are the ones that are representable by a realvalued function (Roberts 1985). \(\square \)
Corollary 2
 1.
\((C, \ge )\) is a case model;
 2.
\(\ge \) is numerically representable by a probability function \(\Pr \) on the algebra generated by C such that for all \(\varphi \) and \(\psi \in C\), \(\varphi \ge \psi \) if and only if \(\Pr (\varphi ) \ge \Pr (\psi )\).
Proof
Pick a representing realvalued function v with only positive values as in the previous corollary, and (for elements of C) define the values of \(\Pr \) as those of v divided by the sum of the vvalues of all cases; then extend by summation to the algebra generated by C. When C is nonempty, \(\Pr \) is a probability function on the algebra generated by C. \(\square \)
Next we define arguments. Arguments are from premises \(\varphi \in L\) to conclusions \(\psi \in L\).
Definition 2
(Arguments) An argument is a pair \((\varphi , \psi )\) with \(\varphi \) and \(\psi \in L\). The sentence \(\varphi \) expresses the argument’s premises, the sentence \(\psi \) its conclusions, and the sentence \(\varphi \wedge \psi \) the case made by the argument. Generalizing, a sentence \(\chi \in L\) is a premise of the argument when \(\varphi \models \chi \), a conclusion when \(\psi \models \chi \), and a position in the case made by the argument when \(\varphi \wedge \psi \models \chi \). An argument \((\varphi , \psi )\) is properly presumptive when \(\varphi \not \models \psi \); otherwise nonpresumptive. An argument \((\varphi , \psi )\) is a presumption when \(\models \varphi \), i.e., when its premises are logically tautologous.
Note our use of the plural for an argument’s premises, conclusions and positions. This terminological convention can be slightly confusing initially, but has been deliberately chosen since this allows us to speak of the premises \(\texttt {p}\) and \(\lnot \texttt {q}\) and conclusions \(\texttt {r}\) and \(\lnot \texttt {s}\) of the argument \((\texttt {p} \wedge \lnot \texttt {q}, \texttt {r} \wedge \lnot \texttt {s})\). Also the convention fits our nonsyntactic definitions, where for instance an argument with premise \(\chi \) also has logically equivalent sentences such as \(\lnot \lnot \chi \) as a premise.
Note that we define presumptions as a specific kind of argument, viz. from tautologous premises, and not as propositions. We have done so in order to emphasize that accepting a presumption is an inferential step that can be defeated. In this way, presumptions differ from premises, which are the basis of possible inferences, and not themselves the result of an inferential step. An example is the presumption of innocence, which can be defeated by proof of guilt. (We formally discuss this example at the start of Sect. 4.1.)
We define three kinds of valid arguments: coherent arguments, conclusive arguments and presumptively valid arguments. A coherent argument is defined as an argument that makes a case logically implied by a case in the case model. A conclusive argument is a coherent argument, for which all cases in the case model that imply the argument’s premises also imply the conclusions.
Definition 3

\((C, \ge ) \models (\varphi , \psi )\) if and only if \(\exists \omega \in C\): \(\omega \models \varphi \wedge \psi \).

\((C, \ge ) \models \varphi \Rightarrow \psi \) if and only if \(\exists \omega \in C\): \(\omega \models \varphi \wedge \psi \) and \(\forall \omega \in C\): if \(\omega \models \varphi \), then \(\omega \models \varphi \wedge \psi \).
Example
(continued) In the case model of Fig. 3, the arguments from \(\top \) to \(\lnot P\) and to P, and from P to Q and to \(\lnot Q\) are coherent and not conclusive in the sense of this definition. Denoting the case model as \((C,\ge )\), we have \((C,\ge ) \models (\top , \lnot P)\), \((C,\ge ) \models (\top , P)\), \({(C,\ge )} \models (P, Q)\) and \((C,\ge ) \models (P, \lnot Q)\). The arguments from a case (in the case model) to itself, such as from \(\lnot P\) to \(\lnot P\), or from \(P\wedge Q\) to \(P\wedge Q\) are conclusive. The argument \((P \vee R, P)\) is also conclusive in this case model, since all \(P \vee R\)cases are Pcases. Similarly, \((P \vee R, P \vee S)\) is conclusive.
The notion of presumptive validity considered here is based on the idea that some arguments make a better case than other arguments from the same premises. More precisely, an argument is presumptively valid if there is a case in the case model implying the case made by the argument that is at least as preferred as all cases implying the premises.
Definition 4
 \((C, \ge ) \models \varphi\,\leadsto\,\psi \) if and only if \(\exists \omega \in C\):
 1.
\(\omega \models \varphi \wedge \psi \); and
 2.
\(\forall \omega ' \in C\): if \(\omega ' \models \varphi \), then \(\omega \ge \omega '\).
 1.
Example
(continued) In the case model of Fig. 3, the arguments from \(\top \) to \(\lnot P\), and from P to Q are presumptively valid in the sense of this definition. Denoting the case model as \((C,\ge )\), we have formally that \((C,\ge ) \models \top\,\leadsto\,\lnot P\) and \((C,\ge ) \models P\,\leadsto\,Q\). The coherent arguments from \(\top \) to P and from P to \(\lnot Q\) are not presumptively valid in this sense.
Corollary 3
 1.
Conclusive arguments are coherent, but there are case models with a coherent, yet inconclusive argument;
 2.
Conclusive arguments are presumptively valid, but there are case models with a presumptively valid, yet inconclusive argument;
 3.
Presumptively valid arguments are coherent, but there are case models with a coherent, yet presumptively invalid argument.
The next proposition provides key logical properties of this notion of presumptive validity. Many have been studied for nonmonotonic inference relations (Kraus et al. 1990; Makinson 1994; van Benthem 1984). Given a case model \((C, \ge )\), we write \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \) for \({(C, \ge )} \models \varphi\,\leadsto\,\psi \). We write \(C(\varphi )\) for the set \(\{\omega \in C\,\,\omega \models \varphi \}\), and refer to the elements of \(C(\varphi )\) as \(\varphi \)cases. For brevity, we abbreviate ‘presumptively valid’ to ‘valid’.
(LE), for Logical Equivalence, expresses that in a valid argument premises and conclusions can be replaced by a classical equivalent (in the sense of \(\models \)).
(Cons), for Consistency, expresses that the conclusions of presumptively valid arguments must be consistent.
(Ant), for Antecedence, expresses that when certain premises validly imply a conclusion, the case made by the argument is also validly implied by these premises.
(RW), for Right Weakening, expresses that when the premises validly imply a composite conclusion also the intermediate conclusions are validly implied.
(CCM), for Conjunctive Cautious Monotony, expresses that the case made by a valid argument is still validly implied when an intermediate conclusion is added to the argument’s premises.
(CCT), for Conjunctive Cumulative Transitivity, is a variation of the related Cumulative Transitivity property (CT, also known as Cut). (CT)—extensively studied in the literature—has \(\varphi\, {\mid\!\!\!\!\sim}\, \chi \) instead of \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \wedge \chi \) as a consequent. The variation is essential in our setting where the (And) property is absent (If \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \) and \(\varphi\, {\mid\!\!\!\!\sim}\, \chi \), then \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \wedge \chi \)). Assuming (Ant), (CCT) expresses the validity of chaining valid implication from \(\varphi \) via the case made in the first step \(\varphi \wedge \psi \) to the case made in the second step \(\varphi \wedge \psi \wedge \chi \). (See Verheij 2010, 2012, introducing (CCT).)
Proposition 1
 (LE)

If \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \), \(\models \varphi \leftrightarrow \varphi '\) and \(\models \psi \leftrightarrow \psi '\), then \(\varphi '\, {\mid\!\!\!\!\sim}\, \psi '\).
 (Cons)

\(\varphi\,{\mid\!\nsim} \, \bot \).
 (Ant)

If \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \), then \(\varphi\, {\mid\!\!\!\!\sim}\, \varphi \wedge \psi \).
 (RW)

If \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \wedge \chi \), then \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \).
 (CCM)

If \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \wedge \chi \), then \(\varphi \wedge \psi\, {\mid\!\!\!\!\sim}\, \chi \).
 (CCT)

If \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \) and \(\varphi \wedge \psi\, {\mid\!\!\!\!\sim}\, \chi \), then \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \wedge \chi \).
Proof
(LE): Direct from the definition. (Cons): Otherwise there would be an inconsistent element of C, contradicting the definition of a case model. (Ant): When \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \), there is an \(\omega \) with \(\omega \models \varphi \wedge \psi \) that is \(\ge \)maximal in \(C(\varphi )\). Then also \(\omega \models \varphi \wedge \varphi \wedge \psi \), hence \(\varphi\, {\mid\!\!\!\!\sim}\, \varphi \wedge \psi \). (RW): When \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \wedge \chi \), there is an \(\omega \in C\) with \(\omega \models \varphi \wedge \psi \wedge \chi \) that is maximal in \(C(\varphi )\). Since then also \(\omega \models \varphi \wedge \psi \), we find \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \). (CCM): By the assumption, we have an \(\omega \in C\) with \(\omega \models \varphi \wedge \psi \wedge \chi \) that is maximal in \(C(\varphi )\). Since \(C(\varphi \wedge \psi ) \subseteq C(\varphi )\), \(\omega \) is also maximal in \(C(\varphi \wedge \psi )\), and we find \(\varphi \wedge \psi\, {\mid\!\!\!\!\sim}\, \chi \). (CCT): Assuming \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \), there is an \(\omega \in C\) with \(\omega \models \varphi \wedge \psi \), maximal in \(C(\varphi )\). Assuming also \(\varphi \wedge \psi\, {\mid\!\!\!\!\sim}\, \chi \), there is an \(\omega ' \in C\) with \(\omega \models \varphi \wedge \psi \wedge \chi \), maximal in \(C(\varphi \wedge \psi )\). Since \(\omega \in C(\varphi \wedge \psi )\), we find \(\omega ' \ge \omega \). By transitivity of \(\ge \), and the maximality of \(\omega \) in \(C(\varphi )\), we therefore have that \(\omega '\) is maximal in \(C(\varphi )\). As a result, \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \wedge \chi \). \(\square \)
We say that an argument \((\varphi , \psi )\) has coherent premises when the argument \((\varphi , \varphi )\) from the premises to themselves is coherent. The following proposition provides some equivalent characterizations of coherent premises.
Proposition 2
 1.
\(\varphi\, {\mid\!\!\!\!\sim}\, \varphi \), i.e., the argument \((\varphi , \varphi )\) is presumptively valid;
 2.
\(\exists \omega \in C: \omega \models \varphi \) and \(\forall \omega ' \in C\): If \(\omega '\models \varphi \), then \(\omega \ge \omega '\);
 3.
\(\exists \omega \in C: \varphi\, {\mid\!\!\!\!\sim}\, \omega \).
 4.
\(\exists \omega \in C: \omega \models \varphi \), i.e., the argument \((\varphi , \varphi )\) is coherent.
Proof
1 and 2 are equivalent by the definition of \({\mid\!\!\!\!\sim}\). Assume 2. Then there is a \(\ge \)maximal element \(\omega \) of \(C(\varphi )\). By the definition of \({\mid\!\!\!\!\sim}\), then \(\varphi\,{\mid\!\!\!\!\sim}\, \omega \); proving 3. Assume 3. Then there is a \(\ge \)maximal element \(\omega '\) of \(C(\varphi )\) with \(\omega ' \models \varphi \wedge \omega \). For this \(\omega '\) also \(\omega ' \models \varphi \), showing 2. 4 logically follows from 2. 4 implies 2 since L is a language that generated by finitely many propositional constants. \(\square \)
Corollary 4
Let \((C, \ge )\) be a case model. Then all coherent arguments have coherent premises and all presumptively valid arguments have coherent premises.
We saw that, in the present approach, premises are coherent when they are logically implied by a case in the case model. As a result, generalisations of coherent premises are again coherent; cf. the following corollary.
Corollary 5

If \(\varphi\, {\mid\!\!\!\!\sim}\, \varphi \) and \(\varphi \models \psi \), then \(\psi\, {\mid\!\!\!\!\sim}\, \psi \).
We now consider some properties that use a subset \(L^*\) of the language L. The set \(L^*\) consists of the logical combinations of the cases of the case model using negation, conjunction and logical equivalence (cf. the algebra underlying probability functions (Roberts 1985)). \(L^*\) is the set of case expressions associated with a case model.
(Coh), for Coherence, expresses that coherent premises correspond to a consistent case expression implying the premises. (Ch), for Choice, expresses that, given two coherent case expressions, at least one of three options follows validly: the conjunction of the case expression, or the conjunction of one of them with the negation of the other. (OC), for Ordered Choice, expresses that preferred choices between case expressions are transitive. Here we say that a case expression is a preferred choice over another, when the former follows validly from the disjunction of both.
Definition 5
(Preferred cases) Let \((C, \ge )\) be a case model, \(\varphi \in L\), and \(\omega \in C\). Then \(\omega \) expresses a preferred case of \(\varphi \) if and only if \(\varphi\, {\mid\!\!\!\!\sim}\, \omega \).
Proposition 3
 (Coh)

\(\varphi\, {\mid\!\!\!\!\sim}\, \varphi \) if and only if \(\exists \varphi ^* \in L^*\) with \(\varphi ^* \not \models \bot \) and \(\varphi ^* \models \varphi \);
 (Ch)

If \(\varphi\, {\mid\!\!\!\!\sim} ^* \varphi \) and \(\psi\, {\mid\!\!\!\!\sim} ^* \psi \), then \(\varphi \vee \psi\, {\mid\!\!\!\!\sim} ^* \lnot \varphi \wedge \psi \) or
\(\varphi \vee \psi\, {\mid\!\!\!\!\sim} ^* \varphi \wedge \psi \) or \(\varphi \vee \psi\, {\mid\!\!\!\!\sim} ^* \varphi \wedge \lnot \psi \);
 (OC)

If \(\varphi \vee \psi\, {\mid\!\!\!\!\sim}^* \varphi \) and \(\psi \vee \chi\, {\mid\!\!\!\!\sim} ^* \psi \), then \(\varphi \vee \chi\, {\mid\!\!\!\!\sim} ^* \varphi \).
Proof
(Coh): By Proposition 2, \(\varphi\, {\mid\!\!\!\!\sim}\, \varphi \) if and only if there is an \(\omega \in C\) with \(\omega \models \varphi \). The property (Coh) follows since \(C \subseteq L^*\) and, for all consistent \(\varphi ^* \in L^*\), there is an \(\omega \in C\) with \(\omega \models \varphi ^*.\) (Ch): Consider sentences \(\varphi \) and \(\psi \in L^*\) with \(\varphi\, {\mid\!\!\!\!\sim} ^* \varphi \) and \(\psi\, {\mid\!\!\!\!\sim} ^* \psi \). Then, by Corollary 5, \(\varphi \vee \psi\,{\mid\!\!\!\!\sim}\, \varphi \vee \psi \). By Proposition 2, there is an \(\omega \in C\), with \(\omega \models \varphi \vee \psi \). The sentences \(\varphi \) and \(\psi \) are elements of \(L^*\), hence also the sentences \(\varphi \wedge \lnot \psi \), \(\varphi \wedge \psi \) and \(\lnot \varphi \wedge \psi \in L^*\). All are logically equivalent to disjunctions of elements of C (possibly the empty disjunction, logically equivalent to \(\bot \)). Since \(\omega \models \varphi \vee \psi \), \(\models \varphi \vee \psi \leftrightarrow (\varphi \wedge \lnot \psi ) \vee (\varphi \wedge \psi ) \vee (\lnot \varphi \wedge \psi )\), and the elements of C are mutually incompatible, we have \(\omega \models \varphi \wedge \lnot \psi \) or \(\omega \models \varphi \wedge \psi \) or \(\omega \models \lnot \varphi \wedge \psi \). By Proposition 2, it follows that \(\varphi \vee \psi\, {\mid\!\!\!\!\sim} ^* \lnot \varphi \wedge \psi \) or \(\varphi \vee \psi\, {\mid\!\!\!\!\sim} ^* \varphi \wedge \psi \) or \(\varphi \vee \psi\, {\mid\!\!\!\!\sim} ^* \varphi \wedge \lnot \psi \).
(OC): By \(\varphi \vee \psi\,{\mid\!\!\!\!\sim} ^* \varphi \), there is an \(\omega \models \varphi \) maximal in \(C(\varphi \vee \psi )\). By \(\psi \vee \chi\, {\mid\!\!\!\!\sim} ^* \psi \), there is an \(\omega ' \models \psi \) maximal in \(C(\psi \vee \chi )\). Since \(\omega \models \varphi \), \(\omega \in C(\varphi \vee \chi )\). Since \(\omega ' \models \psi \), \(\omega ' \in C(\varphi \vee \psi )\), hence \(\omega \ge \omega '\). Hence \(\omega \) is maximal in \(C(\varphi \vee \chi )\), hence \(\varphi \vee \chi\,{\mid\!\!\!\!\sim}\, \varphi \). Since \(\chi \in L^*\), \(\varphi \vee \chi\,{\mid\!\!\!\!\sim} ^* \varphi \). \(\square \)
The properties in Propositions 1 and 3 are the basis of qualitative and quantitative representation results for the inference relation \({\mid\!\!\!\!\sim} \). See Verheij (2016a), also for other formal properties of the proposal. In Sect. 4.3, we show how the probabilistic representation of case models (Corollary 2) gives rise to probabilistic representations of our three kinds of argument validity: coherence, conclusiveness, and presumptive validity.
The history of research in Artificial Intelligence that combines arguments, hypotheses and uncertainty is extensive and varied. Without claiming a representative selection, we mention a few examples in order to position the present formalism. We already mentioned the work by Kraus et al. (1990) on a preferential semantics for nonmonotonic inference. Formal differences include that the present proposal uses cases, not worlds as primitives in the semantics, and that the (And)rule (If \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \) and \(\varphi\, {\mid\!\!\!\!\sim}\, \chi \), then \(\varphi\, {\mid\!\!\!\!\sim}\, \psi \wedge \chi \).) does not hold for our notion of presumptive validity. See Verheij (2016a) for further formal information. Nonformal differences are that the present proposal is designed to be a balance between qualitative and quantitative modeling, and has been applied to the modeling of evidential reasoning (this paper) and normative reasoning (Verheij 2016c). Kohlas et al. (1998) proposes a probabilistic approach to modelbased diagnostics using arguments supporting hypotheses about the state of a system. It is discussed that numerical degrees of support can be looked at as conditional probabilities. Dung and Thang (2010) defines probabilistic adaptations of abstract and assumptionbased argumentation. Hunter (2013) studies probability distributions in the settings of abstract and logical argumentation, leading to an analysis of different kinds of inconsistency that can arise. Benferhat et al. (2000) study nonmonotonic reasoning in terms of default reasoning, building on Adams’ epsilon semantics in terms of extreme probabilities. Fagin and Halpern (1994) study reasoning about knowledge and probability, studying a language that allows for the explicit mentioning of an agent’s numeric probabilistic beliefs. Satoh (1990) studies nonmonotonic reasoning with a probabilistic semantics such that new information only leads to nonmonotonicity when it is contradicting previous information.
4 A formal analysis of some key concepts
We now use the formalism of case models and presumptive validity above for a discussion of some key concepts associated with the argumentative, scenario and probabilistic analysis of evidential reasoning.
4.1 Arguments
In an argumentative analysis, it is natural to classify arguments with respect to the nature of the support their premises give their conclusions. We already defined nonpresumptive and presumptive arguments (Definition 2), and—with respect to a case model—presumptively valid and properly defeasible arguments (Definition 4). We illustrate these notions in an example about the presumption of innocence.
Let \(\texttt {inn}\) denote that a suspect is innocent, and \(\texttt {gui}\) that he is guilty. Then the argument \((\texttt {inn}, \lnot \texttt {gui})\) is properly presumptive, since \(\texttt {inn} \not \models \lnot \texttt {gui}\). The argument \((\texttt {inn} \wedge \lnot \texttt {gui}, \lnot \texttt {gui})\) is nonpresumptive, since \(\texttt {inn} \wedge \lnot \texttt {gui} \models \lnot \texttt {gui}\).
In argumentative analyses, different kinds of argument attack are considered. John Pollock made the famous distinction between two kinds of—what he called—argument defeaters (Pollock 1987, 1995). A rebutting defeater is a reason for a conclusion that is the opposite of the conclusion of the attacked argument, whereas an undercutting defeater is a reason that attacks not the conclusion itself, but the connection between reason and conclusion. Joseph Raz made a related famous distinction of exclusionary reasons that always prevail, independent of the strength of competing reasons (Raz 1990) (see also Richardson 2013).
Unlike in the work of Pollock, in the present proposal, undercutting and rebutting attack are not treated as separate primitives. Instead they are specializations of a general idea of attack defined in terms of case models. In this connection, Fig. 1 can be confusing as the graphical representation of the argument and counterargument (in the figure on the left) suggests that \(\lnot Q\) attacks the connection between P and Q, much like an undercutter. But the attack consists in the negation of the conclusion Q of the argument from P, reminiscent of a rebutter. We show how the distinction between undercutting and rebutting attack can still be made in the present proposal.
We propose the following terminology.
Definition 6
(Defeating circumstances) Let \((C, \ge )\) be a case model, and \((\varphi , \psi )\) a presumptively valid argument. Then circumstances \(\chi \) are defeating or successfully attacking when \((\varphi \wedge \chi , \psi )\) is not presumptively valid. Defeating circumstances are rebutting when \((\varphi \wedge \chi , \lnot \psi )\) is presumptively valid; otherwise they are undercutting. Defeating circumstances are excluding when \((\varphi \wedge \chi , \psi )\) is not coherent.
Continuing the example of the case model illustrated in Fig. 4, we find the following. The circumstances \(\texttt {evi}\) defeat the presumptively valid argument \((\top , \texttt {inn})\) since \((\texttt {evi}, \texttt {inn})\) is not presumptively valid. In fact, these circumstances are excluding since \((\texttt {evi}, \texttt {inn})\) is not coherent. The circumstances are also rebutting since the argument for the opposite conclusion \((\texttt {evi}, \lnot \texttt {inn})\) is presumptively valid. Note that this example of rebutting defeat is defeat of a presumption (in the sense of Definition 2), hence can be regarded as a formalization of the idea of undermining defeat that is the basis of argumentation formalisms in which defeat is assumptionbased (Bondarenko et al. 1997; Verheij 2003). See also the discussion of arguments with prima facie assumptions by Eemeren et al. (2014).
 Case 1:

\(\texttt {sus} \wedge \lnot \texttt {mis} \wedge \texttt {wit}\)
 Case 2:

\(\texttt {mis} \wedge \texttt {wit}\)
Since Case 1 is a preferred case of \(\texttt {wit}\), the argument \((\texttt {wit}, \texttt {sus})\) is presumptively valid: the witness testimony provides a presumptively valid argument for the suspect having been at the crime scene. The argument’s conclusion can be strengthened to include that the witness was not misguided. Formally, this is expressed by saying that \((\texttt {wit}, \texttt {sus} \wedge \lnot \texttt {mis})\) is a presumptively valid argument.
When the witness was misguided after all (\(\texttt {mis}\)), there are circumstances defeating the argument \((\texttt {wit}, \texttt {sus})\). This can be seen by considering that Case 2 is the only case in which \(\texttt {wit} \wedge \texttt {mis}\) follows, hence is preferred. Since \(\texttt {sus}\) does not follow in Case 2, the argument \((\texttt {wit} \wedge \texttt {mis}, \texttt {sus})\) is not presumptively valid. The misguidedness is not rebutting, hence undercutting since \((\texttt {wit} \wedge \texttt {mis}, \lnot \texttt {sus})\) is not presumptively valid. The misguidedness is excluding since the argument \((\texttt {wit} \wedge \texttt {mis}, \texttt {sus})\) is not even coherent.
 Case 1:

\(\texttt {pun} \wedge \texttt {gui} \wedge \texttt {evi}\)
 Case 2:

\(\lnot \texttt {pun} \wedge \texttt {gui} \wedge \texttt {evi} \wedge \texttt {jus}\)
 Case 3:

\(\lnot \texttt {gui} \wedge \texttt {evi} \wedge \texttt {ali}\)
 Argument 1 (presumptively valid):

\((\texttt {evi}, \texttt {gui})\)
 Argument 2 (presumptively valid):

\((\texttt {gui}, \texttt {pun})\)
 Argument 3 (presumptively valid):

\((\texttt {evi}, \texttt {gui} \wedge \texttt {pun})\)
 Argument 4 (not presumptively valid):

\((\texttt {evi} \wedge \texttt {ali}, \texttt {gui})\)
 Argument 5 (not presumptively valid):

\((\texttt {gui} \wedge \texttt {jus}, \texttt {pun})\)
 Defeating circumstances 1 (attacking Argument 1):

\(\texttt {ali}\)
 Defeating circumstances 2 (attacking Argument 2):

\(\texttt {jus}\)
 Argument 6 (not presumptively valid):

\((\texttt {evi} \wedge \texttt {ali}, \texttt {gui} \wedge \texttt {pun})\)
 Argument 7 (not presumptively valid):

\((\texttt {evi} \wedge \texttt {jus}, \texttt {gui} \wedge \texttt {pun})\)
 Argument 8 (presumptively valid):

\((\texttt {evi} \wedge \texttt {jus}, \texttt {gui})\)
4.2 Scenarios
In the literature on scenario analyses, several notions are used in order to analyze the ‘quality’ of the scenarios considered. Three notions are prominent: a scenario’s consistency, a scenario’s plausibility and a scenario’s completeness (Pennington and Hastie 1993; Wagenaar et al. 1993). In this literature, these notions are part of an informally discussed theoretical background, having prompted work in AI & Law on formalizing these notions (Bex 2011; Verheij and Bex 2009; Vlek et al. 2015). A scenario is consistent when it does not contain contradictions. For instance, a suspect cannot be both at home and at the crime scene. A scenario is plausible when it fits commonsense knowledge about the world. For instance, in a murder scenario, a victim’s death caused by a shooting seems a plausible possibility. A scenario is complete when all relevant elements are in the scenario. For instance, a murder scenario requires a victim, an intention and premeditation. We now propose a formal treatment of these notions using the formalism presented.
The consistency of a scenario could simply be taken to correspond to logical consistency. A stronger notion of consistency uses the world knowledge represented in a case model, and emphasises the coherence of a scenario in the sense of the present formalism. In this way, we connect to the term coherence that also appears in the literature on scenariobased evidence analysis, with various connotations.
In our proposal, some coherent scenarios fit the world knowledge represented in the case model better than others, since some are presumptively valid. We can say that a scenario is plausible (given a case model) when it is a presumptively valid conclusion of the evidence. This notion of a scenario’s plausibility depends on the evidence, in contrast with the mentioned literature (Pennington and Hastie 1993; Wagenaar et al. 1993), where plausibility is treated as being independent from the evidence. The present proposal includes an evidenceindependent notion of plausibility, by considering a scenario as plausible—independent of the evidence—when it is plausible given no evidence, i.e., when the scenario is a presumptively valid presumption. In the present setting, plausibility can be connected to the preference ordering on cases given the evidence, when scenarios are complete.
In the formal proposal here, besides coherence and presumptive validity, we have encountered a third notion of validity: conclusiveness. This notion can be used to represent that there is no remaining doubt about a scenario given the knowledge in the case model: the scenario is beyond a reasonable doubt. Then the doubt that always remains is transferred to doubt about whether everything that needs to be considered is in the case model. When the case model is the result of a process of critical, careful and openminded scrutiny, and has been performed with appropriate effort, such remaining doubt could be dubbed ‘unreasonable’ (Verheij 2014b).
We summarize the discussed definitions of coherence, completeness and reasonable doubt, each in an evidenceindependent and evidencedependent variant. Sentences \(\sigma \) are intended to express scenarios, sentences \(\epsilon \) the evidence.
Definition 7
 1.
\(\sigma \) is coherent if and only if the argument \((\top ,\sigma )\) is coherent;
 2.
\(\sigma \) is plausible if and only if the argument \((\top ,\sigma )\) is presumptively valid;
 3.
\(\sigma \) is beyond a reasonable doubt if and only if the argument \((\top ,\sigma )\) is conclusive.
Definition 8
 1.
\(\sigma \) is coherent given \(\epsilon \) if and only if the argument \((\epsilon ,\sigma )\) is coherent;
 2.
\(\sigma \) is plausible given \(\epsilon \) if and only if the argument \((\epsilon ,\sigma )\) is presumptively valid;
 3.
\(\sigma \) is beyond a reasonable doubt given \(\epsilon \) if and only if the argument \((\epsilon ,\sigma )\) is conclusive.
The completeness of a scenario can here be defined using a notion of maximally specific conclusions, or extensions, as follows.
Definition 9
(Extensions) Let \((C, \ge )\) be a case model, and \((\varphi , \psi )\) a presumptively valid argument. Then the case made by the argument (i.e., \(\varphi \wedge \psi \)) is an extension of \(\varphi \) when there is no presumptively valid argument from \(\varphi \) that makes a case that is logically more specific.
For instance, consider a case model in which the case \(\texttt {vic}\wedge \texttt {int}\wedge \texttt {pre}\wedge \texttt {evi}\) is a preferred case of \(\texttt {evi}\). The case expresses a situation in which there is evidence \((\texttt {evi})\) for a typical murder: there is a victim \((\texttt {vic})\), there was the intention to kill \((\texttt {int})\), and there was premeditation \((\texttt {pre})\). In such a case model, this case is an extension of the evidence \(\texttt {evi}\). A scenario can now be considered complete with respect to certain evidence when the scenario conjoined with the evidence is its own extension. In the example, the sentence \(\texttt {vic}\wedge \texttt {int}\wedge \texttt {pre}\) is a complete scenario given \(\texttt {evi}\) as the scenario conjoined with the evidence is its own extension. The sentence \(\texttt {vic}\wedge \texttt {int}\) is not a complete scenario given \(\texttt {evi}\), as the extension of \(\texttt {vic}\wedge \texttt {int}\wedge \texttt {evi}\) also implies \(\texttt {pre}\).
Definition 10

\(\sigma \) is complete given \(\epsilon \) if and only if \(\sigma \wedge \epsilon \) is an extension of \(\epsilon \).
In the literature, scenario schemes have been used to represent a scenario’s completeness (Bex 2011; Bex and Verheij 2013; Verheij et al. 2016; Vlek et al. 2014, 2016), taking inspiration from the use of scripts in artificial intelligence and cognitive science (Schank and Abelson 1977). Here the cases in a case model are used to represent completeness.
4.3 Probabilities
In Sects. 4.1 and 4.2, we focused on arguments and scenarios, which have primarily (but not exclusively) been studied using qualitative methods. Here we show that key notions of our approach can be given a quantitative, probabilistic representation. In this way, we intend to show the balanced connection between qualitative and quantitative analytic methods.
In particular, we turn to the quantitative representation of our three notions of argument validity: coherence, conclusiveness and presumptive validity. We use the probabilistic representation of case models as in Corollary 2 (Sect. 3). The representing probability functions used there are functions on the algebra generated by C. It is convenient to extend such functions to the language L.
Definition 11
 1.
\(\Pr (\varphi ):= \sum _{\omega \in C \,{\text { and }}\, \omega \models \varphi }{Pr(\omega )}\);
 2.
\(\Pr (\psi \varphi ):= \Pr (\varphi \wedge \psi )/\Pr (\varphi )\) if \(\Pr (\varphi )> 0\).
Note that the extension \(\Pr \) to L only behaves exactly like the logical generalization of a probability function when restricted to sentences corresponding to the algebra generated by C. Consider for instance a language L generated by propositional constants p and q and case model \((\{p\}, \{(p,p)\})\) represented by \(\Pr \). Then \(\Pr (p)=1\) and \(\Pr (\lnot p)=0\), as expected in a probabilistic setting where the probabilities of complements add up to 1. However, \(\Pr (q)\) and \(\Pr (\lnot q)\) are both equal to 0.
Proposition 4
 1.
\((C, \ge ) \models (\varphi , \psi )\);
 2.
\(\Pr (\varphi \wedge \psi ) > 0\).
Proof
Immediate using the definitions. An argument \((\varphi , \psi )\) is coherent if and only if there is a case \(\omega \) in C from which \(\varphi \wedge \psi \), the case made by the argument, follows logically. And, since \(\Pr \) in Corollary 2 is positive on C, the definition of the extension of \(\Pr \) to L gives that this is the case if and only if \(\Pr (\varphi \wedge \psi ) > 0\). \(\square \)
Proposition 5
 1.
\((C, \ge ) \models \varphi \Rightarrow \psi \);
 2.
\(\Pr (\psi  \varphi ) =1\).
Proof
An argument \((\varphi , \psi )\) is conclusive if and only if it is coherent and all \(\varphi \)cases in C are also \(\varphi \wedge \psi \)cases. This is the case if and only if \(\Pr (\varphi \wedge \psi ) > 0\) and \(\Pr (\varphi \wedge \psi ) = \Pr (\varphi )\). Since \(\Pr (\varphi \wedge \psi ) > 0\) implies \(\Pr (\varphi ) > 0\), this is equivalent to \(\Pr (\psi  \varphi ) =1\). \(\square \)
Proposition 6
 1.
\((C, \ge ) \models \varphi\,\leadsto\,\psi \);
 2.\(\exists \omega \in C\):
 (a)
\(\omega \models \varphi \wedge \psi \); and
 (b)
\(\forall \omega ' \in C:\) if \(\omega ' \models \varphi \), then \(\Pr (\omega ) \ge \Pr (\omega ')\);
 (a)
 3.\(\exists \omega \in C\):
 (a)
\(\omega \models \varphi \wedge \psi \); and
 (a)
\(\forall \omega ' \in C:\) \(\Pr (\omega \,\,\varphi ) \ge \Pr (\omega '\,\,\varphi )\).
 (a)
Proof
An argument \((\varphi , \psi )\) is presumptively valid if and only there is a \(\varphi \wedge \psi \)case \(\omega \) that is \(\ge \)maximal among the \(\varphi \)cases in C. Hence the equivalence of 1 and 2. Noting that \(\omega \models \varphi \wedge \psi \) implies \(\Pr (\varphi \wedge \psi )>0\), which implies \(\Pr (\varphi )>0\), which in turn implies that \(\Pr (\omega '  \varphi )\) is defined for all \(\omega ' \in C\), we find that 2 and 3 are also equivalent.
The propositions show how the qualitatively defined notions of coherence, conclusiveness and presumptive validity have equivalent quantitative characterizations. For presumptive validity, one is in terms of the comparative value of cases, measured as a probability (part 2 of the proposition), the other in terms of the comparative strength of arguments, measured as a conditional probability (part 3 of the proposition).
 Case 1:

inn \(\wedge \) \(\lnot \) gui \(\wedge \) \(\lnot \) evi
 Case 2:

\(\lnot \) inn \(\wedge \) gui \(\wedge \) evi \(\wedge \) \(\lnot \) evi’
 Case 3:

inn \(\wedge \) \(\lnot \) gui \(\wedge \) evi \(\wedge \) \(\lnot \) evi’
 Case 4:

\(\lnot \) inn \(\wedge \) gui \(\wedge \) evi \(\wedge \) evi’

Case 1 > Case 2 > Case 3 > Case 4
 1.
The argument \((\top , \texttt {inn})\) for innocence given no evidence is coherent, presumptively valid and not conclusive;
 2.
The argument \((\top , \texttt {gui})\) for guilt given no evidence is coherent, not presumptively valid and not conclusive;
 3.
The argument \((\texttt {evi}, \texttt {inn})\) for innocence given only the first piece of evidence is coherent, not presumptively valid and not conclusive;
 4.
The argument \((\texttt {evi}, \texttt {gui})\) for guilt given only the first piece of evidence is coherent, presumptively valid and not conclusive;
 5.
The argument \((\texttt {evi} \wedge \texttt {evi'}, \texttt {inn})\) for innocence given both the first and the second piece of evidence is not coherent, not presumptively valid and not conclusive.
 6.
The argument \((\texttt {evi} \wedge \texttt {evi'}, \texttt {gui})\) for guilt given both the first and the second piece of evidence is coherent, presumptively valid and conclusive.
Coherence and conclusiveness of the example’s arguments
Argument  Coherence  Conclusiveness 

\((\top , \texttt {inn})\)  yes: \(\Pr (\texttt {inn}) > 0\)  no: \(\Pr (\texttt {inn}) < 1\) 
\((\top , \texttt {gui})\)  yes: \(\Pr (\texttt {gui}) > 0\)  no: \(\Pr (\texttt {gui}) < 1\) 
\((\texttt {evi}, \texttt {inn})\)  yes: \(\Pr (\texttt {inn}\wedge \texttt {evi}) > 0\)  no: \(\Pr (\texttt {inn}  \texttt {evi}) < 1\) 
\((\texttt {evi}, \texttt {gui})\)  yes: \(\Pr (\texttt {gui}\wedge \texttt {evi}) > 0\)  no: \(\Pr (\texttt {gui}  \texttt {evi}) < 1\) 
\((\texttt {evi} \wedge \texttt {evi'}, \texttt {inn})\)  no: \(\Pr (\texttt {inn}\wedge \texttt {evi}\wedge \texttt {evi'}) = 0\)  no: \(\Pr (\texttt {inn}\,\,\texttt {evi}\wedge \texttt {evi'}) < 1\) 
\((\texttt {evi} \wedge \texttt {evi'}, \texttt {gui})\)  yes: \(\Pr (\texttt {gui}\wedge \texttt {evi}\wedge \texttt {evi'}) > 0\)  yes: \(\Pr (\texttt {gui}\,\,\texttt {evi}\wedge \texttt {evi'}) = 1\) 
Presumptive validity of the example’s arguments
Argument  Presumptive validity 

\((\top , \texttt {inn})\)  yes: \(\Pr (\text {Case 1})> \Pr (\text {Case 2})> \Pr (\text {Case 3})> \Pr (\text {Case 4})\) 
\((\top , \texttt {gui})\)  no: \(\Pr (\text {Case 2})< \Pr (\text {Case 1}); \Pr (\text {Case 4})< \Pr (\text {Case 1})\) 
\((\texttt {evi}, \texttt {inn})\)  no: \(\Pr (\text {Case 3}\,\,\texttt {evi}) < \Pr (\text {Case 2}\,\,\texttt {evi})\) 
\((\texttt {evi}, \texttt {gui})\)  yes: \(\Pr (\text {Case 2}\,\,\texttt {evi})> \Pr (\text {Case 3}\,\,\texttt {evi})> \Pr (\text {Case 4}\,\,\texttt {evi})\) 
\((\texttt {evi} \wedge \texttt {evi'}, \texttt {inn})\)  no: The argument is not coherent 
\((\texttt {evi} \wedge \texttt {evi'}, \texttt {gui})\)  yes: \(\Pr (\text {Case 4}~~\texttt {evi} \wedge \texttt {evi'})=1\) 
5 Example: Alfred Hitchcock’s ‘To Catch A Thief’
When the police confront Robie with the new thefts, he escapes with the goal to catch the real thief. By this second evidence (esc), the hypothesis rob becomes more strongly supported than its opposite \(\lnot \) rob. In the figure, the second row indicates the situation after the two pieces of evidence are available. As indicated by the rectangles of differently sized areas, the argument from the accumulated evidence res \( {\wedge }\) esc to rob is stronger than that from the same premises to \(\lnot \) rob. Rectangles in a column in the figure represent corresponding hypotheses. Sentences shown in a corresponding hypothesis in a higher row are not repeated. So on the second row, when the evidence \(\texttt {res}\) and \(\texttt {esc}\) are taken into account, the rectangles correspond to rob (on the left) and \(\lnot \) rob (on the right).
Robie sets a trap for the real thief, resulting in a nighttime fight on the roof with Foussard who falls and dies (fgt). The police consider this strong evidence for the hypothesis that Foussard is the thief (fou), but not conclusive so also the opposite hypothesis is considered coherent (\(\lnot \) fou). In the figure (third row marked fgt) the hypothesis \(\lnot \) rob is split into two hypotheses: one rectangle representing \(\lnot \) rob \( {\wedge }\) fou, the other \(\lnot \) rob \({\wedge }\,\lnot \) fou, both in conjunction with the evidence available at this stage of the investigation (res \( {\wedge }\) esc \( {\wedge }\) fgt). With the accumulated evidence res \( {\wedge }\) esc \( {\wedge }\) fgt as premises, the hypothesis \(\lnot \) rob \( {\wedge }\) fou is more strongly supported than the hypothesis \(\lnot \) rob \({\wedge }\,\lnot \) fou. The police no longer believe that Robie is the thief. This is indicated by the line on the left of the third row in the figure. The premises res \( {\wedge }\) esc \( {\wedge }\) fgt do not provide support for the hypothesis rob; or, in the terminology of this paper: the argument from premises res \( {\wedge }\) esc \( {\wedge }\) fgt to conclusion rob is not coherent.
Robie points out that Foussard cannot be the new incarnation of ‘The Cat’, as he had a prosthetic wooden leg (pro). In other words, the argument from res \( {\wedge }\) esc \( {\wedge }\) fgt \( {\wedge }\) pro to \(\lnot \) rob \( {\wedge }\) fou is not coherent. (Cf. the second line in the fourth row of the figure, corresponding to the hypothesis that Foussard is the thief.)
Later in the film, Foussard’s daughter is caught in the act (cau), providing very strong support for the hypothesis that the daughter is the new cat (dau). The argument from res \( {\wedge }\) esc \( {\wedge }\) fgt \( {\wedge }\) pro \( {\wedge }\) cau to dau is stronger than to \(\lnot \) dau.
In her confession (con), Foussard’s daughter explains where the jewelry stolen earlier can be found, adding some specific information to the circumstances of her crimes (jwl). The argument from res \( {\wedge }\) esc \( {\wedge }\) fgt \( {\wedge }\) pro \( {\wedge }\) cau \( {\wedge }\) con to dau \( {\wedge }\) jwl is stronger than to \(\lnot \) dau \({\wedge }\,\lnot \) jwl.
The police find the jewelry at the indicated place (fin) and there is no remaining doubt about the hypothesis that Foussard’s daughter is the thief. The argument from res \( {\wedge }\) esc \( {\wedge }\) fgt \( {\wedge }\) pro \( {\wedge }\) cau \( {\wedge }\) con \( {\wedge }\) fin to \(\lnot \) dau \({\wedge }\,\lnot \) jwl is incoherent, as indicated by the line on the right of the bottom row of the figure. In the only remaining hypothesis, Foussard’s daughter is the thief, and not Robie, and not Foussard. In other words, the argument from res \( {\wedge }\) esc \( {\wedge }\) fgt \( {\wedge }\) pro \( {\wedge }\) cau \( {\wedge }\) con \( {\wedge }\) jwl to \(\lnot \) rob \({\wedge }\,\lnot \) fou \( {\wedge }\) dau is conclusive.
 Case 1:

rob
\( {\wedge }\) res \( {\wedge }\) esc
 Case 2:

\(\lnot \) rob \( {\wedge }\) fou
\( {\wedge }\) res \( {\wedge }\) esc \( {\wedge }\) fgt
 Case 3:

\(\lnot \) rob \({\wedge }\,\lnot \) fou \( {\wedge }\) dau \( {\wedge }\) jwl
\( {\wedge }\) res \( {\wedge }\) esc \( {\wedge }\) fgt \( {\wedge }\) pro \( {\wedge }\) cau \( {\wedge }\) con \( {\wedge }\) fin
 Case 4:

\(\lnot \) rob \({\wedge }\,\lnot \) fou \({\wedge }\,\lnot \) dau \({\wedge }\,\lnot \) jwl
\( {\wedge }\) res \( {\wedge }\) esc \( {\wedge }\) fgt \( {\wedge }\) pro \( {\wedge }\) cau \( {\wedge }\) con
 Case 5:

\(\lnot \) rob
\( {\wedge }\) res \({\wedge }\,\lnot \) esc
 Case 6:

\(\lnot \) rob \({\wedge }\,\lnot \) fou
\( {\wedge }\) res \( {\wedge }\) esc \({\wedge }\,\lnot \) fgt
 Case 7:

\(\lnot \) rob \({\wedge }\,\lnot \) fou \({\wedge }\,\lnot \) dau
\( {\wedge }\) res \( {\wedge }\) esc \( {\wedge }\) fgt \( {\wedge }\) pro \({\wedge }\,\lnot \) cau
 Hypothesis 1:

rob
 Hypothesis 2:

\(\lnot \) rob \( {\wedge }\) fou
 Hypothesis 3:

\(\lnot \) rob \({\wedge }\,\lnot \) fou \( {\wedge }\) dau \( {\wedge }\) jwl
 Hypothesis 4:

\(\lnot \) rob \({\wedge }\,\lnot \) fou \({\wedge }\,\lnot \) dau \({\wedge }\,\lnot \) jwl
 Evidence coherent with hypothesis 1:

res \( {\wedge }\) esc
 Evidence coherent with hypothesis 2:

res \( {\wedge }\) esc \( {\wedge }\) fgt
 Evidence coherent with hypothesis 3:

res \( {\wedge }\) esc \( {\wedge }\) fgt \( {\wedge }\) pro \( {\wedge }\) cau \( {\wedge }\) con \( {\wedge }\) fin
 Evidence coherent with hypothesis 4:

res \( {\wedge }\) esc \( {\wedge }\) fgt \( {\wedge }\) pro \( {\wedge }\) cau \( {\wedge }\) con
 1.
Cases 4 and 7;
 2.
Case 3;
 3.
Case 6;
 4.
Cases 2 and 5;
 5.
Case 1.
The discussion of the arguments, their coherence, conclusiveness and validity presented semiformally above fits this case model. For instance, the argument from the evidential premises res \( {\wedge }\) esc to the hypothesis rob is presumptively valid in this case model since Case 1 is the only case implying the case made by the argument. It is not conclusive since also the argument from these same premises to \(\lnot \) rob is coherent. The latter argument is not presumptively valid since all \(\lnot \) robcases implying the premises (Cases 2–7) have lower preference than Case 1. The argument from res \( {\wedge }\) esc \( {\wedge }\) fgt to rob is incoherent as there is no case in which the premises and the conclusion follow. Also arguments that do not start from evidential premises can be evaluated. For instance, the argument from the premise (not itself evidence) dau to jwl is conclusive since in the only case implying the premises (Case 3) the conclusion follows. Finally we find the conclusive argument from premises res \( {\wedge }\) esc \( {\wedge }\) fgt \( {\wedge }\) pro \( {\wedge }\) cau \( {\wedge }\) con \( {\wedge }\) jwl to conclusion \(\lnot \) rob \({\wedge }\,\lnot \) fou \( {\wedge }\) dau \( {\wedge }\) jwl (only Case 3 implies the premises), hence also to \(\texttt {dau}\).
6 Concluding remarks
In this paper, we have discussed correct reasoning with evidence using three analytic tools: arguments, scenarios and probabilities. We proposed a formalism in which the presumptive validity of arguments is defined in terms of case models, and studied properties (Sect. 3). In particular, we showed that the qualitative definitions of case models and presumptive validity have a quantitative representation in terms of probability functions. We discussed key concepts in the argumentative, scenario and probabilistic analysis of reasoning with evidence in terms of the formalism (Sect. 4). An example of the gradual development of evidential reasoning was provided in Sect. 5.
This work builds on a growing literature aiming to formally connect the three analytic tools of arguments, scenarios and probabilities. In a discussion of the anchored narratives theory by Crombag et al. (1993), it was shown how argumentative notions were relevant in their scenario analyses (Verheij 2000). Bex has provided a hybrid model connecting arguments and scenarios (Bex 2011; Bex et al. 2010), and has worked on the further integration of the two tools (Bex 2015; Bex and Verheij 2013). Connections between arguments and probabilities have been studied by Hepler et al. (2007) combining objectoriented modeling and Bayesian networks. Fenton et al. (2013) continued this work by developing representational idioms for the modeling of evidential reasoning in Bayesian networks. Inspired by this research, Vlek developed scenario idioms for the design of evidential Bayesian networks containing scenarios (Vlek et al. 2014), and Timmer showed how argumentative information can be extracted from a Bayesian network (Timmer et al. 2015b). Keppens and Schafer (2006) studied the knowledgebased generation of hypothetical scenarios for reasoning with evidence, later developed further in a decision support system (Shen et al. 2006).
This paper continues from an integrated perspective on arguments, scenarios and probabilities (Verheij 2014b). In the present paper, that integrated perspective is formally developed (building on ideas in Verheij 2014a) using case models and discussing key concepts used in argumentative, scenario and probabilistic analyses. Interestingly, our case models and their preferences are qualitative in nature, while the preferences correspond exactly to those that can be numerically and probabilistically realized. As such, the present formal tools combine a nonnumeric and numeric perspective (cf. the paper ‘To Catch A Thief With and Without Numbers’; Verheij 2014b). The mathematics of the formalism is studied further in Verheij (2016a) and has been applied to valueguided decision making in Verheij (2016c).
The present work does not require modeling evidential reasoning in terms of full probability functions, as is the case in Bayesian network approaches. In this way, the wellknown problem of needing to specify more numbers than are reasonably available is addressed. In fact, we have shown an approach in which the specific numbers of a quantitative representation can be abstracted to a qualitative representation. Also whereas the causal interpretation of Bayesian networks is risky (Dawid 2010), our case models come with formal definitions of arguments, their coherence, conclusiveness and presumptive validity.
From a knowledge representation perspective, one relevant question is what happens in more complex examples than the ones used here. Indeed, more realistic examples can quickly increase in complexity and may lead to more cases than can be handled. This question has not been addressed in this paper. A helpful next step could be to perform a case study of a real example, but also the formal investigation of the growth of complexity can prove fruitful.
Another knowledge representation issue is where the case models come from. In the formal proposal in this paper, the evaluation of arguments and scenarios happens against the background of a given case model. So such evaluation requires that a case model is available. No systematic approach for the development of case models is discussed in this paper. For the Bayesian network modeling of scenarios, Vlek et al. (2014) provides such a method, and Timmer et al. (2015a) discusses the inclusion of argumentation schemes and their critical questions in a Bayesian network model. These works continue from the use of building blocks and idioms for building a Bayesian network model of the evidence in a criminal case, pioneered by Hepler et al. (2007) and Fenton et al. (2013). Perhaps ideas from these systematic modeling approaches can be adapted to the present setting.
By the present and related studies, we see a gradual clarification of how arguments, scenarios and probabilities all have their specific useful place in the analysis of evidential reasoning. By explicating formal bridges between qualitative and quantitative analytic styles, we have provided an explanation why some prefer to rationally analyze proof numerically, and others nonnumerically. As a result, it seems ever less natural to choose between the three kinds of tools, and ever more so to use each of them when practically applicable.
Footnotes
Notes
Acknowledgements
This research has been performed in the context of the project ‘Designing and Understanding Forensic Bayesian networks with Arguments and Scenarios’, funded in the NWO Forensic Science program (http://www.ai.rug.nl/~verheij/nwofs/). A version of the material was presented at the ECAI 2016 Workshop on Artificial Intelligence for Justice, August 30, 2016, The Hague (Verheij 2016b). The author would like to thank the Isaac Newton Institute for Mathematical Sciences (University of Cambridge) for its hospitality during the programme ‘Probability and Statistics in Forensic Science’ which was supported by EPSRC Grant Number EP/K032208/1.
References
 Anderson T, Schum D, Twining W (2005) Analysis of evidence, 2nd edn. Cambridge University Press, CambridgeCrossRefGoogle Scholar
 Benferhat S, Saffiotti A, Smets P (2000) Belief functions and default reasoning. Artif Intell 122(1–2):1–69MathSciNetCrossRefzbMATHGoogle Scholar
 Bennett WL, Feldman MS (1981) Reconstructing reality in the courtroom. Tavistock Feldman, LondonGoogle Scholar
 Bex FJ (2011) Arguments, stories and criminal evidence: a formal hybrid theory. Springer, BerlinCrossRefGoogle Scholar
 Bex FJ (2015) An integrated theory of causal scenarios and evidential arguments. In: Proceedings of the 15th international conference on artificial intelligence and law (ICAIL 2015). ACM Press, New York, pp 13–22Google Scholar
 Bex FJ, Verheij B (2013) Legal stories and the process of proof. Artif Intell Law 21(3):253–278CrossRefGoogle Scholar
 Bex FJ, van Koppen PJ, Prakken H, Verheij B (2010) A hybrid formal theory of arguments, stories and criminal evidence. Artif Intell Law 18:1–30CrossRefGoogle Scholar
 Bondarenko A, Dung PM, Kowalski RA, Toni F (1997) An abstract, argumentationtheoretic approach to default reasoning. Artif Intell 93:63–101MathSciNetCrossRefzbMATHGoogle Scholar
 Dawid AP (2010) Beware of the DAG! In: Guyon I, Janzing D, Schölkopf B (eds) JMLR workshop and conference proceedings: volume 6. Causality: objectives and assessment (NIPS 2008 Workshop), pp 59–86. jmlr.orgGoogle Scholar
 Dawid AP, Twining W, Vasiliki M (eds) (2011) Evidence, inference and enquiry. Oxford University Press, OxfordGoogle Scholar
 Derksen T (2016) Onschuldig vast. ISVW, LeusdenGoogle Scholar
 Dung PM, Thang P (2010) Towards probabilistic argumentation for jurybased dispute resolution. In: Computational models of argument: proceedings of COMMA 2010, Desenzano del Garda, Italy, 8–10 Sept 2010. IOS Press, Amsterdam, pp 171–182Google Scholar
 Fagin R, Halpern JY (1994) Reasoning about knowledge and probability. J ACM 41(2):340–367MathSciNetCrossRefzbMATHGoogle Scholar
 Fenton NE, Neil MD, Lagnado DA (2013) A general structure for legal arguments about evidence using Bayesian networks. Cogn. Sci. 37:61–102CrossRefGoogle Scholar
 Hepler AB, Dawid AP, Leucari V (2007) Objectoriented graphical representations of complex patterns of evidence. Law Probab Risk 6(1–4):275–293CrossRefGoogle Scholar
 Hunter A (2013) A probabilistic approach to modelling uncertain logical arguments. Int J Approx Reason 54:47–81MathSciNetCrossRefzbMATHGoogle Scholar
 Kahneman D (2011) Thinking, fast and slow. Penguin, LondonGoogle Scholar
 Kaptein H, Prakken H, Verheij B (eds) (2009) Legal evidence and proof: statistics, stories, logic (applied legal philosophy series). Ashgate, FarnhamGoogle Scholar
 Keppens J, Schafer B (2006) Knowledge based crime scenario modelling. Expert Syst Appl 30(2):203–222CrossRefGoogle Scholar
 Kohlas J, Anrig B, Haenni R, Monney PA (1998) Modelbased diagnostics and probabilistic assumptionbased reasoning. Artif Intell 104(1–2):71–106MathSciNetCrossRefzbMATHGoogle Scholar
 Kraus S, Lehmann D, Magidor M (1990) Nonmonotonic reasoning, preferential models and cumulative logics. Artif Intell 44:167–207MathSciNetCrossRefzbMATHGoogle Scholar
 Makinson D (1994) General patterns in nonmonotonic reasoning. In: Gabbay DM, Hogger CJ, Robinson JA (eds) Handbook of logic in artificial intelligence and logic programming, vol 3, Nonmonotonic reasoning and uncertain reasoning. Clarendon Press, Oxford, pp 35–110Google Scholar
 Pearl J (2000/2009) Causality: models, reasoning and inference, 2nd edn. Cambridge University Press, CambridgeGoogle Scholar
 Pennington N, Hastie R (1993) Reasoning in explanationbased decision making. Cognition 49(1–2):123–163CrossRefGoogle Scholar
 Pollock JL (1987) Defeasible reasoning. Cogn Sci 11(4):481–518CrossRefGoogle Scholar
 Pollock JL (1995) Cognitive carpentry: a blueprint for how to build a person. The MIT Press, Cambridge, MAGoogle Scholar
 Raz J (1990) Practical reason and norms. Princeton University Press, PrincetonGoogle Scholar
 Richardson HS (2013) Moral reasoning. In: Zalta EN (ed) The Stanford encyclopedia of philosophy. Stanford University, StanfordGoogle Scholar
 Roberts FS (1985) Measurement theory with applications to decisionmaking, utility, and the social sciences. Cambridge University Press, CambridgeGoogle Scholar
 Satoh K (1990) A probabilistic interpretation for lazy nonmonotonic reasoning. In: Proceedings of the eighth national conference on artificial intelligence (AAAI 1990). AAAI Press, pp 659–664Google Scholar
 Schank R, Abelson R (1977) Scripts, plans, goals and understanding. An inquiry into human knowledge structures. Lawrence Erlbaum, HillsdalezbMATHGoogle Scholar
 Shen Q, Keppens J, Aitken C, Schafer B, Lee M (2006) A scenariodriven decision support system for serious crime investigation. Law Probab Risk 5:87–117CrossRefGoogle Scholar
 Taroni F, Champod C, Margot P (1998) Forerunners of Bayesianism in early forensic science. Jurimetrics 38:183–200Google Scholar
 Timmer ST (2017) Designing and understanding forensic bayesian networks using argumentation. Dissertation. Utrecht University, UtrechtGoogle Scholar
 Timmer ST, Meyer JJ, Prakken H, Renooij S, Verheij B (2015a) Capturing critical questions in Bayesian network fragments. legal knowledge and information systems. In: Rotolo A (ed) Legal Knowledge and information systems: JURIX 2015: the twentyeighth annual conference. IOS Press, Amsterdam, pp 173–176Google Scholar
 Timmer ST, Meyer JJ, Prakken H, Renooij S, Verheij B (2015b) Explaining Bayesian networks using argumentation. In: Symbolic and quantitative approaches to reasoning with uncertainty—13th European conference, ECSQARU 2015, Compiègne, France, 15–17 July 2015. Proceedings. Springer, Berlin, pp 83–92Google Scholar
 Timmer ST, Meyer JJ, Prakken H, Renooij S, Verheij B (2017) A twophase method for extracting explanatory arguments from Bayesian networks. Int J Approx Reason 80:475–494MathSciNetCrossRefzbMATHGoogle Scholar
 Toulmin SE (1958) The uses of argument. Cambridge University Press, CambridgeGoogle Scholar
 van Benthem J (1984) Foundations of conditional logic. J Philos Logic 13:303–349MathSciNetCrossRefzbMATHGoogle Scholar
 van Eemeren FH, Garssen B, Krabbe ECW, Snoeck Henkemans AF, Verheij B, Wagemans JHM (2014) Chapter 11: Argumentation in artificial intelligence. In: Handbook of argumentation theory. Springer, Berlin Google Scholar
 Verheij B (2000) Dialectical argumentation as a heuristic for courtroom decision making. In: van Koppen PJ, Roos N (eds) Rationality, information and progress in law and psychology. Liber Amicorum Hans F. Crombag. Metajuridica Publications, Maastricht, pp 203–226Google Scholar
 Verheij B (2003) DefLog: on the logical interpretation of prima facie justified assumptions. J Logic Comput 13(3):319–346MathSciNetCrossRefzbMATHGoogle Scholar
 Verheij B (2010) Argumentation and rules with exceptions. In: Baroni B, Cerutti F, Giacomin M, Simari GR (eds) Computational models of argument: proceedings of COMMA 2010, Desenzano del Garda, Italy, 8–10 Sept 2010. IOS Press, Amsterdam, pp 455–462Google Scholar
 Verheij B (2012) Jumping to conclusions. A logicoprobabilistic foundation for defeasible rulebased arguments. In: Fariñas del Cerro L, Herzig A, Mengin J (eds) 13th European conference on logics in artificial intelligence, JELIA 2012. Proceedings (LNAI 7519), Toulouse, France, Sept 2012. Springer, Berlin, pp 411–423Google Scholar
 Verheij B (2014a) Arguments and their strength: revisiting Pollock’s antiprobabilistic starting points. In: Parsons S, Oren N, Reed C, Cerutti F (eds) Computational models of argument. Proceedings of COMMA 2014. IOS Press, Amsterdam, pp 433–444Google Scholar
 Verheij B (2014b) To catch a thief with and without numbers: arguments, scenarios and probabilities in evidential reasoning. Law Probab Risk 13:307–325CrossRefGoogle Scholar
 Verheij B (2016a) Correct grounded reasoning with presumptive arguments. In: Michael L, Kakas A (eds) 15th European conference on logics in artificial intelligence, JELIA 2016. Proceedings (LNAI 10021), Larnaca, Cyprus, 9–11 Nov 2016. Springer, Berlin, pp 481–496Google Scholar
 Verheij B (2016b) Formalizing correct evidential reasoning with arguments, scenarios and probabilities. In: Proceedings of the ECAI 2016 workshop on artificial intelligence for justice (AI4J). Informal publicationGoogle Scholar
 Verheij B (2016c) Formalizing valueguided argumentation for ethical systems design. Artif Intell Law 24(4):387–407CrossRefGoogle Scholar
 Verheij B, Bex FJ (2009) Accepting the truth of a story about the facts of a criminal case. In: Kaptein H, Prakken H, Verheij B (eds) Legal evidence and proof: statistics, stories, logic. Ashgate, Farnham, pp 161–193Google Scholar
 Verheij B, Bex FJ, Timmer ST, Vlek CS, Meyer JJ, Renooij S, Prakken H (2016) Arguments, scenarios and probabilities: connections between three normative frameworks for evidential reasoning. Law Probab Risk 15:35–70CrossRefGoogle Scholar
 Vlek CS (2016) When stories and numbers meet in court. Constructing and explaining Bayesian networks for criminal cases with scenarios. Dissertation, University of Groningen, GroningenGoogle Scholar
 Vlek CS, Prakken H, Renooij S, Verheij B (2014) Building Bayesian networks for legal evidence with narratives: a case study evaluation. Artif Intell Law 22(4):375–421CrossRefGoogle Scholar
 Vlek CS, Prakken H, Renooij S, Verheij B (2015) Representing the quality of crime scenarios in a Bayesian network. In: Rotolo A (ed) Legal knowledge and information systems: JURIX 2015: the twentyeighth annual conference. IOS Press, Amsterdam, pp 131–140Google Scholar
 Vlek CS, Prakken H, Renooij S, Verheij B (2016) A method for explaining Bayesian networks for legal evidence with scenarios. Artif Intell Law 24(3):285–324CrossRefGoogle Scholar
 Wagenaar WA, van Koppen PJ, Crombag HFM (1993) Anchored narratives. The psychology of criminal evidence. Harvester Wheatsheaf, LondonGoogle Scholar
 Wigmore JH (1913) The principles of judicial proof as given by logic, psychology, and general experience, and illustrated in judicial trials, 2nd edn 1931, 3rd edn ‘The science of judicial proof’ 1937. Little, Brown and Company, BostonGoogle Scholar
Copyright information
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.