Hostname: page-component-77f85d65b8-8v9h9 Total loading time: 0 Render date: 2026-04-19T05:18:23.611Z Has data issue: false hasContentIssue false

Inductive inference from weakly consistent belief bases

Published online by Cambridge University Press:  03 December 2025

Jonas Philipp Haldimann
Affiliation:
Institute for Logic and Computation, TU Wien, 1040 Vienna, Austria University of Cape Town and CAIR, 7700 Cape Town, South Africa
Christoph Beierle*
Affiliation:
Department of Mathematics and Computer Science, FernUniversität in Hagen, 58084 Hagen, Germany
Gabriele Kern-Isberner
Affiliation:
Department of Computer Science, TU Dortmund University, 44227 Dortmund, Germany
*
Corresponding author: Christoph Beierle; Email: christoph.beierle@fernuni-hagen.de
Rights & Permissions [Opens in a new window]

Abstract

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.

Information

Type
Research Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2025. Published by Cambridge University Press
Figure 0

Figure 1. The system P postulates for nonmonotonic inference relations.

Figure 1

Table 1. Verification (${\textsf{v}}$) and falsification (${\textsf{f}}$) of the conditionals in $\Delta$ from Example 21 and their corresponding impacts. The ranking function $\kappa_{\vec{\eta}}$ induced by the impacts $\vec{\eta} = (\eta_{1}, \eta_{2}, \eta_{3}) = (\infty, 1, \infty)$ is an extended c-representation for $\Delta$

Figure 2

Figure 2. A Summary of inductive inference operators and theirinterrelationships. The left-most column indicates whether theinference operator is defined on weakly consistent belief bases or onstrongly consistent belief bases only. The right-most columnindicates the class of c-representations that the inference operator takes into account. An arrow $I_1\, {-\!\!-\!\!\!\lt}\ I_2$ indicates that the inductive inference operator $I_1$ and the restriction of $I_2$ to strongly consistent belief bases coincide. A double line $I_1 = I_2$ indicates that $I_1$ and $I_2$ coincide. An arrow $I_1 \, {\hookrightarrow} \, I_2$ indicates that $I_1$ is captured by $I_2$ and that $I_1$ is strictly extended by $I_2$ for some belief bases.