In this paper we look at the manual analysis of arguments and how this compares to the current state of automatic argument analysis. These considerations are used to develop a new approach combining a machine learning algorithm to extract propositions from text, with a topic model to determine argument structure. The results of this method are compared to a manual analysis.

In this paper, I propose a logical-cognitive approach to argumentation and advocate an idea that argumentation presupposes that intelligent agents engaged in it are cognitively diverse. My approach to argumentation allows drawing distinctions between justification, conviction and persuasion as its different kinds. In justification agents seek to verify weak or strong coherency of an agent’s position in a dialogue. In conviction they argue to modify their partner’s position by means of demonstrating weak or strong cogency of their positions before a (...) ‘rational judge’. My approach to argumentation employs a ‘light’ version of Dung’s abstract argumentative frameworks. It is based on Stich’s idea of agents’ cognitive diversity the epistemic aspect of which is argued to be close to Pavilionis’s conception of meaning continuum. To illustrate my contributions I use an example based on the Kitchen Debate (1959) between Khrushchev and Nixon. (shrink)

In this chapter, we outline the range of argument forms involving causation that can be found in everyday discourse. We also survey empirical work concerned with the generation and evaluation of such arguments. This survey makes clear that there is presently no unified body of research concerned with causal argument. We highlight the benefits of a unified treatment both for those interested in causal cognition and those interested in argumentation, and identify the key challenges that must be met for a (...) full understanding of causal argumentation. (shrink)

We provide a retrospective of 25 years of the International Conference on AI and Law, which was first held in 1987. Fifty papers have been selected from the thirteen conferences and each of them is described in a short subsection individually written by one of the 24 authors. These subsections attempt to place the paper discussed in the context of the development of AI and Law, while often offering some personal reactions and reflections. As a whole, the subsections build into (...) a history of the last quarter century of the field, and provide some insights into where it has come from, where it is now, and where it might go. (shrink)

How is the burden of proof to be distributed among individuals who are involved in resolving a particular issue? Under what conditions should the burden of proof be distributed unevenly? We distinguish attitudinal from dialectical burdens and argue that these questions should be answered differently, depending on which is in play. One has an attitudinal burden with respect to some proposition when one is required to possess sufficient evidence for it. One has a dialectical burden with respect to some proposition (...) when one is required to provide supporting arguments for it as part of a deliberative process. We show that the attitudinal burden with respect to certain propositions is unevenly distributed in some deliberative contexts, but in all of these contexts, establishing the degree of support for the proposition is merely a means to some other deliberative end, such as action guidance, or persuasion. By contrast, uneven distributions of the dialectical burden regularly further the aims of deliberation, even in contexts where the quest for truth is the sole deliberative aim, rather than merely a means to some different deliberative end. We argue that our distinction between these two burdens resolves puzzles about unevenness that have been raised in the literature. (shrink)

An abstract framework for structured arguments is presented, which instantiates Dung's ('On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming, and n- Person Games', Artificial Intelligence , 77, 321-357) abstract argumentation frameworks. Arguments are defined as inference trees formed by applying two kinds of inference rules: strict and defeasible rules. This naturally leads to three ways of attacking an argument: attacking a premise, attacking a conclusion and attacking an inference. To resolve such attacks, preferences may (...) be used, which leads to three corresponding kinds of defeat: undermining, rebutting and undercutting defeats. The nature of the inference rules, the structure of the logical language on which they operate and the origin of the preferences are, apart from some basic assumptions, left unspecified. The resulting framework integrates work of Pollock, Vreeswijk and others on the structure of arguments and the nature of defeat and extends it in several respects. Various rationality postulates are proved to be satisfied by the framework, and several existing approaches are proved to be a special case of the framework, including assumption-based argumentation and DefLog. (shrink)

When interlocutors start to talk at cross purposes it becomes less likely that they will be able to resolve their differences of opinion. Still, a critic, in the confrontation stage of a discussion, should be given some room of manoeuvre for rephrasing and even for revising the arguer’s position. I will distinguish between licit and illicit applications of this form of strategic manoeuvring by stating three soundness conditions.

