An approach for an algebra applied to a defeasible logic programming

Autores
Budán, Maximiliano Celmo David; Gómez Lucero, Mauro Javier; Simari, Guillermo Ricardo
Año de publicación
2012
Idioma
inglés
Tipo de recurso
documento de conferencia
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, au- tonomous agents and multi-agent systems. In this work we present an approach applied to any concrete argumenta- tion systems, called Argumentative Labels Algebra (ALA), in which propagate certain information through the internal structure of the argument and the existing relations between these. This information can be used for di erent proposed: (1) determine which argument defeat another, analyzing a feature that is relevant to the domain (eg. time availability, degree of reliability, particular characteristics, among others) and (2) de ne a acceptability threshold which will determine if the arguments are strong enough to be accepted. For this way, we obtain an approach that strengthens the argumenta- tions systems, increase the ability of real-world representation modeling di erent attributes associated to the arguments.
Eje: Workshop Agentes y sistemas inteligentes (WASI)
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Concrete Argumentation Systems
Argumentative Labels Algebra
Defeasible Logic Programming
Logic Programming
Intelligent agents
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/23612

id SEDICI_5e83cefe632f77b1507a9f7ce199dff1
oai_identifier_str oai:sedici.unlp.edu.ar:10915/23612
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling An approach for an algebra applied to a defeasible logic programmingBudán, Maximiliano Celmo DavidGómez Lucero, Mauro JavierSimari, Guillermo RicardoCiencias InformáticasConcrete Argumentation SystemsArgumentative Labels AlgebraDefeasible Logic ProgrammingLogic ProgrammingIntelligent agentsIn the last decade, several argument-based formalisms have emerged, with application in many areas, such as legal reasoning, au- tonomous agents and multi-agent systems. In this work we present an approach applied to any concrete argumenta- tion systems, called Argumentative Labels Algebra (ALA), in which propagate certain information through the internal structure of the argument and the existing relations between these. This information can be used for di erent proposed: (1) determine which argument defeat another, analyzing a feature that is relevant to the domain (eg. time availability, degree of reliability, particular characteristics, among others) and (2) de ne a acceptability threshold which will determine if the arguments are strong enough to be accepted. For this way, we obtain an approach that strengthens the argumenta- tions systems, increase the ability of real-world representation modeling di erent attributes associated to the arguments.Eje: Workshop Agentes y sistemas inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI)2012-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/23612enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:28:20Zoai:sedici.unlp.edu.ar:10915/23612Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:28:20.393SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv An approach for an algebra applied to a defeasible logic programming
title An approach for an algebra applied to a defeasible logic programming
spellingShingle An approach for an algebra applied to a defeasible logic programming
Budán, Maximiliano Celmo David
Ciencias Informáticas
Concrete Argumentation Systems
Argumentative Labels Algebra
Defeasible Logic Programming
Logic Programming
Intelligent agents
title_short An approach for an algebra applied to a defeasible logic programming
title_full An approach for an algebra applied to a defeasible logic programming
title_fullStr An approach for an algebra applied to a defeasible logic programming
title_full_unstemmed An approach for an algebra applied to a defeasible logic programming
title_sort An approach for an algebra applied to a defeasible logic programming
dc.creator.none.fl_str_mv Budán, Maximiliano Celmo David
Gómez Lucero, Mauro Javier
Simari, Guillermo Ricardo
author Budán, Maximiliano Celmo David
author_facet Budán, Maximiliano Celmo David
Gómez Lucero, Mauro Javier
Simari, Guillermo Ricardo
author_role author
author2 Gómez Lucero, Mauro Javier
Simari, Guillermo Ricardo
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Concrete Argumentation Systems
Argumentative Labels Algebra
Defeasible Logic Programming
Logic Programming
Intelligent agents
topic Ciencias Informáticas
Concrete Argumentation Systems
Argumentative Labels Algebra
Defeasible Logic Programming
Logic Programming
Intelligent agents
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, au- tonomous agents and multi-agent systems. In this work we present an approach applied to any concrete argumenta- tion systems, called Argumentative Labels Algebra (ALA), in which propagate certain information through the internal structure of the argument and the existing relations between these. This information can be used for di erent proposed: (1) determine which argument defeat another, analyzing a feature that is relevant to the domain (eg. time availability, degree of reliability, particular characteristics, among others) and (2) de ne a acceptability threshold which will determine if the arguments are strong enough to be accepted. For this way, we obtain an approach that strengthens the argumenta- tions systems, increase the ability of real-world representation modeling di erent attributes associated to the arguments.
Eje: Workshop Agentes y sistemas inteligentes (WASI)
Red de Universidades con Carreras en Informática (RedUNCI)
description In the last decade, several argument-based formalisms have emerged, with application in many areas, such as legal reasoning, au- tonomous agents and multi-agent systems. In this work we present an approach applied to any concrete argumenta- tion systems, called Argumentative Labels Algebra (ALA), in which propagate certain information through the internal structure of the argument and the existing relations between these. This information can be used for di erent proposed: (1) determine which argument defeat another, analyzing a feature that is relevant to the domain (eg. time availability, degree of reliability, particular characteristics, among others) and (2) de ne a acceptability threshold which will determine if the arguments are strong enough to be accepted. For this way, we obtain an approach that strengthens the argumenta- tions systems, increase the ability of real-world representation modeling di erent attributes associated to the arguments.
publishDate 2012
dc.date.none.fl_str_mv 2012-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/23612
url http://sedici.unlp.edu.ar/handle/10915/23612
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1842260122013794304
score 13.13397