Distinguishing ground from nonground information in defeasible argumentation

The problem of speeding up ínference has proved to be important in argumentative systems. When computing dialectical structures, several paths are searched (called argumentation lines), many of which will eventually prove useless. Morover, the performance of backward chainers degrades quickly as the...

Descripción completa

Detalles Bibliográficos
Autores principales: Chesñevar, Carlos Iván, Simari, Guillermo Ricardo
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 1995
Materias:
Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
defeasible reasoning
argumentative systems
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/24335
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-24335
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
ARTIFICIAL INTELLIGENCE
defeasible reasoning
argumentative systems
spellingShingle Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
defeasible reasoning
argumentative systems
Chesñevar, Carlos Iván
Simari, Guillermo Ricardo
Distinguishing ground from nonground information in defeasible argumentation
topic_facet Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
defeasible reasoning
argumentative systems
description The problem of speeding up ínference has proved to be important in argumentative systems. When computing dialectical structures, several paths are searched (called argumentation lines), many of which will eventually prove useless. Morover, the performance of backward chainers degrades quickly as the size of the knowledge base increases. This is a major hindrance for argumentative systems, sínce backward chaining is applied at two different levels (arguments themselves resemble proof trees, and arguments are related to each other within a tree structure). This paper presents a novel approach for speeding up inference. We will work with arguments for nonground literaIs, on the basis of some results presented by Levy [2]. As a result, most computations involving dialectical trees can be performed independently from the current groulld facts in the system 's knowledge base. The definition of abstraet dialectical tree will be introduced, which will account for aIl nonground queries for a given literal.
format Objeto de conferencia
Objeto de conferencia
author Chesñevar, Carlos Iván
Simari, Guillermo Ricardo
author_facet Chesñevar, Carlos Iván
Simari, Guillermo Ricardo
author_sort Chesñevar, Carlos Iván
title Distinguishing ground from nonground information in defeasible argumentation
title_short Distinguishing ground from nonground information in defeasible argumentation
title_full Distinguishing ground from nonground information in defeasible argumentation
title_fullStr Distinguishing ground from nonground information in defeasible argumentation
title_full_unstemmed Distinguishing ground from nonground information in defeasible argumentation
title_sort distinguishing ground from nonground information in defeasible argumentation
publishDate 1995
url http://sedici.unlp.edu.ar/handle/10915/24335
work_keys_str_mv AT chesnevarcarlosivan distinguishinggroundfromnongroundinformationindefeasibleargumentation
AT simariguillermoricardo distinguishinggroundfromnongroundinformationindefeasibleargumentation
bdutipo_str Repositorios
_version_ 1764820467005259777

Ejemplares similares