Abstract

This paper combines three computational argumentation systems to model the sequence of argumentation in a famous murder trial and the appeal procedure that followed. The paper shows how the argumentation scheme for argument from expert opinion can be built into a testing procedure whereby an argument graph is used to interpret, analyze and evaluate evidence-based natural language argumentation of the kind found in a trial. It is shown how a computational argumentation system can do this by combining argument schemes with argumentation graphs. Frighteningly, it is also shown by this example that when there are potentially confusing conflicting arguments from expert opinion, a jury can only too easily accept a conclusion prematurely before considering critical questions that need to be asked.