Recent work on conditional reasoning argues that denying the antecedent [DA] and affirming the consequent [AC] are defeasible but cogent patterns of argument, either because they are effective, rational, albeit heuristic applications of Bayesian probability, or because they are licensed by the principle of total evidence. Against this, we show that on any prevailing interpretation of indicative conditionals the premises of DA and AC arguments do not license their conclusions without additional assumptions. The cogency of DA and AC inferences rather (...) depends on contingent factors extrinsic to, and independent of, what is asserted by DA and AC arguments. arguments do not license their conclusions without additional assumptions. The cogency of DA and AC inferences rather depends on contingent factors extrinsic to, and independent of, what is asserted by DA and AC arguments. (shrink)

Plausible (eikotic) reasoning known from ancient Greek (late Academic) skeptical philosophy is shown to be a clear notion that can be analyzed by argumentation methods, and that is important for argumentation studies. It is shown how there is a continuous thread running from the Sophists to the skeptical philosopher Carneades, through remarks of Locke and Bentham on the subject, to recent research in artificial intelligence. Eleven characteristics of plausible reasoning are specified by analyzing key examples of it recognized as important (...) in ancient Greek skeptical philosophy using an artificial intelligence model called the Carneades Argumentation System (CAS). By applying CAS to ancient examples it is shown how plausible reasoning is especially useful for gaining a better understanding of evidential reasoning in law, and argued that it can also be applied to everyday argumentation. Our analysis of the snake and rope example of Carneades is also used to point out some ways CAS needs to be extended if it is to more fully model the views of this ancient philosopher on argumentation. (shrink)

This paper uses the language of formal dialectics to explore how argumentation schemes and their critical questions can be characterized as an extension to traditional dialectical systems. The aim is to construct a dialectical system in which the set of locutions is extended to include scheme-based moves the set of structural rules describes the roles that critical questioning can play; and the set of commitment rules distinguishes between exceptions and assumptions.

Trust is a natural mechanism by which an autonomous party, an agent, can deal with the inherent uncertainty regarding the behaviours of other parties and the uncertainty in the information it shares with those parties. Trust is thus crucial in any decentralised system. This paper builds on recent efforts to use argumentation to reason about trust. Specifically, a set of schemes is provided, and abstract patterns of reasoning that apply in multiple situations geared towards trust. Schemes are described in which (...) one agent, A, can establish arguments for trusting another agent, B, directly, as well as schemes that A can use to construct arguments for trusting C, where C is trusted by B. For both sets of schemes, a set of critical questions is offered that identify the situations in which these schemes can fail. (shrink)

We provide a logical analysis of private international law, a rather esoteric, but increasingly important, domain of the law. Private international law addresses overlaps and conflicts between legal systems by distributing cases between the authorities of such systems (jurisdiction) and establishing what rules these authorities have to apply to each case (choice of law). A formal model of the resulting interactions between legal systems is proposed based on modular argumentation. It is argued that this model may also be useful for (...) governing the interactions between heterogeneous agents, belonging to different and differently regulated virtual societies, without recourse to a central regulatory agency. The model also provides for multiple interpretations concerning rules of private international law as well as substantive rules of the different legal systems. (shrink)

This paper shows how the critical questions matching an argumentation scheme can be mod-eled in the Carneades argumentation system as three kinds of premises. Ordinary premises hold only if they are supported by sufficient arguments. Assumptions hold, by default, until they have been questioned. With exceptions the negation holds, by default, until the exception has been supported by sufficient arguments. By “sufficient arguments”, we mean arguments sufficient to satisfy the applicable proof standard.

Computer tools are increasingly used to support the analysis of argumentative texts. Generic support for argumentation analysis is helpful, but catering to the requirements of specific theoretical approaches has additional advantages. Although the pragma-dialectical method of analyzing argumentative texts is widely used, no dedicated computational support tools exist. An outline is presented for the development of such tools, that starts with the formal approximation of the pragma-dialectical ideal model of a critical discussion.