Skip to main content

Belief Change Properties of Forgetting Operations over Ranking Functions

  • Conference paper
  • First Online:
PRICAI 2019: Trends in Artificial Intelligence (PRICAI 2019)

Abstract

Intentional forgetting means to deliberately give up information and is a crucial part of change or consolidation processes, or to make knowledge more compact. Two well-known forgetting operations are contraction in the AGM theory of belief change, and various types of variable elimination in logic programming. While previous work dealt with postulates being inspired from logic programming, in this paper we focus on evaluating forgetting in epistemic states according to postulates coming from AGM belief change theory. We consider different forms of contraction, marginalization, and conditionalization as major representatives of forgetting operators to be evaluated. We use Spohn’s ranking functions as a common semantic base to show that all operations can be realized in one logical framework, thereby exploring the richness of forgetting operations in a comparable way.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Alchourrón, C.E., Gärdenfors, P., Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. J. Symb. Logic 50(2), 510–530 (1985)

    Article  MathSciNet  Google Scholar 

  2. Beierle, C., Kern-Isberner, G., Sauerwald, K., Bock, T., Ragni, M.: Towards a general framework for kinds of forgetting in common-sense belief management. KI - Künstliche Intelligenz 33(1), 57–68 (2019)

    Article  Google Scholar 

  3. Caridroit, T., Konieczny, S., Marquis, P.: Contraction in propositional logic. Int. J. Approx. Reason. 80, 428–442 (2017)

    Article  MathSciNet  Google Scholar 

  4. Chopra, S., Ghose, A., Meyer, T.A., Wong, K.-S.: Iterated belief change and the recovery axiom. J. Philos. Logic 37(5), 501–520 (2008)

    Article  MathSciNet  Google Scholar 

  5. 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 Probab. J. (1974). Wiley

    Google Scholar 

  6. Eiter, T., Fink, M., Sabbatini, G., Tompits, H.: On updates of logic programs: semantics and properties. Technical report, TU Vienna (2001)

    Google Scholar 

  7. Eiter, T., Kern-Isberner, G.: A brief survey on forgetting from a knowledge representation and reasoning perspective. KI 33(1), 9–33 (2019)

    Google Scholar 

  8. Fermé, E.L., Saez, K., Sanz, P.: Multiple kernel contraction. Stud. Logica 73(2), 183–195 (2003)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  10. Gonçalves, R., Knorr, M., Leite, J.: The ultimate guide to forgetting in answer set programming. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, pp. 135–144. AAAI Press (2016)

    Google Scholar 

  11. Katsuno, H., Mendelzon, A.: Propositional knowledge base revision and minimal change. Artif. Intell. 52, 263–294 (1991)

    Article  MathSciNet  Google Scholar 

  12. Kern-Isberner, G., Bock, T., Beierle, C., Sauerwald, K.: Axiomatic evaluation of epistemic forgetting operators. In: Proceedings of the 32nd International FLAIRS Conference, FLAIRS-32, pp. 470–475. AAAI Press (2019)

    Google Scholar 

  13. Kern-Isberner, G., Bock, T., Sauerwald, K., Beierle, C.: Iterated contraction of propositions and conditionals under the principle of conditional preservation. In: 3rd Global Conference on Artificial Intelligence, GCAI 2017. EPiC Series in Computing, vol. 50, pp. 78–92. EasyChair (2017)

    Google Scholar 

  14. Konieczny, S., Pino Pérez, R.: On iterated contraction: syntactic characterization, representation theorem and limitations of the levi identity. In: Moral, S., Pivert, O., Sánchez, D., Marín, N. (eds.) SUM 2017. LNCS (LNAI), vol. 10564, pp. 348–362. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-67582-4_25

    Chapter  Google Scholar 

  15. Saribatur, Z.G., Eiter, T.: Omission-based abstraction for answer set programs. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, pp. 42–51. AAAI Press (2018)

    Google Scholar 

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

    Google Scholar 

  17. Spohn, W.: The Laws of Belief: Ranking Theory and Its Philosophical Applications. Oxford University Press, Oxford (2012)

    Book  Google Scholar 

Download references

Acknowledgements

The research reported here was supported by the German Research Society (DFG) within the Priority Research Program Intentional Forgetting in Organisations (DFG-SPP 1921; grants BE 1700/9-1, KE 1413/10-1).

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Gabriele Kern-Isberner , Tanja Bock , Kai Sauerwald or Christoph Beierle .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kern-Isberner, G., Bock, T., Sauerwald, K., Beierle, C. (2019). Belief Change Properties of Forgetting Operations over Ranking Functions. In: Nayak, A., Sharma, A. (eds) PRICAI 2019: Trends in Artificial Intelligence. PRICAI 2019. Lecture Notes in Computer Science(), vol 11670. Springer, Cham. https://doi.org/10.1007/978-3-030-29908-8_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-29908-8_37

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-29907-1

  • Online ISBN: 978-3-030-29908-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics