On resolving conflicts between arguments
Nico Roos

TL;DR
This paper introduces a new argument system that resolves conflicts by focusing solely on the last defeasible rules, enabling efficient conflict resolution, relation to default logic, and reasoning by cases.
Contribution
It proposes a novel argument system using undercutting-arguments for defeat, simplifying conflict resolution and enabling linear-time computation.
Findings
Conflict resolution using only last rules is effective.
The system can determine undefeated arguments in linear time.
It establishes a relation with Default Logic and supports reasoning by cases.
Abstract
Argument systems are based on the idea that one can construct arguments for propositions; i.e., structured reasons justifying the belief in a proposition. Using defeasible rules, arguments need not be valid in all circumstances, therefore, it might be possible to construct an argument for a proposition as well as its negation. When arguments support conflicting propositions, one of the arguments must be defeated, which raises the question of \emph{which (sub-)arguments can be subject to defeat}? In legal argumentation, meta-rules determine the valid arguments by considering the last defeasible rule of each argument involved in a conflict. Since it is easier to evaluate arguments using their last rules, \emph{can a conflict be resolved by considering only the last defeasible rules of the arguments involved}? We propose a new argument system where, instead of deriving a defeat…
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 · Logic, Reasoning, and Knowledge · Semantic Web and Ontologies
