Computing Extensions of Dynamic Abstract Argumentation Frameworks with Second-Order Attacks-Reference-Cited by-同舟云学术

Computing Extensions of Dynamic Abstract Argumentation Frameworks with Second-Order Attacks

Published:2018 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 22nd International Database Engineering & Applications Symposium on - IDEAS 2018
language:
Short-container-title:

Author:

Alfano Gianvincenzo¹,Greco Sergio¹,Parisi Francesco¹

Affiliation:

1. Department of Informatics, Modeling, Electronics and System Engineering (DIMES), University of Calabria, Rende (CS), Italy

Publisher

ACM Press

Reference49 articles.

1. http://argumentationcompetition.org/2017/results.html, 2017.

2. Gianvincenzo Alfano, Sergio Greco, and Francesco Parisi. Computing stable and preferred extensions of dynamic bipolar argumentation frameworks. In Proc. of Workshop on Advances In Argumentation In Artificial Intelligence co-located with XVI International Conference of the Italian Association for Artificial Intelligence (AI*IA), pages 28--42, 2017.

3. Gianvincenzo Alfano, Sergio Greco, and Francesco Parisi. Efficient computation of extensions for dynamic abstract argumentation frameworks: An incremental approach. In Proc. of International Joint Conference on Artificial Intelligence (IJCAI), pages 49--55, 2017.

4. Gianvincenzo Alfano, Sergio Greco, Francesco Parisi, Gerardo I. Simari, and Guillermo R. Simari. Incremental computation of warranted arguments in dynamic defeasible argumentation: The rule addition case. In Proc. of the Symp. on Applied Computing (SAC), pages 911--917, 2018.

5. Teresa Alsinet, Josep Argelich, Ramón Béjar, César Fernández, Carles Mateu, and Jordi Planes. An argumentative approach for discovering relevant opinions in twitter with probabilistic valued relationships. Pattern Recognition Letters, In press, 2017.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Assessment of benchmarks for abstract argumentation;Argument & Computation;2019-09-02

2. An Incremental Algorithm for Computing the Grounded Extension of Dynamic Abstract Argumentation Frameworks;Group Decision and Negotiation;2019-06-21

3. On scaling the enumeration of the preferred extensions of abstract argumentation frameworks;Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing;2019-04-08

4. A meta-argumentation approach for the efficient computation of stable and preferred extensions in dynamic bipolar argumentation frameworks;Intelligenza Artificiale;2019-01-28

5. An Efficient Algorithm for Computing the Set of Semi-stable Extensions;Flexible Query Answering Systems;2019