Skip to main content

How to Exploit Parametric Uniformity for Maximum Entropy Reasoning in a Relational Probabilistic Logic

  • Conference paper
Logics in Artificial Intelligence (JELIA 2012)

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

Included in the following conference series:

Abstract

The relational probabilistic conditional logic FO-PCL employs the principle of maximum entropy (ME). We show that parametric uniformity of an FO-PCL knowledge base \(\mathcal R\) can be exploited for solving the optimization problem required for ME reasoning more efficiently. The original ME optimization problem containing a large number of linear constraints, one for each ground instance of a conditional, can be replaced by an optimization problem containing just one linear constraint for each conditional. We show that both optimization problems have the same ME distribution as solution. An implementation employing Generalized Iterative Scaling illustrates the benefits of our approach

The research reported here was partially supported by the DFG (grant BE 1700/7-2).

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. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, New York (2004)

    Book  MATH  Google Scholar 

  2. Darroch, J.N., Ratcliff, D.: Generalized iterative scaling for log-linear models. Annals of Mathematical Statistics 43(5), 1470–1480 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  3. de Salvo Braz, R., Amir, E., Roth, D.: Lifted first-order probabilistic inference. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI 2005, pp. 1319–1325. Professional Book Center (2005)

    Google Scholar 

  4. Delgrande, J.: On first-order conditional logics. Artificial Intelligence 105, 105–137 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  5. Finthammer, M.: An iterative scaling algorithm for maximum entropy reasoning in relational probabilistic conditional logic. In: Hüllermeier, E. (ed.) SUM 2012. LNCS, vol. 7520, pp. 351–364. Springer, Heidelberg (2012)

    Google Scholar 

  6. Finthammer, M., Beierle, C.: Using equivalences of worlds for aggregation semantics of relational conditionals. In: KI 2012: Proceedings of 35th Annual German Conference on Advances in Artificial Intelligence AI, Saarbrücken, Germany, September 24-27. LNCS (LNAI), Springer (to appear, 2012)

    Google Scholar 

  7. Finthammer, M., Thimm, M.: An integrated development environment for probabilistic relational reasoning. Logic Journal of the IGPL (to appear, 2012)

    Google Scholar 

  8. Fisseler, F.: Learning and Modeling with Probabilistic Conditional Logic. Dissertations in Artificial Intelligence, vol. 328. IOS Press (2010)

    Google Scholar 

  9. Fisseler, J.: First-order probabilistic conditional logic and maximum entropy. Logic Journal of the IGPL (to appear, 2012)

    Google Scholar 

  10. Geman, S., Geman, D.: Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence 6, 721–741 (1984)

    Article  MATH  Google Scholar 

  11. Halpern, J.: Reasoning About Uncertainty. MIT Press (2005)

    Google Scholar 

  12. Jaimovich, A., Meshi, O., Friedman, N.: Template based inference in symmetric relational markov random fields. In: Proc. of the 23rd Conference on Uncertainty in Artificial Intelligence. AUAI Press (2007)

    Google Scholar 

  13. Kern-Isberner, G.: Characterizing the principle of minimum cross-entropy within a conditional-logical framework. Artificial Intelligence 98, 169–208 (1998)

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  15. Kern-Isberner, G., Lukasiewicz, T.: Combining probabilistic logic programming with the power of maximum entropy. Artificial Intelligence, Special Issue on Nonmonotonic Reasoning 157(1-2), 139–202 (2004)

    MathSciNet  MATH  Google Scholar 

  16. Kern-Isberner, G., Thimm, M.: Novel semantical approaches to relational probabilistic conditionals. In: Lin, F., Sattler, U., Truszczyński, M. (eds.) Proc. of the 12th Int’l. Conference on the Principles of Knowledge Representation and Reasoning (KR 2010), May 2010, pp. 382–392. AAAI Press (May 2010)

    Google Scholar 

  17. Krämer, A., Beierle, C.: On Lifted Inference for a Relational Probabilistic Conditional Logic with Maximum Entropy Semantics. In: Lukasiewicz, T., Sali, A. (eds.) FoIKS 2012. LNCS, vol. 7153, pp. 224–243. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  18. Milch, B., Zettlemoyer, L., Kersting, K., Haimes, M., Kaelbling, L.P.: Lifted probabilistic inference with counting formulas. In: Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17. AAAI Press (2008)

    Google Scholar 

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

    Google Scholar 

  20. Poole, D.: First-order probabilistic inference. In: Gottlob, G., Walsh, T. (eds.) Proc. IJCAI 2003, pp. 985–991. Morgan Kaufmann (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Finthammer, M., Beierle, C. (2012). How to Exploit Parametric Uniformity for Maximum Entropy Reasoning in a Relational Probabilistic Logic. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds) Logics in Artificial Intelligence. JELIA 2012. Lecture Notes in Computer Science(), vol 7519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33353-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33353-8_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33352-1

  • Online ISBN: 978-3-642-33353-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics