Skip to main content

Rational Closure Extension in SPO-Representable Inductive Inference Operators

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 2023)

Abstract

The class of inductive inference operators that extend rational closure, as introduced by Lehmann or via Pearl’s system Z, exhibits desirable inference characteristics. The property that formalizes this, known as (RC Extension), has recently been investigated for basic defeasible entailment relations. In this paper, we explore (RC Extension) for more general classes of inference relations. First, we semantically characterize (RC Extension) for preferential inference relations in general. Then we focus on operators that can be represented with strict partial orders (SPOs) on possible worlds and characterize SPO-representable inductive inference operators. Furthermore, we show that for SPO-representable inference operators, (RC Extension) is semantically characterized as a refinement of the Z-rank relation on possible worlds.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Adams, E.W.: The Logic of Conditionals: An Application of Probability to Deductive Logic. SYLI, Springer, Dordrecht (1975). https://doi.org/10.1007/978-94-015-7622-2

    Book  MATH  Google Scholar 

  2. Beierle, C., Eichhorn, C., Kern-Isberner, G., Kutsch, S.: Properties and interrelationships of skeptical, weakly skeptical, and credulous inference induced by classes of minimal models. Artif. Intell. 297, 103489 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  3. Beierle, C., Haldimann, J.: Normal forms of conditional belief bases respecting inductive inference. In: Keshtkar, F., Franklin, M. (eds.) Proceedings of the Thirty-Fifth International Florida Artificial Intelligence Research Society Conference (FLAIRS), Hutchinson Island, Florida, USA, 15–18 May 2022 (2022)

    Google Scholar 

  4. Beierle, C., Haldimann, J., Kutsch, S.: A complete map of conditional knowledge bases in different normal forms and their induced system P inference relations over small signatures. In: Bell, E., Keshtkar, F. (eds.) Proceedings of the Thirty-Fourth International Florida Artificial Intelligence Research Society Conference, North Miami Beach, Florida, USA, 17–19 May 2021 (2021). https://doi.org/10.32473/flairs.v34i1.128467

  5. Beierle, C., Haldimann, J., Schwarzer, L.: Observational equivalence of conditional belief bases. In: Chun, S.A., Franklin, M. (eds.) Proceedings of the Thirty-Sixth International Florida Artificial Intelligence Research Society Conference (2023)

    Google Scholar 

  6. Benferhat, S., Cayrol, C., Dubois, D., Lang, J., Prade, H.: Inconsistency management and prioritized syntax-based entailment. In: Proceedings of the IJCAI 1993, San Francisco, CA, USA, vol. 1, pp. 640–647. Morgan Kaufmann Publishers (1993)

    Google Scholar 

  7. Casini, G., Meyer, T., Varzinczak, I.: Taking defeasible entailment beyond rational closure. In: Calimeri, F., Leone, N., Manna, M. (eds.) JELIA 2019. LNCS (LNAI), vol. 11468, pp. 182–197. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-19570-0_12

    Chapter  Google Scholar 

  8. Darwiche, A., Pearl, J.: On the logic of iterated belief revision. Artif. Intell. 89(1–2), 1–29 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  9. de Finetti, B.: La prévision, ses lois logiques et ses sources subjectives. Ann. Inst. H. Poincaré 7(1), 1–68 (1937). Engl. transl. Theory of Probability (1974)

    Google Scholar 

  10. Freund, M.: Injective models and disjunctive relations. J. Log. Comput. 3(3), 231–247 (1993). https://doi.org/10.1093/logcom/3.3.231

    Article  MathSciNet  MATH  Google Scholar 

  11. Giordano, L., Gliozzi, V.: Reasoning about multiple aspects in DLs: semantics and closure construction. CoRR abs/1801.07161 (2018). http://arxiv.org/abs/1801.07161

  12. Giordano, L., Gliozzi, V.: A reconstruction of multipreference closure. Artif. Intell. 290, 103398 (2021). https://doi.org/10.1016/j.artint.2020.103398

    Article  MathSciNet  MATH  Google Scholar 

  13. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: Semantic characterization of rational closure: from propositional logic to description logics. Artif. Intell. 226, 1–33 (2015). https://doi.org/10.1016/j.artint.2015.05.001

    Article  MathSciNet  MATH  Google Scholar 

  14. Goldszmidt, M., Pearl, J.: Qualitative probabilities for default reasoning, belief revision, and causal modeling. Artif. Intell. 84, 57–112 (1996)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  16. Haldimann, J., Beierle, C.: Characterizing multipreference closure with system W. In: de Saint-Cyr, F.D., Öztürk-Escoffier, M., Potyka, N. (eds.) SUM 2022. LNCS, vol. 13562, pp. 79–91. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-18843-5_6

    Chapter  Google Scholar 

  17. Haldimann, J., Beierle, C.: Inference with system W satisfies syntax splitting. In: Kern-Isberner, G., Lakemeyer, G., Meyer, T. (eds.) Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, KR 2022, Haifa, Israel, 31 July–5 August 2022, pp. 405–409 (2022)

    Google Scholar 

  18. Haldimann, J., Beierle, C.: Properties of system W and its relationships to other inductive inference operators. In: Varzinczak, I. (ed.) FoIKS 2022. LNCS, vol. 13388, pp. 206–225. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-11321-5_12

    Chapter  MATH  Google Scholar 

  19. Haldimann, J., Beierle, C.: Approximations of system W between C-inference, system Z, and lexicographic inference. In: Bouraoui, Z., Jabbour, S., Vesic, S. (eds.) ECSQARU 2023. LNCS, Springer, Cham (2023)

    Google Scholar 

  20. Haldimann, J., Beierle, C., Kern-Isberner, G., Meyer, T.: Conditionals, infeasible worlds, and reasoning with system W. In: The International FLAIRS Conference Proceedings, vol. 36, no. 1 (2023)

    Google Scholar 

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

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

    Google Scholar 

  23. Komo, C., Beierle, C.: Nonmonotonic inferences with qualitative conditionals based on preferred structures on worlds. In: Schmid, U., Klügl, F., Wolter, D. (eds.) KI 2020. LNCS (LNAI), vol. 12325, pp. 102–115. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-58285-2_8

    Chapter  Google Scholar 

  24. Komo, C., Beierle, C.: Nonmonotonic reasoning from conditional knowledge bases with system W. Ann. Math. Artif. Intell. 90(1), 107–144 (2022)

    Article  MathSciNet  MATH  Google Scholar 

  25. Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artif. Intell. 44(1–2), 167–207 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  26. Lehmann, D., Magidor, M.: What does a conditional knowledge base entail? Artif. Intell. 55, 1–60 (1992)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  28. Lehmann, D.: Another perspective on default reasoning. Ann. Math. Artif. Intell. 15(1), 61–82 (1995). https://doi.org/10.1007/BF01535841

    Article  MathSciNet  MATH  Google Scholar 

  29. Makinson, D., Gärdenfors, P.: Relations between the logic of theory change and nonmonotonic logic. In: Fuhrmann, A., Morreau, M. (eds.) The Logic of Theory Change. LNCS, vol. 465, pp. 183–205. Springer, Heidelberg (1991). https://doi.org/10.1007/BFb0018421

    Chapter  MATH  Google Scholar 

  30. Pearl, J.: System Z: a natural ordering of defaults with tractable applications to nonmonotonic reasoning. In: Parikh, R. (ed.) Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning About Knowledge (TARK 1990), San Francisco, CA, USA, pp. 121–135. Morgan Kaufmann Publishers Inc. (1990)

    Google Scholar 

  31. Spohn, W.: Ordinal conditional functions: a dynamic theory of epistemic states. In: Harper, W., Skyrms, B. (eds.) Causation in Decision, Belief Change, and Statistics, II, pp. 105–134. Kluwer Academic Publishers (1988)

    Google Scholar 

Download references

Acknowledgements

This work was supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation), grant BE 1700/10-1 awarded to Christoph Beierle as part of the priority program “Intentional Forgetting in Organizations” (SPP 1921). Jonas Haldimann was supported by this grant.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jonas Haldimann .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Haldimann, J., Meyer, T., Kern-Isberner, G., Beierle, C. (2023). Rational Closure Extension in SPO-Representable Inductive Inference Operators. In: Gaggl, S., Martinez, M.V., Ortiz, M. (eds) Logics in Artificial Intelligence. JELIA 2023. Lecture Notes in Computer Science(), vol 14281. Springer, Cham. https://doi.org/10.1007/978-3-031-43619-2_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-43619-2_38

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-43618-5

  • Online ISBN: 978-3-031-43619-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics