Institute for Logic and Computation, TU Wien, 1040 Vienna, Austria"/> University of Cape Town and CAIR, 7700 Cape Town, South Africa"/> Department of Mathematics and Computer Science, FernUniversität in Hagen, 58084 Hagen, Germany"/> Department of Computer Science, TU Dortmund University, 44227 Dortmund, Germany"/>
Search
  • All Journals
Advanced Search
Search articles by Title, Author, Keywords, DOI
Submit Manuscript
7.7CiteScore
2.0Impact Factor
Advanced Search
MAP  >  The Knowledge Engineering Review
2025 Volume 40
Article Contents
Next Previous
RESEARCH ARTICLE   Open Access    

Inductive inference from weakly consistent belief bases

  • Institute for Logic and Computation, TU Wien, 1040 Vienna, Austria

  • University of Cape Town and CAIR, 7700 Cape Town, South Africa

  • Department of Mathematics and Computer Science, FernUniversität in Hagen, 58084 Hagen, Germany

  • Department of Computer Science, TU Dortmund University, 44227 Dortmund, Germany

More Information
  • 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.
  • 加载中
  • Adams , E. W. 1975. The Logic of Conditionals: An Application of Probability to Deductive Logic, Synthese Library. Springer Science+Business Media.

    Google Scholar

    Beierle , C., Eichhorn , C. & Kern-Isberner , G. 2016a. Skeptical inference based on c-representations and its characterization as a constraint satisfaction problem. In Foundations of Information and Knowledge Systems - 9th International Symposium, FoIKS 2016, Linz, Austria, March 7–11, 2016. Proceedings, Gyssens , M. & Simari , G. (eds). LNCS 9616, 65–82. Springer. https://doi.org/10.1007/978-3-319-30024-5_4

    Google Scholar

    Beierle , C., Eichhorn , C., Kern-Isberner , G. & Kutsch , S. 2016b. Skeptical, weakly skeptical, and credulous inference based on preferred ranking functions. In Proceedings 22nd European Conference on Artificial Intelligence, ECAI-2016, Kaminka , G. A., Fox , M., Bouquet , P., Hüllermeier , E., Dignum , V., Dignum , F. & van Harmelen , F. (eds). Frontiers in Artificial Intelligence and Applications 285, 1149–1157. IOS Press. https://doi.org/10.3233/978-1-61499-672-9-1149

    Google Scholar

    Beierle , C., Eichhorn , C., Kern-Isberner , G. & Kutsch , S. 2018. Properties of skeptical c-inference for conditional knowledge bases and its realization as a constraint satisfaction problem. Annals of Mathematics and Artificial Intelligence 83(3-4), 247–275. https://doi.org/10.1007/s10472-017-9571-9

    Google Scholar

    Beierle , C., Eichhorn , C., Kern-Isberner , G. & Kutsch , S. 2021. Properties and interrelationships of skeptical, weakly skeptical, and credulous inference induced by classes of minimal models. Artificial Intelligence 297, 103489. https://doi.org/10.1016/j.artint.2021.103489

    Google Scholar

    Beierle , C., Eichhorn , C. & Kutsch , S. 2017. A practical comparison of qualitative inferences with preferred ranking models. KI – Künstliche Intelligenz 31(1), 41–52. https://doi.org/10.1007/s13218-016-0453-9

    Google Scholar

    Beierle , C., Haldimann , J., Sanin , A., Schwarzer , L., Spang , A., Spiegel , L. & von Berg , M. 2024. Scaling up reasoning from conditional belief bases. In Scalable Uncertainty Management - 16th International Conference, SUM 2024, Palermo, Italy, November 27–29, 2024, Proceedings, Destercke , S., Martinez , M. V. & Sanfilippo , G. (eds). LNCS 15350, 29–44. Springer. https://doi.org/10.1007/978-3-031-76235-2_3

    Google Scholar

    Beierle , C., Haldimann , J., Sanin , A., Spang , A., Spiegel , L. & von Berg , M. 2025. The InfOCF library for reasoning with conditional belief bases. In Logics in Artificial Intelligence, 19th European Conference (JELIA 2026), Proceedings, Part II, Casini , G., Dundua , B. & Kutsia , T. (eds). LNAI 16094, 19–27. Springer. https://doi.org/10.1007/978-3-032-04590-4_2

    Google Scholar

    Beierle , C., Kutsch , S. & Breuers , H. 2019a. On rational monotony and weak rational monotony for inference relations induced by sets of minimal c-representations. In Proceedings of the Thirty-Second International Florida Artificial Intelligence Research Society Conference, Sarasota, Florida, USA, May 19–22 2019, Barták , R. & Brawner , K. W. (eds), 458–463. AAAI Press. https://aaai.org/ocs/index.php/FLAIRS/FLAIRS19/paper/view/18229

    Google Scholar

    Beierle , C., Kutsch , S. & Sauerwald , K. 2019b. Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations. Annals of Mathematics and Artificial Intelligence 87(1-2), 5–41. https://doi.org/10.1007/s10472-019-09653-7

    Google Scholar

    Beierle , C., Spiegel , L.-P., Haldimann , J., Wilhelm , M., Heyninck , J. & Kern-Isberner , G. 2024. Conditional splittings of belief bases and nonmonotonic inference with c-representations. In Principles of Knowledge Representation and Reasoning: Proceedings of the 21st International Conference, KR 2024, Marquis , P., Ortiz , M. & Pagnucco , M. (eds), 106–116. https://doi.org/10.24963/kr.2024/10

    Google Scholar

    Beierle , C., von Berg , M. & Sanin , A. 2022. Realization of c-inference as a SAT problem. In Proceedings of the Thirty-Fifth International Florida Artificial Intelligence Research Society Conference (FLAIRS), Hutchinson Island, Florida, USA, May 15–18, 2022, Keshtkar , F. & Franklin , M. (eds). https://doi.org/10.32473/flairs.v35i.130663

    Google Scholar

    Casini , G., Meyer , T. & Varzinczak , I. 2019. Taking defeasible entailment beyond rational closure. In Logics in Artificial Intelligence - 16th European Conference, JELIA 2019, Rende, Italy, May 7–11, 2019, Proceedings, Calimeri , F., Leone , N. & Manna , M. (eds). LNCS 11468, 182–197. Springer. https://doi.org/10.1007/978-3-030-19570-0_12

    Google Scholar

    Casini , G. & Straccia , U. 2013. Defeasible inheritance-based description logics. Journal of Artificial Intelligence Research 48, 415–473. https://doi.org/10.1613/jair.4062

    Google Scholar

    Darwiche , A. & Pearl , J. 1997. On the logic of iterated belief revision. Artificial Intelligence 89(1-2), 1–29.10.1016/S0004-3702(96)00038-0

    Google Scholar

    de Finetti , B. 1937. La prévision, ses lois logiques et ses sources subjectives. Annales de l’Institut Henri Poincaré 7(1), 1–68. Engl. transl. Theory of Probability, J. Wiley & Sons, 1974.

    Google Scholar

    Giordano , L., Gliozzi , V., Olivetti , N. & Pozzato , G. L. 2015. Semantic characterization of rational closure: From propositional logic to description logics. Artificial Intelligence 226, 1–33. https://doi.org/10.1016/j.artint.2015.05.001

    Google Scholar

    Goldszmidt , M. & Pearl , J. 1990. On the relation between rational closure and system-z. In Proceedings of the Third International Workshop on Nonmonotonic Reasoning, May 31–June 3, 130–140.

    Google Scholar

    Goldszmidt , M. & Pearl , J. 1996. Qualitative probabilities for default reasoning, belief revision, and causal modeling. Artificial Intelligence 84, 57–112.10.1016/0004-3702(95)00090-9

    Google Scholar

    Haldimann , J. & Beierle , C. 2024. Approximations of system W for inference from strongly and weakly consistent belief bases. International Journal of Approximate Reasoning 175, 109295. https://doi.org/10.1016/j.ijar.2024.109295

    Google Scholar

    Haldimann , J., Beierle , C. & Kern-Isberner , G. 2024. Syntax splitting and reasoning from weakly consistent conditional belief bases with c-inference. In Foundations of Information and Knowledge Systems - 13th International Symposium, FoIKS 2024, Meier , A. & Ortiz , M. (eds). LNCS 14589, 85–103. Springer. https://doi.org/10.1007/978-3-031-56940-1_5

    Google Scholar

    Haldimann , J., Beierle , C., Kern-Isberner , G. & Meyer , T. 2023. Conditionals, infeasible worlds, and reasoning with system W. In Proceedings of the Thirty-Sixth International Florida Artificial Intelligence Research Society Conference, Chun , S. A. & Franklin , M. (eds). https://doi.org/10.32473/flairs.36.133268

    Google Scholar

    Heyninck , J., Kern-Isberner , G., Meyer , T., Haldimann , J. P. & Beierle , C. 2023. Conditional syntax splitting for non-monotonic inference operators. In Proceedings of the 37th AAAI Conference on Artificial Intelligence, Williams , B., Chen , Y. & Neville , J. (eds), 37, 6416–6424. https://doi.org/10.1609/aaai.v37i5.25789

    Google Scholar

    Kern-Isberner , G. 2001. Conditionals in Nonmonotonic Reasoning and Belief Revision. LNAI 2087. Springer.10.1007/3-540-44600-1

    Google Scholar

    Kern-Isberner , G. 2004. A thorough axiomatization of a principle of conditional preservation in belief revision. Annals of Mathematics and Artificial Intelligence 40(1-2), 127–164.10.1023/A:1026110129951

    Google Scholar

    Kern-Isberner , G., Beierle , C. & Brewka , G. 2020. Syntax splitting = relevance + independence: New postulates for nonmonotonic reasoning from conditional belief bases. In Principles of Knowledge Representation and Reasoning: Proceedings of the 17th International Conference, KR 2020, Calvanese , D., Erdem , E. & Thielscher , M. (eds), 560–571. IJCAI Organization. https://doi.org/10.24963/kr.2020/56

    Google Scholar

    Kern-Isberner , G. & Brewka , G. 2017. Strong syntax splitting for iterated belief revision. In Proceedings International Joint Conference on Artificial Intelligence, IJCAI 2017, Sierra, C. (ed.), 1131–1137. ijcai.org.10.24963/ijcai.2017/157

    Google Scholar

    Komo , C. & Beierle , C. 2020. Nonmonotonic inferences with qualitative conditionals based on preferred structures on worlds. In KI 2020: Advances in Artificial Intelligence - 43rd German Conference on AI, Bamberg, Germany, September 21–25, 2020, Proceedings, Schmid , U., Klügl , F. & Wolter , D. (eds). LNCS 12325. Springer, 102–115. https://doi.org/10.1007/978-3-030-58285-2_8

    Google Scholar

    Komo , C. & Beierle , C. 2022. Nonmonotonic reasoning from conditional knowledge bases with system W. Annals of Mathematics and Artificial Intelligence 90(1), 107–144. https://doi.org/10.1007/s10472-021-09777-9

    Google Scholar

    Kraus , S., Lehmann , D. & Magidor , M. 1990. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 44(1-2), 167–207.10.1016/0004-3702(90)90101-5

    Google Scholar

    Kutsch , S. 2021. Knowledge Representation and Inductive Reasoning Using Conditional Logic and Sets of Ranking Functions. Dissertations in Artificial Intelligence 350. IOS Press. Dissertation at the University of Hagen, Germany.10.3233/DAI350

    Google Scholar

    Kutsch , S. & Beierle , C. 2021. InfOCF-Web: An online tool for nonmonotonic reasoning with conditionals and ranking functions. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Zhou, Z. (ed.), 4996–4999. ijcai.org. https://doi.org/10.24963/ijcai.2021/711

    Google Scholar

    Lehmann , D. 1989. What does a conditional knowledge base entail?. In Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR’89). Toronto, Canada, May 15–18 1989, Brachman , R. J., Levesque , H. J. & Reiter , R. (eds), 212–222. Morgan Kaufmann.

    Google Scholar

    Lehmann , D. J. & Magidor , M. 1992. What does a conditional knowledge base entail?. Artificial Intelligence 55(1), 1–60.10.1016/0004-3702(92)90041-U

    Google Scholar

    Parikh , R. 1999. Beliefs, belief revision, and splitting languages. Logic, Language, and Computation 2, 266–278.

    Google Scholar

    Pearl , J. 1990. System Z: A natural ordering of defaults with tractable applications to nonmonotonic reasoning. In Proc. of the 3rd Conf. on Theoretical Aspects of Reasoning about Knowledge (TARK’1990), 121–135. Morgan Kaufmann Publ. Inc.

    Google Scholar

    Priest , G. 1979. The logic of paradox. Journal of Philosophical Logic 8(1), 219–241. https://doi.org/10.1007/BF00258428

    Google Scholar

    Reiter , R. 1980. A logic for default reasoning. Artificial Intelligence 13, 81–132.10.1016/0004-3702(80)90014-4

    Google Scholar

    Rott , H. 2001. Change, Choice and Inference: A Study of Belief Revision and Nonmonotonic Reasoning. Oxford University Press.10.1093/oso/9780198503064.001.0001

    Google Scholar

    Spohn , W. 1988. Ordinal conditional functions: A dynamic theory of epistemic states. In Causation in Decision, Belief Change, and Statistics, II, Harper , W. & Skyrms , B. (eds), 105–134. Kluwer Academic Publishers.10.1007/978-94-009-2865-7_6

    Google Scholar

    Spohn , W. 2012. The Laws of Belief: Ranking Theory and Its Philosophical Applications. Oxford University Press.10.1093/acprof:oso/9780199697502.001.0001

    Google Scholar

    von Berg , M., Sanin , A. & Beierle , C. 2023. Representing nonmonotonic inference based on c-representations as an SMT problem. In Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 17th European Conference, ECSQARU 2023, Bouraoui , Z., Jabbour , S. & Vesic , S. (eds). LNCS 14249, 210–223. Springer. https://doi.org/10.1007/978-3-031-45608-4_17

    Google Scholar

    von Berg , M., Sanin , A. & Beierle , C. 2024. Scaling up nonmonotonic c-inference via partial MaxSAT problems. In Foundations of Information and Knowledge Systems - 13th International Symposium, FoIKS 2024, Meier , A. & Ortiz , M. (eds). LNCS 14589, 182–200. Springer. https://doi.org/10.1007/978-3-031-56940-1_10

    Google Scholar

    Wilhelm , M., Kern-Isberner , G. & Beierle , C. 2024. Core c-representations and c-core closure for conditional belief bases. In Foundations of Information and Knowledge Systems - 13th International Symposium, FoIKS 2024, Sheffield, UK, April 8–11, 2024, Proceedings, Meier , A. & Ortiz , M. (eds). LNCS 14589, 104–122. Springer. https://doi.org/10.1007/978-3-031-56940-1_6

    Google Scholar

  • Cite this article

    Jonas Philipp Haldimann, Christoph Beierle, Gabriele Kern-Isberner. 2025. Inductive inference from weakly consistent belief bases. The Knowledge Engineering Review 40(1), doi: 10.1017/S0269888925100088
    Jonas Philipp Haldimann, Christoph Beierle, Gabriele Kern-Isberner. 2025. Inductive inference from weakly consistent belief bases. The Knowledge Engineering Review 40(1), doi: 10.1017/S0269888925100088
    shu
