Constructing Markov Logic Networks from First-Order Default Rules

Conference paper

DOI: 10.1007/978-3-319-40566-7_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9575)
Cite this paper as:
Kuželka O., Davis J., Schockaert S. (2016) Constructing Markov Logic Networks from First-Order Default Rules. In: Inoue K., Ohwada H., Yamamoto A. (eds) Inductive Logic Programming. ILP 2015. Lecture Notes in Computer Science, vol 9575. Springer, Cham


Expert knowledge can often be represented using default rules of the form “if A then typically B”. In a probabilistic framework, such default rules can be seen as constraints on what should be derivable by MAP-inference. We exploit this idea for constructing a Markov logic network \(\mathcal {M}\) from a set of first-order default rules D, such that MAP inference from \(\mathcal {M}\) exactly corresponds to default reasoning from D, where we view first-order default rules as templates for the construction of propositional default rules. In particular, to construct appropriate Markov logic networks, we lift three standard methods for default reasoning. The resulting Markov logic networks could then be refined based on available training data. Our method thus offers a convenient way of using expert knowledge for constraining or guiding the process of learning Markov logic networks.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Ondřej Kuželka
    • 1
  • Jesse Davis
    • 2
  • Steven Schockaert
    • 1
  1. 1.School of Computer Science & InformaticsCardiff UniversityCardiffUK
  2. 2.Department of Computer ScienceKatholieke Universiteit LeuvenLeuvenBelgium

Personalised recommendations