A methodology for knowledge representation in defeasible logic programming

Autores
Stankevicius, Alejandro G.; Simari, Guillermo Ricardo
Año de publicación
2006
Idioma
español castellano
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
Humans have always been intrigued by their ability to reason. We have constantly attempted to emulate this process, trying almost everything, from physiological explanations, to sociological accounts. The approach with possibly the longest tradition conceives this process as a mere manipulation of symbols. Yet, symbolic reasoning cannot be applied directly over the problem at hand: we require that the knowledge about that domain be also described symbolically, where this description is in turn the outcome of the process called Knowledge Representation. Defeasible Logic Programming (DeLP) is a formalism that by combining Logic Programming with Defeasible Argumentation is able to represent incomplete and potentially contradictory information. Its ability to represent this kind of informartion make it suitable for describing many real world situations, where its inference engine can then later be used to solve concrete problems in those scenarios. In this article we propose a formal methodology, striving to standardize the process of knowledge representation in DeLP, that defines a set of guidelines to be used during this key task.
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
nonmonotonic reasoning
defeasible reasoning
argumentation theories
knowledge representation
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/22623
Acceder
id SEDICI_edc5e9f0dcedbe6ee1da47db4e404ba1
oai_identifier_str oai:sedici.unlp.edu.ar:10915/22623
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling A methodology for knowledge representation in defeasible logic programmingStankevicius, Alejandro G.Simari, Guillermo RicardoCiencias Informáticasnonmonotonic reasoningdefeasible reasoningargumentation theoriesknowledge representationHumans have always been intrigued by their ability to reason. We have constantly attempted to emulate this process, trying almost everything, from physiological explanations, to sociological accounts. The approach with possibly the longest tradition conceives this process as a mere manipulation of symbols. Yet, symbolic reasoning cannot be applied directly over the problem at hand: we require that the knowledge about that domain be also described symbolically, where this description is in turn the outcome of the process called Knowledge Representation. Defeasible Logic Programming (DeLP) is a formalism that by combining Logic Programming with Defeasible Argumentation is able to represent incomplete and potentially contradictory information. Its ability to represent this kind of informartion make it suitable for describing many real world situations, where its inference engine can then later be used to solve concrete problems in those scenarios. In this article we propose a formal methodology, striving to standardize the process of knowledge representation in DeLP, that defines a set of guidelines to be used during this key task.Red de Universidades con Carreras en Informática (RedUNCI)2006-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf1139-1150http://sedici.unlp.edu.ar/handle/10915/22623spainfo: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:27:57Zoai:sedici.unlp.edu.ar:10915/22623Institucionalhttp://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:27:57.708SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv A methodology for knowledge representation in defeasible logic programming
title A methodology for knowledge representation in defeasible logic programming
spellingShingle A methodology for knowledge representation in defeasible logic programming
Stankevicius, Alejandro G.
Ciencias Informáticas
nonmonotonic reasoning
defeasible reasoning
argumentation theories
knowledge representation
title_short A methodology for knowledge representation in defeasible logic programming
title_full A methodology for knowledge representation in defeasible logic programming
title_fullStr A methodology for knowledge representation in defeasible logic programming
title_full_unstemmed A methodology for knowledge representation in defeasible logic programming
title_sort A methodology for knowledge representation in defeasible logic programming
dc.creator.none.fl_str_mv Stankevicius, Alejandro G.
Simari, Guillermo Ricardo
author Stankevicius, Alejandro G.
author_facet Stankevicius, Alejandro G.
Simari, Guillermo Ricardo
author_role author
author2 Simari, Guillermo Ricardo
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
nonmonotonic reasoning
defeasible reasoning
argumentation theories
knowledge representation
topic Ciencias Informáticas
nonmonotonic reasoning
defeasible reasoning
argumentation theories
knowledge representation
dc.description.none.fl_txt_mv Humans have always been intrigued by their ability to reason. We have constantly attempted to emulate this process, trying almost everything, from physiological explanations, to sociological accounts. The approach with possibly the longest tradition conceives this process as a mere manipulation of symbols. Yet, symbolic reasoning cannot be applied directly over the problem at hand: we require that the knowledge about that domain be also described symbolically, where this description is in turn the outcome of the process called Knowledge Representation. Defeasible Logic Programming (DeLP) is a formalism that by combining Logic Programming with Defeasible Argumentation is able to represent incomplete and potentially contradictory information. Its ability to represent this kind of informartion make it suitable for describing many real world situations, where its inference engine can then later be used to solve concrete problems in those scenarios. In this article we propose a formal methodology, striving to standardize the process of knowledge representation in DeLP, that defines a set of guidelines to be used during this key task.
Red de Universidades con Carreras en Informática (RedUNCI)
description Humans have always been intrigued by their ability to reason. We have constantly attempted to emulate this process, trying almost everything, from physiological explanations, to sociological accounts. The approach with possibly the longest tradition conceives this process as a mere manipulation of symbols. Yet, symbolic reasoning cannot be applied directly over the problem at hand: we require that the knowledge about that domain be also described symbolically, where this description is in turn the outcome of the process called Knowledge Representation. Defeasible Logic Programming (DeLP) is a formalism that by combining Logic Programming with Defeasible Argumentation is able to represent incomplete and potentially contradictory information. Its ability to represent this kind of informartion make it suitable for describing many real world situations, where its inference engine can then later be used to solve concrete problems in those scenarios. In this article we propose a formal methodology, striving to standardize the process of knowledge representation in DeLP, that defines a set of guidelines to be used during this key task.
publishDate 2006
dc.date.none.fl_str_mv 2006-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/22623
url http://sedici.unlp.edu.ar/handle/10915/22623
dc.language.none.fl_str_mv spa
language spa
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
1139-1150
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_ 1842260117859336192
score 13.13397

Publicaciones similares