Skip to main content

Model-Theoretic Expressivity Analysis

  • Chapter
Probabilistic Inductive Logic Programming

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

Abstract

In the preceding chapter the problem of comparing languages was considered from a behavioral perspective. In this chapter we develop an alternative, model-theoretic approach.

In this approach we compare the expressiveness of probabilistic-logic (pl-) languages by considering the models that can be characterized in a language. Roughly speaking, one language L′ is at least as expressive as another language L, if every model definable in L also is definable in L′. Results obtained in the model-theoretic approach can be somewhat stronger than results obtained in the behavioral approach in that equivalence of models entails equivalent behavior with respect to any possible type of inference tasks. On the other hand, the model-theoretic approach is somewhat less flexible than the behavioral approach, because only languages can be compared that define comparable types of models. A comparison between Bayesian Logic Programs (defining probability distributions on possible worlds) and Stochastic Logic Programs (defining probability distributions over derivations), therefore, is already quite challenging in a model-theoretic approach, as it requires first to define a unifying semantic framework. In this chapter, therefore, we focus on pl-languages that exhibit stronger semantic similarities (Bayesian Logic Programs (BLPs) [6], Probabilistic Relational Models (PRMs) [1], Multi-Entity Bayesian Networks [7], Markov Logic Networks (MLNs) [12], Relational Bayesian Networks (RBNs) [4]), and first establish a unifying semantics for these languages. However, the framework we propose is flexible to enough (with a slightly bigger effort) to also accommodate languages like Stochastic Logic Programs [9] or Prism [3].

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Friedman, N., Getoor, L., Koller, D., Pfeffer, A.: Learning probabilistic relational models. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI 1999) (1999)

    Google Scholar 

  2. Jaeger, M.: Reasoning about infinite random structures with relational bayesian networks. In: Cohn, A.G., Schubert, L., Shapiro, S.C. (eds.) Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning (KR 1998), Trento, Italy, pp. 570–581. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

  3. Jaeger, M., Kersting, K., De Raedt, L.: Expressivity analysis for pl-languages (position paper). In: Online Proceedings of the Workshop on Statistical Relational Learning (SRL 2006) (2006)

    Google Scholar 

  4. Jaeger, M.: Relational bayesian networks. In: Geiger, D., Shenoy, P.P. (eds.) Proceedings of the 13th Conference of Uncertainty in Artificial Intelligence (UAI-13), Providence, USA, pp. 266–273. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  5. Jaeger, M.: Complex probabilistic modeling with recursive relational Bayesian networks. Annals of Mathematics and Artificial Intelligence 32, 179–220 (2001)

    Article  MathSciNet  Google Scholar 

  6. Kersting, K., De Raedt, L.: Towards combining inductive logic programming with bayesian networks. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol. 2157, pp. 118–131. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Laskey, K.B., da Costa, P.C.G.: Of starships and klingons: Bayesian logic for the 23rd century. In: Proceedings of UAI 2005 (2005)

    Google Scholar 

  8. Milch, B., Marthi, B., Russell, S., Sontag, D., Ong, D.L., Kolobov, A.: Blog: Probabilistic logic with unknown objects. In: Proc. 19th International Joint Conference on Artificial Intelligence (IJCAI), pp. 1352–1359 (2005)

    Google Scholar 

  9. Muggleton, S.: Stochastic logic programs. In: de Raedt, L. (ed.) Advances in Inductive Logic Programming, pp. 254–264. IOS Press, Amsterdam (1996)

    Google Scholar 

  10. Pasula, H., Marthi, B., Milch, B., Russell, S., Shpitser, I.: Identity uncertainty and citation matching. In: Proceedings of NIPS 2003 (2003)

    Google Scholar 

  11. Poole, D.: Logical generative models for probabilistic reasoning about existence, roles and identity. In: Proceedings of AAAI 2007 (2007)

    Google Scholar 

  12. Richardson, M., Domingos, P.: Markov logic networks. Machine Learning 62(1-2), 107–136 (2006)

    Article  Google Scholar 

  13. Sato, T.: A statistical learning method for logic programs with distribution semantics. In: Proceedings of the 12th International Conference on Logic Programming (ICLP 1995), pp. 715–729 (1995)

    Google Scholar 

  14. Singla, P., Domingos, P.: Markov logic in infinite domains. In: Proceedings of UAI 2007 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Luc De Raedt Paolo Frasconi Kristian Kersting Stephen Muggleton

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Jaeger, M. (2008). Model-Theoretic Expressivity Analysis. In: De Raedt, L., Frasconi, P., Kersting, K., Muggleton, S. (eds) Probabilistic Inductive Logic Programming. Lecture Notes in Computer Science(), vol 4911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78652-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78652-8_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78651-1

  • Online ISBN: 978-3-540-78652-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics