Skip to main content

Changes of Relational Probabilistic Belief States and Their Computation under Optimum Entropy Semantics

  • Conference paper
KI 2013: Advances in Artificial Intelligence (KI 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8077))

Included in the following conference series:

Abstract

Coping with uncertain knowledge and changing beliefs is essential for reasoning in dynamic environments. We generalize an approach to adjust probabilistic belief states by use of the relative entropy in a propositional setting to relational languages. As a second contribution of this paper, we present a method to compute such belief changes by considering a dual problem and present first application and experimental results.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alchourrón, C., Gärdenfors, P., Makinson, D.: On the logic of theory change: Partial meet contraction and revision functions. Journal of Symbolic Logic 50(2), 510–530 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  2. Beierle, C., Kern-Isberner, G.: A conceptual agent model based on a uniform approach to various belief operations. In: Mertsching, B., Hund, M., Aziz, Z. (eds.) KI 2009. LNCS (LNAI), vol. 5803, pp. 273–280. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Csiszar, I.: I-Divergence Geometry of Probability Distributions and Minimization Problems. The Annals of Probability 3(1), 146–158 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  4. Finthammer, M., Beierle, C.: Using equivalences of worlds for aggregation semantics of relational conditionals. In: Glimm, B., Krüger, A. (eds.) KI 2012. LNCS (LNAI), vol. 7526, pp. 49–60. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  5. Finthammer, M., Beierle, C., Berger, B., Kern-Isberner, G.: Probabilistic reasoning at optimum entropy with the MEcore system. In: Lane, H.C., Guesgen, H.W. (eds.) Proc. FLAIRS-2009. AAAI Press, Menlo Park (2009)

    Google Scholar 

  6. Fisseler, J.: First-order probabilistic conditional logic and maximum entropy. Logic Journal of the IGPL 20(5), 796–830 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fletcher, R.: Practical methods of optimization, 2nd edn. Wiley-Interscience, New York (1987)

    MATH  Google Scholar 

  8. Grove, A., Halpern, J., Koller, D.: Random worlds and maximum entropy. J. of Artificial Intelligence Research 2, 33–88 (1994)

    MathSciNet  MATH  Google Scholar 

  9. Katsuno, H., Mendelzon, A.: Propositional knowledge base revision and minimal change. Artificial Intelligence 52, 263–294 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kern-Isberner, G.: Conditionals in Nonmonotonic Reasoning and Belief Revision. LNCS (LNAI), vol. 2087. Springer, Heidelberg (2001)

    Book  MATH  Google Scholar 

  11. Kern-Isberner, G.: Linking iterated belief change operations to nonmonotonic reasoning. In: Proc. KR 2008, pp. 166–176. AAAI Press, Menlo Park (2008)

    Google Scholar 

  12. Kern-Isberner, G., Thimm, M.: Novel semantical approaches to relational probabilistic conditionals. In: Proc. KR 2010, pp. 382–391. AAAI Press, Menlo Park (2010)

    Google Scholar 

  13. Koller, D., Friedman, N.: Probabilistic Graphical Models: Principles and Techniques. MIT Press (2009)

    Google Scholar 

  14. Lukasiewicz, T.: Probabilistic deduction with conditional constraints over basic events. J. Artif. Intell. Res. 10, 380–391 (1999)

    MathSciNet  Google Scholar 

  15. Nilsson, N.J.: Probabilistic logic. Artif. Intell. 28, 71–88 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  16. Paris, J.: The uncertain reasoner’s companion – A mathematical perspective. Cambridge University Press (1994)

    Google Scholar 

  17. Potyka, N.: Towards a general framework for maximum entropy reasoning. In: Proc. FLAIRS 2012, pp. 555–560. AAAI Press, Menlo Park (2012)

    Google Scholar 

  18. Zhu, C., Byrd, R.H., Lu, P., Nocedal, J.: Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Softw. 23(4), 550–560 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Potyka, N., Beierle, C., Kern-Isberner, G. (2013). Changes of Relational Probabilistic Belief States and Their Computation under Optimum Entropy Semantics. In: Timm, I.J., Thimm, M. (eds) KI 2013: Advances in Artificial Intelligence. KI 2013. Lecture Notes in Computer Science(), vol 8077. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40942-4_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40942-4_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40941-7

  • Online ISBN: 978-3-642-40942-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics