# Reasoning by Cases in Structured Argumentation

arXiv: https://arxiv.org/abs/1703.08397 · HTML: https://mlsanity.com/paper/1703.08397/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Mar 2017.

## Built on by (most cited first, 3 of 3)

- [Non-Deterministic Approximation Fixpoint Theory and Its Application in Disjunctive Logic Programming](https://mlsanity.com/paper/2211.17262/) (2022)
- [A Semantic Tableau Method for Argument Construction](https://mlsanity.com/paper/2209.04759/) (2022)
- [Argumentative Characterizations of (Extended) Disjunctive Logic Programs](https://mlsanity.com/paper/2306.07126/) (2023)

## Abstract (arXiv)

We extend the ASPIC^+ framework for structured argumentation so as to allow applications of the reasoning by cases inference scheme for defeasible arguments. Given an argument with conclusion `A or B', an argument based on A with conclusion C, and an argument based on B with conclusion C, we allow the construction of an argument with conclusion C. We show how our framework leads to different results than other approaches in non-monotonic logic for dealing with disjunctive information, such as disjunctive default theory or approaches based on the OR-rule (which allows to derive a defeasible rule `If (A or B) then C', given two defeasible rules `If A then C' and `If B then C'). We raise new questions regarding the subtleties of reasoning defeasibly with disjunctive information, and show that its formalization is more intricate than one would presume.