Skip to main content
Log in

Concepts and Algorithms for Computing Maximum Entropy Distributions for Knowledge Bases with Relational Probabilistic Conditionals

  • Dissertation and Habilitation Abstracts
  • Published:
KI - Künstliche Intelligenz Aims and scope Submit manuscript

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Notes

  1. http://sourceforge.net/p/kreator-ide/code/HEAD/tree/Software/KreatorAggPlugin/tags/atomic_wci/.

  2. http://kreator-ide.sourceforge.net/.

References

  1. Beierle C, Kern-Isberner G, Finthammer M, Potyka N (2015) Extending and completing probabilistic knowledge and beliefs without bias. KI Künstliche Intelligenz 29(3):255–262

    Article  Google Scholar 

  2. Beierle C, Krämer A (2015) Achieving parametric uniformity for knowledge bases in a relational probabilistic conditional logic with maximum entropy semantics. Ann Math Artif Intell 73:1–2

    Article  MathSciNet  MATH  Google Scholar 

  3. Darroch JN, Ratcliff D (1972) Generalized iterative scaling for log-linear models. In: Annals of Mathematical Statistics, vol 43. Institute of Mathematical Statistics, pp 1470–1480

  4. Finthammer M (2017) Concepts and algorithms for computing maximum entropy distributions for knowledge bases with relational probabilistic conditionals. Dissertations in artificial intelligence. IOS Press

  5. Finthammer M, Beierle C (2016) On the relationship between aggregating semantics and FO-PCL grounding semantics for relational probabilistic conditionals. In: Beierle C, Brewka G, Thimm M (eds) Computational models of rationality. Essays Dedicated to Gabriele Kern-Isberner on the Occasion of her 60th Birthday, Tributes, vol 29. College Publications, pp 297–315

  6. Finthammer M, Thimm M (2012) An integrated development environment for probabilistic relational reasoning. Logic J IGPL 20(5):831–871

    Article  MathSciNet  MATH  Google Scholar 

  7. Fisseler J (2012) First-order probabilistic conditional logic and maximum entropy. Logic J IGPL 20:796–830

    Article  MathSciNet  MATH  Google Scholar 

  8. Kern-Isberner G (2001) Conditionals in nonmonotonic reasoning and belief revision, LNAI, vol 2087. Springer, New York

    Book  MATH  Google Scholar 

  9. Kern-Isberner G, Thimm M (2010) Novel semantical approaches to relational probabilistic conditionals. Proc KR 2010:382–392

    Google Scholar 

  10. Paris JB (1994) The uncertain reasoner’s companion. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  11. Thimm M, Kern-Isberner G (2012) On probabilistic inference in relational conditional logics. Logic J IGPL 20(5):872–908

    Article  MathSciNet  MATH  Google Scholar 

  12. Wilhelm M, Kern-Isberner G, Finthammer M, Beierle C (2018) A generalized iterative scaling algorithm for maximum entropy model computations respecting probabilistic independencies. In: Proceedings of FoIKS-2018

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marc Finthammer.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Finthammer, M. Concepts and Algorithms for Computing Maximum Entropy Distributions for Knowledge Bases with Relational Probabilistic Conditionals. Künstl Intell 33, 97–100 (2019). https://doi.org/10.1007/s13218-018-00572-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13218-018-00572-z

Keywords

Navigation