2015
DOI: 10.1007/978-3-319-23540-0_22
|View full text |Cite
|
Sign up to set email alerts
|

On Argumentation with Purely Defeasible Rules

Abstract: aspic + is one of the most widely used systems for structured arguments and includes the use of both strict and defeasible rules. Here we consider using just the defeasible part of aspic +. We show that using the resulting system, it is possible, in a well defined sense, to capture the same information as using aspic + with strict rules.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
5
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
3
1
1

Relationship

3
2

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…That is an argument with a strict TopRule can rebut an argument with a defeasible TopRule, but not vice versa. ( [4] and [10] introduce the ASPIC-and ASPIC + D systems which use unrestricted rebut). Finally, A set of arguments is said to be consistent iff there is no attack between any arguments in the set.…”
Section: Definitionmentioning
confidence: 99%
“…That is an argument with a strict TopRule can rebut an argument with a defeasible TopRule, but not vice versa. ( [4] and [10] introduce the ASPIC-and ASPIC + D systems which use unrestricted rebut). Finally, A set of arguments is said to be consistent iff there is no attack between any arguments in the set.…”
Section: Definitionmentioning
confidence: 99%
“…The canonical example here comes from[45] via[36], and is the rule that normally objects that appear red, are red. However, in the situation that everything is illuminated with red light, this rule no longer holds since under red light everything, including things that are not red, will appear to be red.3 This asymmetry is not uncontroversial, see[11,33] for arguments against it.…”
mentioning
confidence: 99%
“…The model of structured argumentation that we use in the following examples is that of [28], which is a defeasible subset of ASPIC+ [33]. In terms of the element introduced above, L contains a set of propositions p i , their negations ¬p i , and a set of defeasible rules p 1 , .…”
Section: Scenariomentioning
confidence: 99%