Some Options for Instantiation of Bipolar Argument Graphs with Deductive Arguments
This work addresses a need in computational argumentation for better modeling of argument structure, but it appears incremental as it builds on existing bipolar argument graph concepts.
The paper tackles the problem of understanding individual arguments and their interactions in bipolar argument graphs by proposing a framework that uses logical arguments to instantiate these graphs and introduces constraints based on argument structure and relationship types.
Argument graphs provide an abstract representation of an argumentative situation. A bipolar argument graph is a directed graph where each node denotes an argument, and each arc denotes the influence of one argument on another. Here we assume that the influence is supporting, attacking, or ambiguous. In a bipolar argument graph, each argument is atomic and so it has no internal structure. Yet to better understand the nature of the individual arguments, and how they interact, it is important to consider their internal structure. To address this need, this paper presents a framework based on the use of logical arguments to instantiate bipolar argument graphs, and a set of possible constraints on instantiating arguments that take into account the internal structure of the arguments, and the types of relationship between arguments.