Journal of Symbolic Logic
Revising Nonmonotonic Theories: The Case of Defeasible Logic
KI '99 Proceedings of the 23rd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Defeasible logic programming: an argumentative approach
Theory and Practice of Logic Programming
On the Relationship of Defeasible Argumentation and Answer Set Programming
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Hi-index | 0.00 |
In this paper, we investigate the problem of contraction in Defeasible Logic Programming (DeLP), a logic-based approach for defeasible argumentation.We develop different notions of contraction based on both, the different forms of entailment implicitly existent in argumentation-based formalisms and the influence literals exhibit in the reasoning process. We give translations of widely accepted rationality postulates for belief contraction to our framework. Moreover we discuss on the applicability of contraction for defeasible argumentation and the role of influence in this matter.