An approach for an algebra applied to a defeasible logic programming
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), i...
Guardado en:
Autores principales: | , , |
---|---|
Formato: | Objeto de conferencia |
Lenguaje: | Inglés |
Publicado: |
2012
|
Materias: | |
Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23612 |
Aporte de: |
id |
I19-R120-10915-23612 |
---|---|
record_format |
dspace |
institution |
Universidad Nacional de La Plata |
institution_str |
I-19 |
repository_str |
R-120 |
collection |
SEDICI (UNLP) |
language |
Inglés |
topic |
Ciencias Informáticas Concrete Argumentation Systems Argumentative Labels Algebra Defeasible Logic Programming Logic Programming Intelligent agents |
spellingShingle |
Ciencias Informáticas Concrete Argumentation Systems Argumentative Labels Algebra Defeasible Logic Programming Logic Programming Intelligent agents Budán, Maximiliano Celmo David Gómez Lucero, Mauro Javier Simari, Guillermo Ricardo An approach for an algebra applied to a defeasible logic programming |
topic_facet |
Ciencias Informáticas Concrete Argumentation Systems Argumentative Labels Algebra Defeasible Logic Programming Logic Programming Intelligent agents |
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. |
format |
Objeto de conferencia Objeto de conferencia |
author |
Budán, Maximiliano Celmo David Gómez Lucero, Mauro Javier Simari, Guillermo Ricardo |
author_facet |
Budán, Maximiliano Celmo David Gómez Lucero, Mauro Javier Simari, Guillermo Ricardo |
author_sort |
Budán, Maximiliano Celmo David |
title |
An approach for an algebra applied to a defeasible logic programming |
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 |
approach for an algebra applied to a defeasible logic programming |
publishDate |
2012 |
url |
http://sedici.unlp.edu.ar/handle/10915/23612 |
work_keys_str_mv |
AT budanmaximilianocelmodavid anapproachforanalgebraappliedtoadefeasiblelogicprogramming AT gomezluceromaurojavier anapproachforanalgebraappliedtoadefeasiblelogicprogramming AT simariguillermoricardo anapproachforanalgebraappliedtoadefeasiblelogicprogramming AT budanmaximilianocelmodavid approachforanalgebraappliedtoadefeasiblelogicprogramming AT gomezluceromaurojavier approachforanalgebraappliedtoadefeasiblelogicprogramming AT simariguillermoricardo approachforanalgebraappliedtoadefeasiblelogicprogramming |
bdutipo_str |
Repositorios |
_version_ |
1764820466032181249 |