Dynamics of knowledge in \textsc{DeLP} through argument theory change
From MaRDI portal
Publication:5398286
Abstract: 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 `a 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.
Recommendations
- Incremental computation for structured argumentation over dynamic DeLP knowledge bases
- Defeasible logic programming: an argumentative approach
- Inconsistent-tolerant base revision through argument theory change
- Argument graphs for defeasible logic programming
- Complexity of DeLP: current status and moving forward
Cites work
- A textbook of belief dynamics. Theory change and database updating
- Belief contraction without recovery
- Belief revision and epistemology
- Computational models of argument. Proceedings of COMMA 2008. 2nd international conference on computational models of argument, Toulouse, France, May 28--30, 2008
- Explanations, belief revision and defeasible reasoning.
- Kernel contraction
- Local change
- On principle-based evaluation of extension-based argumentation semantics
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the logic of theory change: Partial meet contraction and revision functions
- Reversing the Levi identity
- Semi-revision
- Subjunctives, dispositions and chances
Cited in
(14)- A general semi-structured formalism for computational argumentation: definition, properties, and examples of application
- Revision of defeasible preferences
- An Alternative Foundation for DeLP: Defeating Relations and Truth Values
- A quantitative approach to belief revision in structured probabilistic argumentation
- Complexity of DeLP: current status and moving forward
- Belief revision in structured probabilistic argumentation, model and application to cyber security
- On influence and contractions in defeasible logic programming
- Merging operators on stratified belief bases equipped with argumentative inference
- Argument graphs for defeasible logic programming
- Revising non-monotonic theories with sufficient and necessary conditions: the case of defeasible logic
- Incremental computation for structured argumentation over dynamic DeLP knowledge bases
- An extension-based approach to belief revision in abstract argumentation
- Introducing a tool for concurrent argumentation
- Argumentation in Multi-Agent Systems
This page was built for publication: Dynamics of knowledge in \textsc{DeLP} through argument theory change
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5398286)
