Aron Spang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Aron Spang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Christoph Beierle
FernUniversität in Hagen
3 shared publications - Jonas Haldimann
Institute of Logic and Computation, TU Wien, Vienna, Austria
3 shared publications - Lars-Phillip Spiegel
FernUniversität in Hagen
3 shared publications Arthur Sanin
FernUniversität in Hagen
1 shared publication- Martin von Berg
FernUniversität in Hagen
1 shared publication
Latest Publications
- Open Access
- 6 May 2026
- Published by University of Florida George A Smathers Libraries in Pediatrics in Review
- Vol. 39 (1)
Implementing Nonmonotonic Reasoning From Weakly Consistent Conditional Belief Bases
In this paper, we develop implementations of nonmonotonic reasoning from conditional belief bases that maycontain both defeasible and undefeasible, strict beliefs. Any belief base containing a strict belief fails to comply with the well-known consistency test by Goldszmidt and Pearl, and can be at most weakly consistent. Although weakly consistent belief bases have more expressive power, they have gained much less attention in research than strongly consistent belief bases. In particular, this observation holds for corresponding implementations. We introduce implementations of established nonmonotonic inference operators that can be applied to weakly consistent belief bases: p-entailment, system Z and thus rational closure, lexicographic inference, and system W. These implementations are integrated into an easy-to-use online reasoning platform. In a system walkthrough, we illustrate the additional functionalities and their effectiveness of the extended platform for dealing with weakly consistent belief bases.
- 6 May 2026
- Published by University of Florida George A Smathers Libraries in Pediatrics in Review
- Vol. 39 (1)
Open AccessImplementing Nonmonotonic Reasoning From Weakly Consistent Conditional Belief Bases
In this paper, we develop implementations of nonmonotonic reasoning from conditional belief bases that maycontain both defeasible and undefeasible, strict beliefs. Any belief base containing a strict belief fails to comply with the well-known consistency test by Goldszmidt and Pearl, and can be at most weakly consistent. Although weakly consistent belief bases have more expressive power, they have gained much less attention in research than strongly consistent belief bases. In particular, this observation holds for corresponding implementations. We introduce implementations of established nonmonotonic inference operators that can be applied to weakly consistent belief bases: p-entailment, system Z and thus rational closure, lexicographic inference, and system W. These implementations are integrated into an easy-to-use online reasoning platform. In a system walkthrough, we illustrate the additional functionalities and their effectiveness of the extended platform for dealing with weakly consistent belief bases.
- 24 September 2025
- Published by Springer Nature
- p. 301-315
Implementing Lexicographic Inference Using Partial MaxSAT
- 24 September 2025
- Published by Springer Nature
- p. 301-315
Implementing Lexicographic Inference Using Partial MaxSAT
- 29 August 2025
- Published by Springer Nature
- p. 19-27
The InfOCF Library for Reasoning With Conditional Belief Bases
- 29 August 2025
- Published by Springer Nature
- p. 19-27
The InfOCF Library for Reasoning With Conditional Belief Bases