Dynamics of knowledge in D<scp>e</scp>LP through Argument Theory Change
From MaRDI portal
Publication:5398286
DOI10.1017/S1471068411000603zbMATH Open1310.68052arXiv1111.6883OpenAlexW2962873208MaRDI QIDQ5398286
Guillermo R. Simari, Marcelo A. Falappa, Alejandro J. García, Martín O. Moguillansky, Nicolás D. Rotstein
Publication date: 27 February 2014
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1111.6883
Cites Work
- Title not available (Why is that?)
- Belief contraction without recovery
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- A textbook of belief dynamics. Theory change and database updating
- On the logic of theory change: Partial meet contraction and revision functions
- Explanations, belief revision and defeasible reasoning.
- Semi-revision
- Kernel contraction
- On principle-based evaluation of extension-based argumentation semantics
- Local change
- Reversing the Levi identity
- Belief revision and epistemology
- Subjunctives, dispositions and chances
Cited In (6)
- A general semi-structured formalism for computational argumentation: definition, properties, and examples of application
- Revision of defeasible preferences
- Merging operators on stratified belief bases equipped with argumentative inference
- 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
This page was built for publication: Dynamics of knowledge in D<scp>e</scp>LP through Argument Theory Change
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5398286)
