Distinguishing ground from nonground information in defeasible argumentation
- Autores
- Chesñevar, Carlos Iván; Simari, Guillermo Ricardo
- Año de publicación
- 1995
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- 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.
Eje: 2do. Workshop sobre aspectos teóricos de la inteligencia artificial
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
defeasible reasoning
argumentative systems - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/24335
Ver los metadatos del registro completo
id |
SEDICI_5f14ffea0e4dbfbaafc652077385cef4 |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/24335 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
Distinguishing ground from nonground information in defeasible argumentationChesñevar, Carlos IvánSimari, Guillermo RicardoCiencias InformáticasARTIFICIAL INTELLIGENCEdefeasible reasoningargumentative systemsThe 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.Eje: 2do. Workshop sobre aspectos teóricos de la inteligencia artificialRed de Universidades con Carreras en Informática (RedUNCI)1995-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf527-538http://sedici.unlp.edu.ar/handle/10915/24335enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:28:35Zoai:sedici.unlp.edu.ar:10915/24335Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:28:35.647SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
Distinguishing ground from nonground information in defeasible argumentation |
title |
Distinguishing ground from nonground information in defeasible argumentation |
spellingShingle |
Distinguishing ground from nonground information in defeasible argumentation Chesñevar, Carlos Iván Ciencias Informáticas ARTIFICIAL INTELLIGENCE defeasible reasoning argumentative systems |
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 |
dc.creator.none.fl_str_mv |
Chesñevar, Carlos Iván Simari, Guillermo Ricardo |
author |
Chesñevar, Carlos Iván |
author_facet |
Chesñevar, Carlos Iván Simari, Guillermo Ricardo |
author_role |
author |
author2 |
Simari, Guillermo Ricardo |
author2_role |
author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas ARTIFICIAL INTELLIGENCE defeasible reasoning argumentative systems |
topic |
Ciencias Informáticas ARTIFICIAL INTELLIGENCE defeasible reasoning argumentative systems |
dc.description.none.fl_txt_mv |
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. Eje: 2do. Workshop sobre aspectos teóricos de la inteligencia artificial Red de Universidades con Carreras en Informática (RedUNCI) |
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. |
publishDate |
1995 |
dc.date.none.fl_str_mv |
1995-10 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/24335 |
url |
http://sedici.unlp.edu.ar/handle/10915/24335 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
dc.format.none.fl_str_mv |
application/pdf 527-538 |
dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
reponame_str |
SEDICI (UNLP) |
collection |
SEDICI (UNLP) |
instname_str |
Universidad Nacional de La Plata |
instacron_str |
UNLP |
institution |
UNLP |
repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
_version_ |
1842260125155328000 |
score |
13.13397 |