2023
DOI: 10.1007/978-3-031-45608-4_6
|View full text |Cite
|
Sign up to set email alerts
|

Revisiting Approximate Reasoning Based on Grounded Semantics

Jérôme Delobelle,
Jean-Guy Mailly,
Julien Rossit

Abstract: Efficient computation of hard reasoning tasks is a key issue in abstract argumentation. One recent approach consists in defining approximate algorithms, i.e. methods that provide an answer that may not always be correct, but outperforms the exact algorithms regarding the computation runtime. One such approach proposes to use the grounded semantics, which is polynomially computable, as a starting point for determining whether arguments are (credulously or skeptically) accepted with respect to various semantics.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
references
References 15 publications
0
0
0
Order By: Relevance