A preliminary study of computational complexity in non-monotonic reasoning

Autores
Capobianco, Marcela; Chesñevar, Carlos Iván; Simari, Guillermo Ricardo
Año de publicación
2005
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
In this work we analyze existing complexity results in the area of non-monotonic reasoning in general and argumentation in particular. Even though the area of argumentation is based on solid theoretical foundations, its main problems rely on the computational complexity of the system that have so far been developed. In order to use argumentation in real time scenarios we must find an implementation with a reasonable response time. Complexity analysis of argument systems is an indispensable tool for addressing this taks. We expect that the development of this research line will result in a general analysis of the issues in complexity of argument systems, leading to an efficient implementation of a particular formalism, observation-based defeasible logic programming, that could be integrated in an intelligent agent architecture.
Eje: Inteligencia artificial
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
preliminary study
computational complexity
non-monotonic reasoning
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/21163
Acceder
id SEDICI_a0f1ed93141d5a324ed6cf53c8c44795
oai_identifier_str oai:sedici.unlp.edu.ar:10915/21163
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling A preliminary study of computational complexity in non-monotonic reasoningCapobianco, MarcelaChesñevar, Carlos IvánSimari, Guillermo RicardoCiencias InformáticasARTIFICIAL INTELLIGENCEpreliminary studycomputational complexitynon-monotonic reasoningIn this work we analyze existing complexity results in the area of non-monotonic reasoning in general and argumentation in particular. Even though the area of argumentation is based on solid theoretical foundations, its main problems rely on the computational complexity of the system that have so far been developed. In order to use argumentation in real time scenarios we must find an implementation with a reasonable response time. Complexity analysis of argument systems is an indispensable tool for addressing this taks. We expect that the development of this research line will result in a general analysis of the issues in complexity of argument systems, leading to an efficient implementation of a particular formalism, observation-based defeasible logic programming, that could be integrated in an intelligent agent architecture.Eje: Inteligencia artificialRed de Universidades con Carreras en Informática (RedUNCI)2005-05info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf383-387http://sedici.unlp.edu.ar/handle/10915/21163enginfo:eu-repo/semantics/altIdentifier/isbn/950-665-337-2info: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-10-29T15:00:15Zoai:sedici.unlp.edu.ar:10915/21163Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-29 15:00:15.864SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv A preliminary study of computational complexity in non-monotonic reasoning
title A preliminary study of computational complexity in non-monotonic reasoning
spellingShingle A preliminary study of computational complexity in non-monotonic reasoning
Capobianco, Marcela
Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
preliminary study
computational complexity
non-monotonic reasoning
title_short A preliminary study of computational complexity in non-monotonic reasoning
title_full A preliminary study of computational complexity in non-monotonic reasoning
title_fullStr A preliminary study of computational complexity in non-monotonic reasoning
title_full_unstemmed A preliminary study of computational complexity in non-monotonic reasoning
title_sort A preliminary study of computational complexity in non-monotonic reasoning
dc.creator.none.fl_str_mv Capobianco, Marcela
Chesñevar, Carlos Iván
Simari, Guillermo Ricardo
author Capobianco, Marcela
author_facet Capobianco, Marcela
Chesñevar, Carlos Iván
Simari, Guillermo Ricardo
author_role author
author2 Chesñevar, Carlos Iván
Simari, Guillermo Ricardo
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
preliminary study
computational complexity
non-monotonic reasoning
topic Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
preliminary study
computational complexity
non-monotonic reasoning
dc.description.none.fl_txt_mv In this work we analyze existing complexity results in the area of non-monotonic reasoning in general and argumentation in particular. Even though the area of argumentation is based on solid theoretical foundations, its main problems rely on the computational complexity of the system that have so far been developed. In order to use argumentation in real time scenarios we must find an implementation with a reasonable response time. Complexity analysis of argument systems is an indispensable tool for addressing this taks. We expect that the development of this research line will result in a general analysis of the issues in complexity of argument systems, leading to an efficient implementation of a particular formalism, observation-based defeasible logic programming, that could be integrated in an intelligent agent architecture.
Eje: Inteligencia artificial
Red de Universidades con Carreras en Informática (RedUNCI)
description In this work we analyze existing complexity results in the area of non-monotonic reasoning in general and argumentation in particular. Even though the area of argumentation is based on solid theoretical foundations, its main problems rely on the computational complexity of the system that have so far been developed. In order to use argumentation in real time scenarios we must find an implementation with a reasonable response time. Complexity analysis of argument systems is an indispensable tool for addressing this taks. We expect that the development of this research line will result in a general analysis of the issues in complexity of argument systems, leading to an efficient implementation of a particular formalism, observation-based defeasible logic programming, that could be integrated in an intelligent agent architecture.
publishDate 2005
dc.date.none.fl_str_mv 2005-05
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/21163
url http://sedici.unlp.edu.ar/handle/10915/21163
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/isbn/950-665-337-2
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
383-387
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_ 1847427782805553152
score 13.10058

Publicaciones similares