On the incremental computation of semantics in dynamic argumentation
- Autores
- Gianvincenzo, Alfano; Greco, Sergio; Parisi, Francesco; Simari, Gerardo; Simari, Guillermo Ricardo
- Año de publicación
- 2021
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- Argumentation frameworks often model dynamic situations where arguments and their relationships (e.g., attacks) frequently change over time. As a consequence, the sets of conclusions (e.g., extensions of abstract argumentation frameworks, or warranted literals for structured argumentation frameworks) often need to be computed again after performing an update. However, as most of the argumentation semantics proposed so far suffer from high computational complexity, computing the set of conclusions from scratch is costly in general. In this work, we address the problems of efficiently recomputing extensions of dynamic abstract argumentation frameworks and warranted literals in dynamic defeasible knowledge bases. In particular, we first present an incremental algorithmic solution whose main idea is that of using an initial extension and the update to identify a (potentially small) portion of an abstract argumentation framework, which is sufficient to compute an extension of the updated framework.
Fil: Gianvincenzo, Alfano. Università della Calabria; Italia
Fil: Greco, Sergio. Università della Calabria; Italia
Fil: Parisi, Francesco. Università della Calabria; Italia
Fil: Simari, Gerardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina
Fil: Simari, Guillermo Ricardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina - Materia
-
Argumentation frameworks
Dynamic Argumentation
Knowledge Representation and Reasoning - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/142787
Ver los metadatos del registro completo
id |
CONICETDig_f4a0d42e68937e80f088af7ce744ffdf |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/142787 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
On the incremental computation of semantics in dynamic argumentationGianvincenzo, AlfanoGreco, SergioParisi, FrancescoSimari, GerardoSimari, Guillermo RicardoArgumentation frameworksDynamic ArgumentationKnowledge Representation and Reasoninghttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1Argumentation frameworks often model dynamic situations where arguments and their relationships (e.g., attacks) frequently change over time. As a consequence, the sets of conclusions (e.g., extensions of abstract argumentation frameworks, or warranted literals for structured argumentation frameworks) often need to be computed again after performing an update. However, as most of the argumentation semantics proposed so far suffer from high computational complexity, computing the set of conclusions from scratch is costly in general. In this work, we address the problems of efficiently recomputing extensions of dynamic abstract argumentation frameworks and warranted literals in dynamic defeasible knowledge bases. In particular, we first present an incremental algorithmic solution whose main idea is that of using an initial extension and the update to identify a (potentially small) portion of an abstract argumentation framework, which is sufficient to compute an extension of the updated framework.Fil: Gianvincenzo, Alfano. Università della Calabria; ItaliaFil: Greco, Sergio. Università della Calabria; ItaliaFil: Parisi, Francesco. Università della Calabria; ItaliaFil: Simari, Gerardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; ArgentinaFil: Simari, Guillermo Ricardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; ArgentinaCollege Publications2021-07-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/142787Gianvincenzo, Alfano; Greco, Sergio; Parisi, Francesco; Simari, Gerardo; Simari, Guillermo Ricardo; On the incremental computation of semantics in dynamic argumentation; College Publications; Journal of Applied Logics; 8; 6; 1-7-2021; 1749-1792978-1-84890-371-52631-98102631-9829CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://collegepublications.co.uk/ifcolog/?00048info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T09:52:11Zoai:ri.conicet.gov.ar:11336/142787instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-29 09:52:11.364CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
On the incremental computation of semantics in dynamic argumentation |
title |
On the incremental computation of semantics in dynamic argumentation |
spellingShingle |
On the incremental computation of semantics in dynamic argumentation Gianvincenzo, Alfano Argumentation frameworks Dynamic Argumentation Knowledge Representation and Reasoning |
title_short |
On the incremental computation of semantics in dynamic argumentation |
title_full |
On the incremental computation of semantics in dynamic argumentation |
title_fullStr |
On the incremental computation of semantics in dynamic argumentation |
title_full_unstemmed |
On the incremental computation of semantics in dynamic argumentation |
title_sort |
On the incremental computation of semantics in dynamic argumentation |
dc.creator.none.fl_str_mv |
Gianvincenzo, Alfano Greco, Sergio Parisi, Francesco Simari, Gerardo Simari, Guillermo Ricardo |
author |
Gianvincenzo, Alfano |
author_facet |
Gianvincenzo, Alfano Greco, Sergio Parisi, Francesco Simari, Gerardo Simari, Guillermo Ricardo |
author_role |
author |
author2 |
Greco, Sergio Parisi, Francesco Simari, Gerardo Simari, Guillermo Ricardo |
author2_role |
author author author author |
dc.subject.none.fl_str_mv |
Argumentation frameworks Dynamic Argumentation Knowledge Representation and Reasoning |
topic |
Argumentation frameworks Dynamic Argumentation Knowledge Representation and Reasoning |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/1.2 https://purl.org/becyt/ford/1 |
dc.description.none.fl_txt_mv |
Argumentation frameworks often model dynamic situations where arguments and their relationships (e.g., attacks) frequently change over time. As a consequence, the sets of conclusions (e.g., extensions of abstract argumentation frameworks, or warranted literals for structured argumentation frameworks) often need to be computed again after performing an update. However, as most of the argumentation semantics proposed so far suffer from high computational complexity, computing the set of conclusions from scratch is costly in general. In this work, we address the problems of efficiently recomputing extensions of dynamic abstract argumentation frameworks and warranted literals in dynamic defeasible knowledge bases. In particular, we first present an incremental algorithmic solution whose main idea is that of using an initial extension and the update to identify a (potentially small) portion of an abstract argumentation framework, which is sufficient to compute an extension of the updated framework. Fil: Gianvincenzo, Alfano. Università della Calabria; Italia Fil: Greco, Sergio. Università della Calabria; Italia Fil: Parisi, Francesco. Università della Calabria; Italia Fil: Simari, Gerardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina Fil: Simari, Guillermo Ricardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina |
description |
Argumentation frameworks often model dynamic situations where arguments and their relationships (e.g., attacks) frequently change over time. As a consequence, the sets of conclusions (e.g., extensions of abstract argumentation frameworks, or warranted literals for structured argumentation frameworks) often need to be computed again after performing an update. However, as most of the argumentation semantics proposed so far suffer from high computational complexity, computing the set of conclusions from scratch is costly in general. In this work, we address the problems of efficiently recomputing extensions of dynamic abstract argumentation frameworks and warranted literals in dynamic defeasible knowledge bases. In particular, we first present an incremental algorithmic solution whose main idea is that of using an initial extension and the update to identify a (potentially small) portion of an abstract argumentation framework, which is sufficient to compute an extension of the updated framework. |
publishDate |
2021 |
dc.date.none.fl_str_mv |
2021-07-01 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
format |
article |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://hdl.handle.net/11336/142787 Gianvincenzo, Alfano; Greco, Sergio; Parisi, Francesco; Simari, Gerardo; Simari, Guillermo Ricardo; On the incremental computation of semantics in dynamic argumentation; College Publications; Journal of Applied Logics; 8; 6; 1-7-2021; 1749-1792 978-1-84890-371-5 2631-9810 2631-9829 CONICET Digital CONICET |
url |
http://hdl.handle.net/11336/142787 |
identifier_str_mv |
Gianvincenzo, Alfano; Greco, Sergio; Parisi, Francesco; Simari, Gerardo; Simari, Guillermo Ricardo; On the incremental computation of semantics in dynamic argumentation; College Publications; Journal of Applied Logics; 8; 6; 1-7-2021; 1749-1792 978-1-84890-371-5 2631-9810 2631-9829 CONICET Digital CONICET |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/url/https://collegepublications.co.uk/ifcolog/?00048 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf application/pdf |
dc.publisher.none.fl_str_mv |
College Publications |
publisher.none.fl_str_mv |
College Publications |
dc.source.none.fl_str_mv |
reponame:CONICET Digital (CONICET) instname:Consejo Nacional de Investigaciones Científicas y Técnicas |
reponame_str |
CONICET Digital (CONICET) |
collection |
CONICET Digital (CONICET) |
instname_str |
Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.name.fl_str_mv |
CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.mail.fl_str_mv |
dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar |
_version_ |
1844613601886732288 |
score |
13.069144 |