Alexander Hahn
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Alexander Hahn has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Christoph Beierle
FernUniversität in Hagen
5 shared publications - Gabriele Kern-Isberner
TU Dortmund University
4 shared publications - Lars-Phillip Spiegel
FernUniversität in Hagen
4 shared publications - Jonas Haldimann
Institute of Logic and Computation, TU Wien, Vienna, Austria
2 shared publications Gabriele Kern-Isberner
TU Dortmund University
1 shared publication
Latest Publications
- 16 June 2026
- Published by Springer Nature
- p. 377-397
Inductive Nonmonotonic Reasoning Based on Defeasible and Indefeasible Beliefs
- 16 June 2026
- Published by Springer Nature
- p. 377-397
Inductive Nonmonotonic Reasoning Based on Defeasible and Indefeasible Beliefs
- Open Access
- 21 March 2026
- Published by SAGE Publications in The European Journal on Artificial Intelligence
- Vol. 39 (4) , 795-828
Representation Invariance for Epistemic Revision Operators
In this article, we investigate the issue of representing total preorders by ranking functions in belief revision scenarios. Both total preorders and Spohn’s ranking functions are most popular semantic structures in nonmonotonic reasoning and belief revision. While each ranking function uniquely induces a total preorder, total preorders can usually be represented by infinitely many ranking functions which only differ in the position of their empty layers. In order to work towards representation invariance of total preorders by ranking functions, we first introduce the notion of revision equivalence which postulates that equivalence is preserved during (most general) revision operations. Moreover, we single out so-called linearly equivalent ranking functions as prototypes of ranking functions with regularly inserted empty layers. We show that, in general, revision equivalence is hard to achieve, which prompts us to take a more operator-focused perspective. We introduce the postulates Preservation of Equivalence (PoE) and Preservation of Scale (PoS) in order to axiomatize operators which can guarantee that the equivalence resp. linear equivalence including the scaling factor between ranking functions is preserved. Afterwards, we evaluate various iterated revision operators from the literature with respect to these postulates. While (PoE) and (PoS) do not generally hold for revision operators in the Darwiche–Pearl framework, we show that strategic c-revisions with suitably chosen strategies are scale-preserving with respect to linearly equivalent ranking functions. Furthermore, we present approaches to defining equivalence- and scale-preserving revision operators for ranking functions from arbitrary existing revision operators.
- 21 March 2026
- Published by SAGE Publications in The European Journal on Artificial Intelligence
- Vol. 39 (4) , 795-828
Open AccessRepresentation Invariance for Epistemic Revision Operators
In this article, we investigate the issue of representing total preorders by ranking functions in belief revision scenarios. Both total preorders and Spohn’s ranking functions are most popular semantic structures in nonmonotonic reasoning and belief revision. While each ranking function uniquely induces a total preorder, total preorders can usually be represented by infinitely many ranking functions which only differ in the position of their empty layers. In order to work towards representation invariance of total preorders by ranking functions, we first introduce the notion of revision equivalence which postulates that equivalence is preserved during (most general) revision operations. Moreover, we single out so-called linearly equivalent ranking functions as prototypes of ranking functions with regularly inserted empty layers. We show that, in general, revision equivalence is hard to achieve, which prompts us to take a more operator-focused perspective. We introduce the postulates Preservation of Equivalence (PoE) and Preservation of Scale (PoS) in order to axiomatize operators which can guarantee that the equivalence resp. linear equivalence including the scaling factor between ranking functions is preserved. Afterwards, we evaluate various iterated revision operators from the literature with respect to these postulates. While (PoE) and (PoS) do not generally hold for revision operators in the Darwiche–Pearl framework, we show that strategic c-revisions with suitably chosen strategies are scale-preserving with respect to linearly equivalent ranking functions. Furthermore, we present approaches to defining equivalence- and scale-preserving revision operators for ranking functions from arbitrary existing revision operators.
- 20 March 2026
- Published by Springer Nature
- p. 134-153
Conditional Constraint and Solution Splittings of Belief Bases in the Context of c-Representations
- 20 March 2026
- Published by Springer Nature
- p. 134-153
Conditional Constraint and Solution Splittings of Belief Bases in the Context of c-Representations
- 24 September 2025
- Published by Springer Nature
- p. 285-300
Explaining Changes in Total Preorders and Ranking Functions
- 24 September 2025
- Published by Springer Nature
- p. 285-300
Explaining Changes in Total Preorders and Ranking Functions
- Open Access
- 1 November 2024
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 21 (1) , 498-508
Total Preorders vs Ranking Functions under Belief Revision – the Dynamics of Empty Layers
Total preorders and Spohn’s ranking functions are most popular semantic structures in nonmonotonic reasoning and belief revision. Each ranking function uniquely induces a total preorder, while each total preorder corresponds to infinitely many ranking functions because of the empty layers that ranking functions may have. In this paper, we adopt a dynamic perspective and investigate the role of empty layers in belief revision scenarios. We strengthen the notion of (inferential) equivalence of ranking functions by introducing revision equivalence which postulates the equivalence of ranking functions after (most general) revision operations. Moreover, we single out so-called linearly equivalent ranking functions as prototypes of ranking functions with regularly inserted empty layers. Such ranking functions are most suitable to provide an invariance property for revision equivalence which claims that linear equivalence should be preserved. We show that strategic c-revisions ensure (conditional) revision equivalence of linearly equivalent ranking functions if the strategies are adequately chosen, whereas the Darwiche-Pearl postulates for iterated revision alone are not enough to guarantee revision equivalence of ranking functions. We evaluate various other iterated revision approaches from the literature with respect to revision equivalence and preserving linear equivalence under revision. Furthermore, we present an approach to defining equivalence preserving revision operators for ranking functions from revision operators for total preorders.
- 1 November 2024
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 21 (1) , 498-508
Open AccessTotal Preorders vs Ranking Functions under Belief Revision – the Dynamics of Empty Layers
Total preorders and Spohn’s ranking functions are most popular semantic structures in nonmonotonic reasoning and belief revision. Each ranking function uniquely induces a total preorder, while each total preorder corresponds to infinitely many ranking functions because of the empty layers that ranking functions may have. In this paper, we adopt a dynamic perspective and investigate the role of empty layers in belief revision scenarios. We strengthen the notion of (inferential) equivalence of ranking functions by introducing revision equivalence which postulates the equivalence of ranking functions after (most general) revision operations. Moreover, we single out so-called linearly equivalent ranking functions as prototypes of ranking functions with regularly inserted empty layers. Such ranking functions are most suitable to provide an invariance property for revision equivalence which claims that linear equivalence should be preserved. We show that strategic c-revisions ensure (conditional) revision equivalence of linearly equivalent ranking functions if the strategies are adequately chosen, whereas the Darwiche-Pearl postulates for iterated revision alone are not enough to guarantee revision equivalence of ranking functions. We evaluate various other iterated revision approaches from the literature with respect to revision equivalence and preserving linear equivalence under revision. Furthermore, we present an approach to defining equivalence preserving revision operators for ranking functions from revision operators for total preorders.