Parallel defeasible argumentation

Implicitly 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 paral...

Descripción completa

Detalles Bibliográficos
Autores principales:	García, Alejandro Javier, Simari, Guillermo Ricardo
Formato:	Articulo
Lenguaje:	Inglés
Publicado:	2000
Materias:	Ciencias Informáticas Logic programming Parallel programming Distributed Artificial Intelligence defeasible reasoning; argumentation; parallel logic programming
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/9387 http://journal.info.unlp.edu.ar/wp-content/uploads/2015/papers_02/parallel.pdf
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

id	I19-R120-10915-9387
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 Logic programming Parallel programming Distributed Artificial Intelligence defeasible reasoning; argumentation; parallel logic programming
spellingShingle	Ciencias Informáticas Logic programming Parallel programming Distributed Artificial Intelligence defeasible reasoning; argumentation; parallel logic programming García, Alejandro Javier Simari, Guillermo Ricardo Parallel defeasible argumentation
topic_facet	Ciencias Informáticas Logic programming Parallel programming Distributed Artificial Intelligence defeasible reasoning; argumentation; parallel logic programming
description	Implicitly 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.
format	Articulo Articulo
author	García, Alejandro Javier Simari, Guillermo Ricardo
author_facet	García, Alejandro Javier Simari, Guillermo Ricardo
author_sort	García, Alejandro Javier
title	Parallel defeasible argumentation
title_short	Parallel defeasible argumentation
title_full	Parallel defeasible argumentation
title_fullStr	Parallel defeasible argumentation
title_full_unstemmed	Parallel defeasible argumentation
title_sort	parallel defeasible argumentation
publishDate	2000
url	http://sedici.unlp.edu.ar/handle/10915/9387 http://journal.info.unlp.edu.ar/wp-content/uploads/2015/papers_02/parallel.pdf
work_keys_str_mv	AT garciaalejandrojavier paralleldefeasibleargumentation AT simariguillermoricardo paralleldefeasibleargumentation
bdutipo_str	Repositorios
_version_	1764820491875385344

Parallel defeasible argumentation

Ejemplares similares