Some Options for Instantiation of Bipolar Argument Graphs with Deductive Arguments
Anthony Hunter

TL;DR
This paper proposes a framework for instantiating bipolar argument graphs with logical arguments, incorporating internal structure and relationship types to better understand argumentative interactions.
Contribution
It introduces a novel framework that uses logical arguments to instantiate bipolar argument graphs, considering internal argument structure and relationship constraints.
Findings
Framework effectively models internal argument structure
Constraints improve the accuracy of argument interaction representation
Enhances understanding of argumentative dynamics
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMulti-Agent Systems and Negotiation · Software Engineering Research · Natural Language Processing Techniques
