Skip to main content

Bayesian Logic Networks and the Search for Samples with Backward Simulation and Abstract Constraint Learning

  • Conference paper

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

Abstract

With Bayesian logic networks (BLNs), we present a practical representation formalism for statistical relational knowledge. Based on the concept of mixed networks with probabilistic and deterministic constraints, BLNs combine the probabilistic semantics of (relational) Bayesian networks with constraints in first-order logic. In practical applications, efficient inference in statistical relational models such as BLNs is a key concern. Motivated by the inherently mixed nature of models instantiated from BLNs, we investigate two novel importance sampling methods: The first combines backward simulation, i.e. sampling backward from the evidence, with systematic search, while the second explores the possibility of recording abstract constraints during the search for samples.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Richardson, M., Domingos, P.: Markov Logic Networks. Mach. Learn. 62, 107–136 (2006)

    Article  Google Scholar 

  2. Jain, D., Kirchlechner, B., Beetz, M.: Extending Markov Logic to Model Probability Distributions in Relational Domains. In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007. LNCS (LNAI), vol. 4667, pp. 129–143. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Getoor, L., Friedman, N., Koller, D., Pfeffer, A., Taskar, B.: Probabilistic Relational Models. In: Getoor, L., Taskar, B. (eds.) An Introduction to Statistical Relational Learning. MIT Press, Cambridge (2007)

    Google Scholar 

  4. Kersting, K., Raedt, L.D.: Bayesian Logic Programming: Theory and Tool. In: Getoor, L., Taskar, B. (eds.) Introduction to Statistical Relational Learning. MIT Press, Cambridge (2007)

    Google Scholar 

  5. Laskey, K.B.: MEBN: A Language for First-Order Bayesian Knowledge Bases. Artif. Intell. 172, 140–178 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Jaeger, M.: Model-Theoretic Expressivity Analysis. In: Raedt, L.D., Frasconi, P., Kersting, K., Muggleton, S. (eds.) Probabilistic Inductive Logic Programming. LNCS (LNAI), vol. 4911, pp. 325–339. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Mateescu, R., Dechter, R.: Mixed Deterministic and Probabilistic Networks. Ann. Math. Artif. Intel. (2008)

    Google Scholar 

  8. Poon, H., Domingos, P.: Sound and Efficient Inference with Probabilistic and Deterministic Dependencies. In: AAAI. AAAI Press, Menlo Park (2006)

    Google Scholar 

  9. Rubinstein, R.: Simulation and the Monte Carlo Method. John Wiley & Sons, Inc., Chichester (1981)

    Book  MATH  Google Scholar 

  10. Fung, R.M., Favero, B.D.: Backward Simulation in Bayesian Networks. In: UAI, pp. 227–234 (1994)

    Google Scholar 

  11. Gogate, V., Dechter, R.: SampleSearch: A Scheme that Searches for Consistent Samples. In: AISTATS (2007)

    Google Scholar 

  12. Dechter, R., Frost, D.: Backjump-Based Backtracking for Constraint Satisfaction Problems. Artif. Intell. 136, 147–188 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gogate, V., Domingos, P.: Formula-Based Probabilistic Inference. In: UAI (2010)

    Google Scholar 

  14. Kersting, K., Ahmadi, B., Natarajan, S.: Counting Belief Propagation. In: UAI (2009)

    Google Scholar 

  15. Parkes, A.J.: Lifted Search Engines for Satisfiability. PhD thesis (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jain, D., von Gleissenthall, K., Beetz, M. (2011). Bayesian Logic Networks and the Search for Samples with Backward Simulation and Abstract Constraint Learning. In: Bach, J., Edelkamp, S. (eds) KI 2011: Advances in Artificial Intelligence. KI 2011. Lecture Notes in Computer Science(), vol 7006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24455-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24455-1_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24454-4

  • Online ISBN: 978-3-642-24455-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics