Admissible sets of arguments in a timed context
Timed abstract frameworks (TAFs) are a novel formalism for argumentation where arguments are valid only during specific intervals of time, called availability intervals. Attacks between arguments are relevant only when both the attacker and the attacked arguments are available. Thus, the outcome of...
Guardado en:
Autores principales: | , , |
---|---|
Formato: | Objeto de conferencia |
Lenguaje: | Inglés |
Publicado: |
2010
|
Materias: | |
Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/152577 http://39jaiio.sadio.org.ar/sites/default/files/39jaiio-asai-02.pdf |
Aporte de: |
id |
I19-R120-10915-152577 |
---|---|
record_format |
dspace |
spelling |
I19-R120-10915-1525772023-05-08T20:04:16Z http://sedici.unlp.edu.ar/handle/10915/152577 http://39jaiio.sadio.org.ar/sites/default/files/39jaiio-asai-02.pdf issn:1850-2784 Admissible sets of arguments in a timed context Cobo, María Laura Martínez, Diego C. Simari, Guillermo Ricardo 2010 2010 2023-05-08T16:59:21Z en Ciencias Informáticas timed abstract frameworks arguments Timed abstract frameworks (TAFs) are a novel formalism for argumentation where arguments are valid only during specific intervals of time, called availability intervals. Attacks between arguments are relevant only when both the attacker and the attacked arguments are available. Thus, the outcome of the framework may vary in time. Previous formalization of TAFs are based on discrete time, with single-interval argument validity. In this work we study argument admissibility notions in a timed abstract framework with intermittent arguments under a dense time representation. Sociedad Argentina de Informática e Investigación Operativa Objeto de conferencia Objeto de conferencia http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) application/pdf 13-24 |
institution |
Universidad Nacional de La Plata |
institution_str |
I-19 |
repository_str |
R-120 |
collection |
SEDICI (UNLP) |
language |
Inglés |
topic |
Ciencias Informáticas timed abstract frameworks arguments |
spellingShingle |
Ciencias Informáticas timed abstract frameworks arguments Cobo, María Laura Martínez, Diego C. Simari, Guillermo Ricardo Admissible sets of arguments in a timed context |
topic_facet |
Ciencias Informáticas timed abstract frameworks arguments |
description |
Timed abstract frameworks (TAFs) are a novel formalism for argumentation where arguments are valid only during specific intervals of time, called availability intervals. Attacks between arguments are relevant only when both the attacker and the attacked arguments are available. Thus, the outcome of the framework may vary in time. Previous formalization of TAFs are based on discrete time, with single-interval argument validity. In this work we study argument admissibility notions in a timed abstract framework with intermittent arguments under a dense time representation. |
format |
Objeto de conferencia Objeto de conferencia |
author |
Cobo, María Laura Martínez, Diego C. Simari, Guillermo Ricardo |
author_facet |
Cobo, María Laura Martínez, Diego C. Simari, Guillermo Ricardo |
author_sort |
Cobo, María Laura |
title |
Admissible sets of arguments in a timed context |
title_short |
Admissible sets of arguments in a timed context |
title_full |
Admissible sets of arguments in a timed context |
title_fullStr |
Admissible sets of arguments in a timed context |
title_full_unstemmed |
Admissible sets of arguments in a timed context |
title_sort |
admissible sets of arguments in a timed context |
publishDate |
2010 |
url |
http://sedici.unlp.edu.ar/handle/10915/152577 http://39jaiio.sadio.org.ar/sites/default/files/39jaiio-asai-02.pdf |
work_keys_str_mv |
AT cobomarialaura admissiblesetsofargumentsinatimedcontext AT martinezdiegoc admissiblesetsofargumentsinatimedcontext AT simariguillermoricardo admissiblesetsofargumentsinatimedcontext |
_version_ |
1765660133267865600 |