Dynamics of knowledge in DeLP through Argument Theory Change

Abstract

1 This article is devoted to the study of methods to change defeasible logic programs (de.l.p.s) which are the knowledge bases used by the Defeasible Logic Programming (DeLP) interpreter. DeLP is an argumentation formalism that allows to reason over potentially inconsistent de.l.p.s. Argument Theory Change (ATC) studies certain aspects of belief revision in order to make them suitable for abstract argumentation systems. In this article, abstract arguments are rendered concrete by using the particular rule-based defeasible logic adopted by DeLP. The objective of our proposal is to define prioritized argument revision operatorsà la ATC for de.l.p.s, in such a way that the newly inserted argument ends up undefeated after the revision, thus warranting its conclusion. In order to ensure this warrant, the de.l.p. has to be changed in concordance with a minimal change principle. To this end, we discuss different minimal change criteria that could be adopted. Finally, an algorithm is presented, implementing the argument revision operations.

Resolving conflicts in knowledge for ambient intelligence

“…The main focus of each work is also summarized. Baroni et al (2013) Yes Yes General comparison Falappa et al, (2009Falappa et al, ( , 2011 Yes Yes General comparison, inter-applicability Rotstein et al (2010) Yes Dynamic evidence-based argumentation Conditioned AFs (Liao et al, 2011) Yes Update of AF Cayrol et al (2010), Boella et al (2009aBoella et al ( , 2009b Yes Addition/removal of attacks/arguments Coste-Marquis et al (2014), Mailly (2013) Yes Revision in AF, minimal change Baumann and Brewka (2010, 2012 Yes Enforcing and related problems Moguillansky et al (2013) Yes Prioritized revision of arguments Moguillansky et al (2008) Yes Ontology debugging Liao (2013) Yes Belief revision Krümpelmann et al (2012) Yes Non-prioritized belief revision…”

“…Moguillansky et al . (2013) studied argumentation within DeLP. They defined prioritized argument revision operators for a given DeLP.…”

“…Some researchers addressed problems connected to belief change in instantiated argumentation systems (structured argumentation frameworks with a subargument relation). Moguillansky et al (2013) studied argumentation within DeLP. They defined prioritized argument revision operators for a given DeLP.…”

A principle-based robustness analysis of admissibility-based argumentation semantics

“…For example, the question of whether and how an argumentation framework can be changed in order to enforce some result, such as the acceptance of a given set of arguments, is referred to as the enforcement problem [11,12,20,39,52,53,62]. Change in argumentation has furthermore been related to (or modelled using tools of) theories of belief change, often taking an AGM-inspired approach [13,14,25,34,[36][37][38]45,[48][49][50]57,59]. Computational issues in a dynamic setting have also been studied, such as efficiently (re)computing extensions after an argumentation framework changes [1,6,46].…”