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. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
García, D. R., Gottifredi, S., Krümpelmann, P., Thimm, M., Kern-Isberner, G., Falappa, M. A., & García, A. J. (2011). On influence and contractions in defeasible logic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6645 LNAI, pp. 199–204). https://doi.org/10.1007/978-3-642-20895-9_19
Mendeley helps you to discover research relevant for your work.