Mostrar el registro sencillo del ítem
dc.contributor.author
Gottifredi, Sebastián
dc.contributor.author
Rotstein, Nicolas Daniel
dc.contributor.author
Garcia, Alejandro Javier
dc.contributor.author
Simari. Guillermo R.
dc.date.available
2017-02-02T21:19:04Z
dc.date.issued
2013-03
dc.identifier.citation
Gottifredi, Sebastián ; Rotstein, Nicolas Daniel; Garcia, Alejandro Javier; Simari. Guillermo R. ; Using argument strength for building dialectical bonsai; Springer; Annals Of Mathematics And Artificial Intelligence; 69; 1; 3-2013; 103-129
dc.identifier.issn
1012-2443
dc.identifier.uri
http://hdl.handle.net/11336/12413
dc.description.abstract
Argumentation in AI provides an inconsistency-tolerant formalism capable of establishing those pieces of knowledge that can be accepted despite having information in contradiction. Computation of accepted arguments tends to be expensive; in order to alleviate this issue, we propose a heuristics-based pruning technique over argumentation trees. Empirical testing shows that in most cases our approach answers queries much faster than the usual techniques, which prune with no guide. The heuristics is based on a measure of strength assigned to arguments. We show how to compute these strength values by providing the corresponding algorithms, which use dynamic programming techniques to reutilise previously computed trees. In addition to this, we introduce a set of postulates characterising the desired behaviour of any strength formula. We check the given measure of strength against these postulates to show that its behaviour is rational. Although the approach presented here is based on an abstract argumentation framework, the techniques are tightly connected to the dialectical process rather than to the framework itself. Thus, results can be extrapolated to other dialectical-tree-based argumentation formalisms with no additional difficulty.
dc.format
application/pdf
dc.language.iso
eng
dc.publisher
Springer
dc.rights
info:eu-repo/semantics/openAccess
dc.rights.uri
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.subject
Non-Monotonic Reasoning
dc.subject
Computational Argumentation
dc.subject
Dialectical Proof
dc.subject
Procedures
dc.subject
Heuristics-Based Tree Pruning
dc.subject.classification
Ciencias de la Computación
dc.subject.classification
Ciencias de la Computación e Información
dc.subject.classification
CIENCIAS NATURALES Y EXACTAS
dc.title
Using argument strength for building dialectical bonsai
dc.type
info:eu-repo/semantics/article
dc.type
info:ar-repo/semantics/artículo
dc.type
info:eu-repo/semantics/publishedVersion
dc.date.updated
2017-02-02T14:06:02Z
dc.identifier.eissn
1573-7470
dc.journal.volume
69
dc.journal.number
1
dc.journal.pagination
103-129
dc.journal.pais
Alemania
dc.journal.ciudad
Berlín
dc.description.fil
Fil: Gottifredi, Sebastián . Universidad Nacional del Sur; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Bahia Blanca; Argentina
dc.description.fil
Fil: Rotstein, Nicolas Daniel. Universidad Nacional del Sur; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Bahia Blanca; Argentina
dc.description.fil
Fil: Garcia, Alejandro Javier. Universidad Nacional del Sur; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Bahia Blanca; Argentina
dc.description.fil
Fil: Simari. Guillermo R. . Universidad Nacional del Sur; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Bahia Blanca; Argentina
dc.journal.title
Annals Of Mathematics And Artificial Intelligence
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/url/http://link.springer.com/article/10.1007%2Fs10472-013-9338-x
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/url/http://dx.doi.org/10.1007/s10472-013-9338-x
Archivos asociados