Christoph Beierle
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Christoph Beierle has a total of 71 co-authors. Here are the top co-authors by number of shared publications:
- Gabriele Kern-Isberner
TU Dortmund University
44 shared publications Gabriele Kern-Isberner
TU Dortmund University
27 shared publications- Jonas Haldimann
Institute of Logic and Computation, TU Wien, Vienna, Austria
25 shared publications - Kai Sauerwald
FernUniversität in Hagen
12 shared publications - Lars-Phillip Spiegel
FernUniversität in Hagen
9 shared publications - Alexander Hahn
TU Dortmund University
5 shared publications
Latest Publications
- Open Access
- 10 July 2026
- Published by Springer Nature
- p. 129-157
Intentional Forgetting Operators—Formal Foundations and Empirical Support
This chapter presents a framework for understanding intentional forgetting processes in humans that is jointly grounded in cognitive psychology and knowledge representation. It provides formal modeling structures, experimental designs, and best implementation practices. We identify kinds of forgetting, axiomatically formalize belief change operators involving forgetting, and elaborate their interrelationships. This general abstract framework is instantiated with conditional beliefs and realizations of forgetting operators employing ranking functions. On a cognitive level, we examine the cognitive mechanisms of intentional forgetting experimentally by employing the counting game paradigm. Our results show that changes to conditionals in procedural memory leave behind artifacts, which can improve performance when old and new conditionals align.
- 10 July 2026
- Published by Springer Nature
- p. 129-157
Open AccessIntentional Forgetting Operators—Formal Foundations and Empirical Support
This chapter presents a framework for understanding intentional forgetting processes in humans that is jointly grounded in cognitive psychology and knowledge representation. It provides formal modeling structures, experimental designs, and best implementation practices. We identify kinds of forgetting, axiomatically formalize belief change operators involving forgetting, and elaborate their interrelationships. This general abstract framework is instantiated with conditional beliefs and realizations of forgetting operators employing ranking functions. On a cognitive level, we examine the cognitive mechanisms of intentional forgetting experimentally by employing the counting game paradigm. Our results show that changes to conditionals in procedural memory leave behind artifacts, which can improve performance when old and new conditionals align.
- 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
- 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.
- Open Access
- 23 April 2026
- Published by SAGE Publications in The European Journal on Artificial Intelligence
- Vol. 39 (4) , 747-776
Conditional Syntax and Semantic Splittings of Strongly and Weakly Consistent Belief Bases
Conditional syntax splitting for inductive inference from conditional belief bases has been proposed as a generalization of syntax splitting, which also covers cases where the conditionals in the subbases may share some atoms. While p-entailment and system Z fail to satisfy conditional syntax splitting, two other inductive inference operators, lexicographic inference and system W, have been shown to satisfy this property for reasoning from strongly consistent belief bases. In this article, we introduce the concept of conditional semantic splitting of a belief base. For both syntax splitting and semantic splitting, we take not only strongly consistent belief bases into account, but also belief bases that are only weakly consistent, enforcing some worlds to be fully infeasible. We show that c-representations satisfy a core postulate relating conditional splittings on the syntax and the semantic level. Based on these findings, we investigate conditional syntax splitting for nonmonotonic inference with c-representations. Regarding single c-representations, we utilize the concept of selection strategies and show that a straightforward property of the selection strategy leads to inference operators satisfying conditional syntax splittings. Furthermore, we show that c-inference, taking all c-representations of a belief base into account fully complies with conditional syntax splitting, and we prove that credulous and weakly skeptical inference based on c-representations also satisfies conditional syntax splitting. In particular, we show that these syntax splitting properties hold for strongly consistent belief bases and also in the case of only weakly consistent belief bases.
- 23 April 2026
- Published by SAGE Publications in The European Journal on Artificial Intelligence
- Vol. 39 (4) , 747-776
Open AccessConditional Syntax and Semantic Splittings of Strongly and Weakly Consistent Belief Bases
Conditional syntax splitting for inductive inference from conditional belief bases has been proposed as a generalization of syntax splitting, which also covers cases where the conditionals in the subbases may share some atoms. While p-entailment and system Z fail to satisfy conditional syntax splitting, two other inductive inference operators, lexicographic inference and system W, have been shown to satisfy this property for reasoning from strongly consistent belief bases. In this article, we introduce the concept of conditional semantic splitting of a belief base. For both syntax splitting and semantic splitting, we take not only strongly consistent belief bases into account, but also belief bases that are only weakly consistent, enforcing some worlds to be fully infeasible. We show that c-representations satisfy a core postulate relating conditional splittings on the syntax and the semantic level. Based on these findings, we investigate conditional syntax splitting for nonmonotonic inference with c-representations. Regarding single c-representations, we utilize the concept of selection strategies and show that a straightforward property of the selection strategy leads to inference operators satisfying conditional syntax splittings. Furthermore, we show that c-inference, taking all c-representations of a belief base into account fully complies with conditional syntax splitting, and we prove that credulous and weakly skeptical inference based on c-representations also satisfies conditional syntax splitting. In particular, we show that these syntax splitting properties hold for strongly consistent belief bases and also in the case of only weakly consistent belief bases.
- 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
- Open Access
- 8 December 2025
- Published by SAGE Publications in The European Journal on Artificial Intelligence
- Vol. 39 (4) , 705-722
SPO-Representable Inductive Inference Operators Extending Rational Closure
Rational closure, as introduced by Lehmann or via Pearl’s system Z, exhibits desirable characteristics of nonmonotonic inference relations. The property (RC Extension), formalizing that an inductive inference operator extends rational closure, has recently been investigated for basic defeasible entailment relations. In this article, we explore (RC Extension) for more general classes of inference relations. We semantically characterize (RC Extension) for preferential inference relations in general by a specific type of preferential models. Then we focus on operators that can be represented with strict partial orders (SPOs) on possible worlds and characterize SPO-representable inductive inference operators. We show that for SPO-representable inference operators, (RC Extension) is semantically characterized by refinements of the Z-rank relation on possible worlds. Finally, we explore several examples of inference operators satisfying (RC Extension) and their interrelationships.
- 8 December 2025
- Published by SAGE Publications in The European Journal on Artificial Intelligence
- Vol. 39 (4) , 705-722
Open AccessSPO-Representable Inductive Inference Operators Extending Rational Closure
Rational closure, as introduced by Lehmann or via Pearl’s system Z, exhibits desirable characteristics of nonmonotonic inference relations. The property (RC Extension), formalizing that an inductive inference operator extends rational closure, has recently been investigated for basic defeasible entailment relations. In this article, we explore (RC Extension) for more general classes of inference relations. We semantically characterize (RC Extension) for preferential inference relations in general by a specific type of preferential models. Then we focus on operators that can be represented with strict partial orders (SPOs) on possible worlds and characterize SPO-representable inductive inference operators. We show that for SPO-representable inference operators, (RC Extension) is semantically characterized by refinements of the Z-rank relation on possible worlds. Finally, we explore several examples of inference operators satisfying (RC Extension) and their interrelationships.
- Open Access
- 3 December 2025
- Published by Maximum Academic Press in The Knowledge Engineering Review
- Vol. 40
Inductive inference from weakly consistent belief bases
We consider nonmonotonic inferences from belief bases that contain conditionals enforcing some of the possible worlds to be infeasible and thus completely implausible. In contrast to belief bases satisfying the strong notion of consistency requiring every world to be at least somewhat plausible, we call such belief bases weakly consistent. First, we review the treatment of weakly consistent belief bases by the seminal approaches of p-entailment, which coincides with system P, and of system Z, which coincides with rational closure. Then we focus on c-inference, an inductive inference operator that has been shown to exhibit many desirable properties put forward for nonmonotonic reasoning. It is based on c-representations, which are a special kind of ranking model ordering worlds according to their plausibility. While c-representation is defined for strongly consistent belief bases only, in this article, we extend the notions of c-representation and of c-inference to cover also weakly consistent belief bases. We adapt a constraint satisfaction problem (CSP) characterizing c-representations to capture extended c-representations, and we show how this extended CSP can be used to characterize extended c-inference, providing a basis for its implementation. We show various properties of extended c-inference and in particular, we prove that also the extended notion of c-inference fully satisfies syntax splitting. Furthermore, we extend and evaluate credulous and weakly skeptical c-inference to weakly consistent belief bases and provide characterizations for them as CSPs.
- 3 December 2025
- Published by Maximum Academic Press in The Knowledge Engineering Review
- Vol. 40
Open AccessInductive inference from weakly consistent belief bases
We consider nonmonotonic inferences from belief bases that contain conditionals enforcing some of the possible worlds to be infeasible and thus completely implausible. In contrast to belief bases satisfying the strong notion of consistency requiring every world to be at least somewhat plausible, we call such belief bases weakly consistent. First, we review the treatment of weakly consistent belief bases by the seminal approaches of p-entailment, which coincides with system P, and of system Z, which coincides with rational closure. Then we focus on c-inference, an inductive inference operator that has been shown to exhibit many desirable properties put forward for nonmonotonic reasoning. It is based on c-representations, which are a special kind of ranking model ordering worlds according to their plausibility. While c-representation is defined for strongly consistent belief bases only, in this article, we extend the notions of c-representation and of c-inference to cover also weakly consistent belief bases. We adapt a constraint satisfaction problem (CSP) characterizing c-representations to capture extended c-representations, and we show how this extended CSP can be used to characterize extended c-inference, providing a basis for its implementation. We show various properties of extended c-inference and in particular, we prove that also the extended notion of c-inference fully satisfies syntax splitting. Furthermore, we extend and evaluate credulous and weakly skeptical c-inference to weakly consistent belief bases and provide characterizations for them as CSPs.
- 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
- 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