Argument theory change applied to defeasible logic programming
Martín O. Moguillansky, Nicolás D. Rotstein, Marcelo Alejandro Falappa, Alejandro Javier García, Guillermo Ricardo Simari · 2008
In this article we work on certain aspects of the belief change theory in order to make them suitable for argumentation sys-tems. This approach is based on Defeasible Logic Program-ming as the argumentation formalism from which we ground the definitions. The objective of our proposal is to define an argument revision operator that inserts a new argument into a defeasible logic program in such a way that this argument ends up undefeated after the revision, thus warranting its con-clusion. In order to ensure this warrant, the defeasible logic program has to be changed in concordance with a minimal change principle. Finally, we present an algorithm that im-plements the argument revision operation.