Logic programs with classical negation
Logic programming
A mathematical treatment of defeasible reasoning and its implementation
Artificial Intelligence
An abstract, argumentation-theoretic approach to default reasoning
Artificial Intelligence
Logic programming and knowledge representation-the A-prolog perspective
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Defeasible logic programming: an argumentative approach
Theory and Practice of Logic Programming
Argumentation and the Dynamics of Warranted Beliefs in Changing Environments
Autonomous Agents and Multi-Agent Systems
Argument-based critics and recommenders: a qualitative perspective on user support systems
Data & Knowledge Engineering - Special issue: WIDM 2004
| Hi-index | 0.00 |
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 DeLP's applicability to concrete domains.