2017
DOI: 10.1587/transinf.2016edp7313
|View full text |Cite
|
Sign up to set email alerts
|

Encoding Argumentation Semantics by Boolean Algebra

Abstract: SUMMARYIn this paper, a Boolean algebra approach is proposed to encode various acceptability semantics for abstract argumentation frameworks, where each semantics can be equivalently encoded into several Boolean constraint models based on Boolean matrices and a family of Boolean operations between them. Then, we show that these models can be easily translated into logic programs, and can be solved by a constraint solver over Boolean variables. In addition, we propose some querying strategies to accelerate the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 19 publications
0
1
0
Order By: Relevance
“…Table 3 synthetizes the different cases. [24,26,46,54,61,69,83,84,88,89] Note that the complexity of the chosen logic must be taken into account: it is more or less difficult to compute models and to establish the link between these models and the output that must be produced. This point is related to the next criterion.…”
Section: Comparison Criteriamentioning
confidence: 99%
“…Table 3 synthetizes the different cases. [24,26,46,54,61,69,83,84,88,89] Note that the complexity of the chosen logic must be taken into account: it is more or less difficult to compute models and to establish the link between these models and the output that must be produced. This point is related to the next criterion.…”
Section: Comparison Criteriamentioning
confidence: 99%