Showing 2025 · cs.AIShow all
2 papers · 2 filters
cs.AI2025
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…
cs.AI2025
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…