A methodology for knowledge representation in defeasible logic programming

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 s...

Descripción completa

Detalles Bibliográficos
Autores principales: Stankevicius, Alejandro G., Simari, Guillermo Ricardo
Formato: Objeto de conferencia
Lenguaje:Español
Publicado: 2006
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/22623
Aporte de:
id I19-R120-10915-22623
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Español
topic Ciencias Informáticas
nonmonotonic reasoning
defeasible reasoning
argumentation theories
knowledge representation
spellingShingle Ciencias Informáticas
nonmonotonic reasoning
defeasible reasoning
argumentation theories
knowledge representation
Stankevicius, Alejandro G.
Simari, Guillermo Ricardo
A methodology for knowledge representation in defeasible logic programming
topic_facet Ciencias Informáticas
nonmonotonic reasoning
defeasible reasoning
argumentation theories
knowledge representation
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.
format Objeto de conferencia
Objeto de conferencia
author Stankevicius, Alejandro G.
Simari, Guillermo Ricardo
author_facet Stankevicius, Alejandro G.
Simari, Guillermo Ricardo
author_sort Stankevicius, Alejandro G.
title A methodology for knowledge representation in defeasible logic programming
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 methodology for knowledge representation in defeasible logic programming
publishDate 2006
url http://sedici.unlp.edu.ar/handle/10915/22623
work_keys_str_mv AT stankeviciusalejandrog amethodologyforknowledgerepresentationindefeasiblelogicprogramming
AT simariguillermoricardo amethodologyforknowledgerepresentationindefeasiblelogicprogramming
AT stankeviciusalejandrog methodologyforknowledgerepresentationindefeasiblelogicprogramming
AT simariguillermoricardo methodologyforknowledgerepresentationindefeasiblelogicprogramming
bdutipo_str Repositorios
_version_ 1764820466144378884