Parallel defeasible argumentation

dc.creatorGarcía, Alejandro Javier
dc.creatorSimari, Guillermo Ricardo
dc.date2000
dc.date2004-05-06T03:00:00Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/9387
dc.identifierhttp://journal.info.unlp.edu.ar/wp-content/uploads/2015/papers_02/parallel.pdf
dc.identifierissn:1666-6038
dc.descriptionImplicitly exploitable parallelism for Logic Programming has received ample attention. Defeasible Argutmentation is specially apt for this optimizing technique. Defeasible Logic Programming (DLP), which is based on a defeasible argumentation formalism, could take full advantage of this type of parallel evaluation to improve the computational response of its proof procedure. In a defeasible argumentation formalism, a conclusion q is accepted only when the argument A that supports q becomes a justification. To decide if an argument A is a justification a dialectical analysis is performed. This analysis considers arguments and counter-arguments. DLP extends conventional Logic Programming, capturing common sense reasoning features, and providing a knowledge representation language for defeasible argumentation. Since DLP is an extension of Logic Programming, the different types of parallelism studied for Logic Programming could be applied. We propose new sources of parallelism that can be implicitly exploited in the defeasible argumentation formalism implemented through DLP. Both the argumentation process and the dialectical analysis benefit from exploiting those sources of parallelism.
dc.descriptionFacultad de Informática
dc.formatapplication/pdf
dc.languageen
dc.relationJournal of Computer Science & Technology
dc.relationvol. 1, no. 2
dc.rightshttp://creativecommons.org/licenses/by-nc/3.0/
dc.rightsCreative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)
dc.subjectCiencias Informáticas
dc.titleParallel defeasible argumentation
dc.typeArticulo
dc.typeArticulo


Este ítem pertenece a la siguiente institución