Skip to main content
Conference Proceedings

Semantics of Extended Argumentation Frameworks Defined by Renovation Sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2019) 11873 LNAI 532-540
DOI: 10.1007/978-3-030-33792-6_38
3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Dung’s theory of abstract argumentation frameworks plays an increasingly important role in artificial intelligence. Extended argumentation frameworks extend Dung’s AF by considering attacks on attacks. In this paper we introduce a new EAF semantics that deals with infinite deductive defence. This EAF semantics is underpinned by a new notion called renovation sets. Based on this, the concepts of conflict-freeness and acceptability are re-defined.

Cite

CITATION STYLE

APA

Li, H., & Wu, J. (2019). Semantics of Extended Argumentation Frameworks Defined by Renovation Sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11873 LNAI, pp. 532–540). Springer. https://doi.org/10.1007/978-3-030-33792-6_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free