Alejandro G. Stankevicius

On the development of a formal methodology for knowledge representation in defeasible logic programming

Defeasible Logic Programming (DeLP) is a formalism able to represent incomplete and potentially contradictory information that combines logic programming with defeasible argumentation. In the past few years, this formalism has been applied to real world scenarios with encouraging results. Not withstanding, the outcome one may obtain in this or any other argumentative system is directly related to the decisions (or lack thereof) made during the phase of knowledge representation. In addition, this is exacerbated by the usual lack of a formal methodology able to assist the knowledge engineer during this critical phase. In this article, we propose a formal methodology for knowledge representation in DeLP, that defines a set of guidelines to be used during this phase. Our methodology results in an key tool to improve DeLPs applicability to concrete domains.