Argument Theory Change Applied to Defeasible Logic Programming
Abstract
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.
Cite
Text
Moguillansky et al. "Argument Theory Change Applied to Defeasible Logic Programming." AAAI Conference on Artificial Intelligence, 2008.Markdown
[Moguillansky et al. "Argument Theory Change Applied to Defeasible Logic Programming." AAAI Conference on Artificial Intelligence, 2008.](https://mlanthology.org/aaai/2008/moguillansky2008aaai-argument/)BibTeX
@inproceedings{moguillansky2008aaai-argument,
title = {{Argument Theory Change Applied to Defeasible Logic Programming}},
author = {Moguillansky, Martín O. and Rotstein, Nicolás D. and Falappa, Marcelo A. and García, Alejandro Javier and Simari, Guillermo Ricardo},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2008},
pages = {132-137},
url = {https://mlanthology.org/aaai/2008/moguillansky2008aaai-argument/}
}