6 papers
On the Complexity of the Discussion-based Semantics in Abstract Argumentation
Lydia Blümel, Kai Sauerwald, Kenneth Skiba +1
We show that deciding whether an argument a is stronger than an argument b with respect to the discussion-based semantics of Amgoud and Ben-Naim is decidable in polynomial time. At…
Axiomatics of Restricted Choices by Linear Orders of Sets with Minimum as Fallback
Kai Sauerwald, Kenneth Skiba, Eduardo Fermé +1
We study how linear orders can be employed to realise choice functions for which the set of potential choices is restricted, i.e., the possible choice is not possible among the ful…
On the Complexity and Properties of Preferential Propositional Dependence Logic
Kai Sauerwald, Arne Meier, Juha Kontinen
This paper considers the complexity and properties of KLM-style preferential reasoning in the setting of propositional logic with team semantics and dependence atoms, also known as…
Credibility-Limited Revision for Epistemic Spaces
Kai Sauerwald
We consider credibility-limited revision in the framework of belief change for epistemic spaces, permitting inconsistent belief sets and inconsistent beliefs. In this unrestricted…
The Realizability of Revision and Contraction Operators in Epistemic Spaces
Kai Sauerwald, Matthias Thimm
This paper studies the realizability of belief revision and belief contraction operators in epistemic spaces. We observe that AGM revision and AGM contraction operators for epistem…
A Primer for Preferential Non-Monotonic Propositional Team Logics
Kai Sauerwald, Juha Kontinen
This paper considers KLM-style preferential non-monotonic reasoning in the setting of propositional team semantics. We show that team-based propositional logics naturally give rise…