Aktuelles

Inhalte der Papiere

Kernel Contraction and the Order of Relevance

by Jandson S. Ribeiro

Abstract: The postulate of relevance provides a suitable and general notion of minimal change for belief contraction. Relevance is tightly connected to smooth kernel contractions when anagent’s epistemic state is represented as a logically closed set of formulae. This connection, however, breaks down whenan agent’s epistemic state is represented as a set of formulae not necessarily logically closed. We investigate the cause behind this schism, and we reconnect relevance with smooth kernel contractions by constraining the behaviour of their choice mechanisms and epistemic preference relations. Our first representation theorem connects smooth kernel contrations with a novel class of epistemic preference relations. For our second representation theorem, we introduce the principle of symmetry of remova lthat relates relevance to epistemic choices. For the last theorem, we devise a novel class of smooth kernel contractions, that satisfy relevance, which arebased on epistemic preference relations that capture the principle of symmetry of removal.

Defining Defense and Defeat in Abstract Argumentation From Scratch – A Generalizing Approach

by Lydia Blümel and Markus Ulbricht

Abstract: We propose a general framework to investigate semantics of Dung-style argumentation frameworks (AFs) by means of generic defeat operators. After establishing the technical foundations, we propose natural generic versions of Dung’s classical semantics. We demonstrate how classical as well asrecent proposals can be captured by our approach when utilizing suitable notions of defeat. We perform an investigation of basic properties which semantics inherit from the underlying defeat operator. In particular, we show under which conditions a counterpart to Dung’s fundamental lemma can be inferred and how it ensures the existence of the generalized version of complete extensions. We contribute to a principle-based study of AF semantics by discussing properties tailored to compare different defeat operators. Finally, we report computational complexity results for basic reasoning tasks which hold in our general framework.

Iterated Belief Change, Computationally

by Kai Sauerwald and Christoph Beierle

Abstract: This paper considers belief change in the Darwiche-Pearl framework. We demonstrate that iterative belief revision is Turing complete by showing how revision operators over ranking functions can simulate every Turing machine. Our result holds even under the condition that the broadly accepted Darwiche-Pearl postulates for iterated revision hold.

Weitere Informationen zur KR 2022