2012
DOI: 10.1007/s10472-012-9318-6
|View full text |Cite
|
Sign up to set email alerts
|

A logic of argumentation for specification and verification of abstract argumentation frameworks

Abstract: In this paper, we propose a logic of argumentation for the specification and verification (LA4SV) of requirements on Dung's abstract argumentation frameworks. We distinguish three kinds of decision problems for argumentation verification, called extension verification, framework verification, and specification verification respectively. For example, given a political requirement like "if the argument to increase taxes is accepted, then the argument to increase services must be accepted too," we can either veri… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(13 citation statements)
references
References 36 publications
0
13
0
Order By: Relevance
“…As an aside, a distinctive feature of YALLA is that a reference universe of argumentation is assumed, which makes it possible to capture cases of incomplete knowledge. The second approach reported in the same section proposes a propositional logic to specify and to check requirements in argumentation graphs [93]. The input consists of an argumentation graph together with constraints (such as: argument a or argument b is acceptable) and the outputs are formulae encoding the graph and the constraints, so that the models of the formulae capture properties of the argumentation graph.…”
Section: P Besnard Et Al / Logical Theories and Abstract Argumentatmentioning
confidence: 99%
See 4 more Smart Citations
“…As an aside, a distinctive feature of YALLA is that a reference universe of argumentation is assumed, which makes it possible to capture cases of incomplete knowledge. The second approach reported in the same section proposes a propositional logic to specify and to check requirements in argumentation graphs [93]. The input consists of an argumentation graph together with constraints (such as: argument a or argument b is acceptable) and the outputs are formulae encoding the graph and the constraints, so that the models of the formulae capture properties of the argumentation graph.…”
Section: P Besnard Et Al / Logical Theories and Abstract Argumentatmentioning
confidence: 99%
“…Section 10 reviews three methods for expressing abstract argumentation in modal logic [25,70,93], two of them taking as input an argumentation graph together with a labelling (the third method regards argumentative semantics as primitives of the language) while the output consists of modal formulae expressing the distinctive properties of a given argumentative semantics.…”
Section: P Besnard Et Al / Logical Theories and Abstract Argumentatmentioning
confidence: 99%
See 3 more Smart Citations