Download PDF

Article Metrics

Article views(118) PDF downloads(55)

Other Articles By Authors

RESEARCH ARTICLE   Open Access    

Inductive inference from weakly consistent belief bases

  • Institute for Logic and Computation, TU Wien, 1040 Vienna, Austria

  • University of Cape Town and CAIR, 7700 Cape Town, South Africa

  • Department of Mathematics and Computer Science, FernUniversität in Hagen, 58084 Hagen, Germany

  • Department of Computer Science, TU Dortmund University, 44227 Dortmund, Germany

  • Received: 26 December 2024
  • Revised: 25 October 2025
  • Accepted: 29 October 2025
  • Published online: 03 December 2025
The Knowledge Engineering Review  40,  2025, 40(1)  |  Cite this article

Abstract: 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.

    HTML

    Acknowledgments

    • This work was supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation)—512363537, grant BE 1700/12-1 awarded to Christoph Beierle.

    • This work was partially supported by the Austrian Science Fund (FWF) projects P30873, PIN8884924, and the FWF and netidee SCIENCE project T1349-N.

    Rights and permissions
    • 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.
References (44)
  • About this article
    Cite this article
    Jonas Philipp Haldimann, Christoph Beierle, Gabriele Kern-Isberner. 2025. Inductive inference from weakly consistent belief bases. The Knowledge Engineering Review 40(1), doi: 10.1017/S0269888925100088
    Jonas Philipp Haldimann, Christoph Beierle, Gabriele Kern-Isberner. 2025. Inductive inference from weakly consistent belief bases. The Knowledge Engineering Review 40(1), doi: 10.1017/S0269888925100088
    shu

    • Catalog

      /

      DownLoad:  Full-Size Img  PowerPoint
      Return
      Return