An approach for temporal argumentation using labeled defeasible logic programming (l-DeLP)

Autores
Budan, Maximiliano Celmo David; Gomez Lucero, Mauro Javier; Simari, Guillermo Ricardo
Año de publicación
2012
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In the last decade, several argument-based formalisms have emerged, with application in many areas, such as legal reasoning, autonomous agents and multi-agent systems; many are based on Dung´s seminal work characterizing Abstract Argumentation Frameworks (AF). Recent research in the area has led to Temporal Argumentation Frameworks (TAF), that extend AF by considering the temporal availability of arguments. On the other hand, different more concrete argumentation systems exists, such as Defeasible Logic Programming(DeLP), specifying a knowledge representation language, and how arguments are built. In this work we combine time representation capabilities of TAF with the representation language and argument structure of DeLP, defining a rule based argumentation framework that considers time at the object language level. In order to do this, we use an extension of DeLP, called Labeled DeLP (L-DeLP) to establish, for each program clause, the set of time intervals in which it is available, and to determine from this information the temporal availability of arguments. Acceptability semantics for TAF can then be applied to determine argument acceptability on time.
Fil: Budan, Maximiliano Celmo David. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. Universidad Nacional del Sur; Argentina. Universidad Nacional de Santiago del Estero; Argentina
Fil: Gomez Lucero, Mauro Javier. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. Universidad Nacional del Sur; Argentina
Fil: Simari, Guillermo Ricardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. Universidad Nacional del Sur; Argentina
Materia
ARGUMENTATION
TEMPORAL AVAILABILITY
DEFEASIBLE LOGIC PROGRAMMING
LABELED DEFEASIBLE LOGIC PROGRAMMING
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/79326
Acceder
id CONICETDig_47d33bc92d6eeb03187a769b5499e15b
oai_identifier_str oai:ri.conicet.gov.ar:11336/79326
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling An approach for temporal argumentation using labeled defeasible logic programming (l-DeLP)Budan, Maximiliano Celmo DavidGomez Lucero, Mauro JavierSimari, Guillermo RicardoARGUMENTATIONTEMPORAL AVAILABILITYDEFEASIBLE LOGIC PROGRAMMINGLABELED DEFEASIBLE LOGIC PROGRAMMINGhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1In the last decade, several argument-based formalisms have emerged, with application in many areas, such as legal reasoning, autonomous agents and multi-agent systems; many are based on Dung´s seminal work characterizing Abstract Argumentation Frameworks (AF). Recent research in the area has led to Temporal Argumentation Frameworks (TAF), that extend AF by considering the temporal availability of arguments. On the other hand, different more concrete argumentation systems exists, such as Defeasible Logic Programming(DeLP), specifying a knowledge representation language, and how arguments are built. In this work we combine time representation capabilities of TAF with the representation language and argument structure of DeLP, defining a rule based argumentation framework that considers time at the object language level. In order to do this, we use an extension of DeLP, called Labeled DeLP (L-DeLP) to establish, for each program clause, the set of time intervals in which it is available, and to determine from this information the temporal availability of arguments. Acceptability semantics for TAF can then be applied to determine argument acceptability on time.Fil: Budan, Maximiliano Celmo David. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. Universidad Nacional del Sur; Argentina. Universidad Nacional de Santiago del Estero; ArgentinaFil: Gomez Lucero, Mauro Javier. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. Universidad Nacional del Sur; ArgentinaFil: Simari, Guillermo Ricardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. Universidad Nacional del Sur; ArgentinaUniversidad Nacional de La Plata. Facultad de Informática2012-08-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/79326Budan, Maximiliano Celmo David; Gomez Lucero, Mauro Javier; Simari, Guillermo Ricardo; An approach for temporal argumentation using labeled defeasible logic programming (l-DeLP); Universidad Nacional de La Plata. Facultad de Informática; Journal of Computer Science and Technology; 12; 2; 1-8-2012; 56-631666-60461666-6038CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/JCST/article/view/653info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T10:10:47Zoai:ri.conicet.gov.ar:11336/79326instacron: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-03 10:10:47.795CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv An approach for temporal argumentation using labeled defeasible logic programming (l-DeLP)
title An approach for temporal argumentation using labeled defeasible logic programming (l-DeLP)
spellingShingle An approach for temporal argumentation using labeled defeasible logic programming (l-DeLP)
Budan, Maximiliano Celmo David
ARGUMENTATION
TEMPORAL AVAILABILITY
DEFEASIBLE LOGIC PROGRAMMING
LABELED DEFEASIBLE LOGIC PROGRAMMING
title_short An approach for temporal argumentation using labeled defeasible logic programming (l-DeLP)
title_full An approach for temporal argumentation using labeled defeasible logic programming (l-DeLP)
title_fullStr An approach for temporal argumentation using labeled defeasible logic programming (l-DeLP)
title_full_unstemmed An approach for temporal argumentation using labeled defeasible logic programming (l-DeLP)
title_sort An approach for temporal argumentation using labeled defeasible logic programming (l-DeLP)
dc.creator.none.fl_str_mv Budan, Maximiliano Celmo David
Gomez Lucero, Mauro Javier
Simari, Guillermo Ricardo
author Budan, Maximiliano Celmo David
author_facet Budan, Maximiliano Celmo David
Gomez Lucero, Mauro Javier
Simari, Guillermo Ricardo
author_role author
author2 Gomez Lucero, Mauro Javier
Simari, Guillermo Ricardo
author2_role author
author
dc.subject.none.fl_str_mv ARGUMENTATION
TEMPORAL AVAILABILITY
DEFEASIBLE LOGIC PROGRAMMING
LABELED DEFEASIBLE LOGIC PROGRAMMING
topic ARGUMENTATION
TEMPORAL AVAILABILITY
DEFEASIBLE LOGIC PROGRAMMING
LABELED DEFEASIBLE LOGIC PROGRAMMING
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv In the last decade, several argument-based formalisms have emerged, with application in many areas, such as legal reasoning, autonomous agents and multi-agent systems; many are based on Dung´s seminal work characterizing Abstract Argumentation Frameworks (AF). Recent research in the area has led to Temporal Argumentation Frameworks (TAF), that extend AF by considering the temporal availability of arguments. On the other hand, different more concrete argumentation systems exists, such as Defeasible Logic Programming(DeLP), specifying a knowledge representation language, and how arguments are built. In this work we combine time representation capabilities of TAF with the representation language and argument structure of DeLP, defining a rule based argumentation framework that considers time at the object language level. In order to do this, we use an extension of DeLP, called Labeled DeLP (L-DeLP) to establish, for each program clause, the set of time intervals in which it is available, and to determine from this information the temporal availability of arguments. Acceptability semantics for TAF can then be applied to determine argument acceptability on time.
Fil: Budan, Maximiliano Celmo David. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. Universidad Nacional del Sur; Argentina. Universidad Nacional de Santiago del Estero; Argentina
Fil: Gomez Lucero, Mauro Javier. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. Universidad Nacional del Sur; Argentina
Fil: Simari, Guillermo Ricardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. Universidad Nacional del Sur; Argentina
description In the last decade, several argument-based formalisms have emerged, with application in many areas, such as legal reasoning, autonomous agents and multi-agent systems; many are based on Dung´s seminal work characterizing Abstract Argumentation Frameworks (AF). Recent research in the area has led to Temporal Argumentation Frameworks (TAF), that extend AF by considering the temporal availability of arguments. On the other hand, different more concrete argumentation systems exists, such as Defeasible Logic Programming(DeLP), specifying a knowledge representation language, and how arguments are built. In this work we combine time representation capabilities of TAF with the representation language and argument structure of DeLP, defining a rule based argumentation framework that considers time at the object language level. In order to do this, we use an extension of DeLP, called Labeled DeLP (L-DeLP) to establish, for each program clause, the set of time intervals in which it is available, and to determine from this information the temporal availability of arguments. Acceptability semantics for TAF can then be applied to determine argument acceptability on time.
publishDate 2012
dc.date.none.fl_str_mv 2012-08-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/79326
Budan, Maximiliano Celmo David; Gomez Lucero, Mauro Javier; Simari, Guillermo Ricardo; An approach for temporal argumentation using labeled defeasible logic programming (l-DeLP); Universidad Nacional de La Plata. Facultad de Informática; Journal of Computer Science and Technology; 12; 2; 1-8-2012; 56-63
1666-6046
1666-6038
CONICET Digital
CONICET
url http://hdl.handle.net/11336/79326
identifier_str_mv Budan, Maximiliano Celmo David; Gomez Lucero, Mauro Javier; Simari, Guillermo Ricardo; An approach for temporal argumentation using labeled defeasible logic programming (l-DeLP); Universidad Nacional de La Plata. Facultad de Informática; Journal of Computer Science and Technology; 12; 2; 1-8-2012; 56-63
1666-6046
1666-6038
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/JCST/article/view/653
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Universidad Nacional de La Plata. Facultad de Informática
publisher.none.fl_str_mv Universidad Nacional de La Plata. Facultad de Informática
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_ 1842270132433321984
score 13.13397

Publicaciones similares