Inductive logic programming

From HandWiki

Inductive logic programming (ILP) is a subfield of symbolic artificial intelligence which uses logic programming as a uniform representation for examples, background knowledge and hypotheses. The term "inductive" here refers to philosophical (i.e. suggesting a theory to explain observed facts) rather than mathematical (i.e. proving a property for all members of a well-ordered set) induction. Given an encoding of the known background knowledge and a set of examples represented as a logical database of facts, an ILP system will derive a hypothesised logic program which entails all the positive and none of the negative examples.

  • Schema: positive examples + negative examples + background knowledge ⇒ hypothesis.

Inductive logic programming is particularly useful in bioinformatics and natural language processing.

History

Building on earlier work on Inductive inference, Gordon Plotkin was the first to formalise induction in a clausal setting around 1970, adopting an approach of generalising from examples.[1][2] In 1981, Ehud Shapiro introduced several ideas that would shape the field in his new approach of model inference, an algorithm employing refinement and backtracing to search for a complete axiomatisation of given examples.[1][3] His first implementation was the Model Inference System in 1981:[4][5] a Prolog program that inductively inferred Horn clause logic programs from positive and negative examples.[1] The term Inductive Logic Programming was first introduced in a paper by Stephen Muggleton in 1990, defined as the intersection of machine learning and logic programming.[1] Muggleton and Wray Buntine introduced predicate invention and inverse resolution in 1988.[1][6]

Several inductive logic programming systems that proved influential appeared in the early 1990s. FOIL, introduced by Ross Quinlan in 1990[7] was based on upgrading propositional learning algorithms AQ and ID3.[8] Golem, introduced by Muggleton and Feng in 1990, went back to a restricted form of Plotkin's least generalisation algorithm.[8][9] The Progol system, introduced by Muggleton in 1995, first implemented inverse entailment, and inspired many later systems.[8][10][11] Aleph, a descendant of Progol introduced by Ashwin Srinivasan in 2001, is still one of the most widely used systems (As of 2022).[10]

At around the same time, the first practical applications emerged, particularly in bioinformatics, where by 2000 inductive logic programming had been successfully applied to drug design, carcinogenicity and mutagenicity prediction, and elucidation of the structure and function of proteins.[12] Unlike the focus on automatic programming inherent in the early work, these fields used inductive logic programming techniques from a viewpoint of relational data mining. The success of those initial applications and the lack of progress in recovering larger traditional logic programs shaped the focus of the field.[13]

Recently, classical tasks from automated programming have moved back into focus, as the introduction of meta-interpretative learning makes predicate invention and learning recursive programs more feasible. This technique was pioneered with the Metagol system introduced by Muggleton, Dianhuan Lin, Niels Pahlavi and Alireza Tamaddoni-Nezhad in 2014.[14] This allows ILP systems to work with fewer examples, and brought successes in learning string transformation programs, answer set grammars and general algorithms.[15]

Setting

Inductive logic programming has adopted several different learning settings, the most common of which are learning from entailment and learning from interpretations.[16] In both cases, the input is provided in the form of background knowledge B, a logical theory (commonly in the form of clauses used in logic programming), as well as positive and negative examples, denoted [math]\displaystyle{ E^+ }[/math] and [math]\displaystyle{ E^{-} }[/math] respectively. The output is given as a hypothesis H, itself a logical theory that typically consists of one or more clauses.

The two settings differ in the format of examples presented.

Learning from entailment

(As of 2022), learning from entailment is by far the most popular setting for inductive logic programming.[16] In this setting, the positive and negative examples are given as finite sets [math]\displaystyle{ E^+ }[/math] and [math]\displaystyle{ E^{-} }[/math] of positive and negated ground literals, respectively. A correct hypothesis H is a set of clauses satisfying the following requirements, where the turnstile symbol [math]\displaystyle{ \models }[/math] stands for logical entailment:[16][17][18] [math]\displaystyle{ \begin{array}{llll} \text{Completeness:} & B \cup H & \models & E^+ \\ \text{Consistency: } & B \cup H \cup E^- & \not\models & \textit{false} \end{array} }[/math] Completeness requires any generated hypothesis h to explain all positive examples [math]\displaystyle{ E^+ }[/math], and consistency forbids generation of any hypothesis h that is inconsistent with the negative examples [math]\displaystyle{ E^{-} }[/math], both given the background knowledge B.

In Muggleton's setting of concept learning,[19] "completeness" is referred to as "sufficiency", and "consistency" as "strong consistency". Two further conditions are added: "Necessity", which postulates that B does not entail [math]\displaystyle{ E^+ }[/math], does not impose a restriction on h, but forbids any generation of a hypothesis as long as the positive facts are explainable without it. . "Weak consistency", which states that no contradiction can be derived from [math]\displaystyle{ B\land H }[/math], forbids generation of any hypothesis h that contradicts the background knowledge B. Weak consistency is implied by strong consistency; if no negative examples are given, both requirements coincide. Weak consistency is particularly important in the case of noisy data, where completeness and strong consistency cannot be guaranteed.[19]

Learning from interpretations

In learning from interpretations, the positive and negative examples are given as a set of complete or partial Herbrand structures, each of which are themselves a finite set of ground literals. Such a structure e is said to be a model of the set of clauses [math]\displaystyle{ B \cup H }[/math] if for any substitution [math]\displaystyle{ \theta }[/math] and any clause [math]\displaystyle{ \mathrm{head} \leftarrow \mathrm{body} }[/math] in [math]\displaystyle{ B \cup H }[/math] such that [math]\displaystyle{ \mathrm{body}\theta \subseteq e }[/math], [math]\displaystyle{ \mathrm{head}\theta \subseteq e }[/math] also holds. The goal is then to output a hypothesis that is complete, meaning every positive example is a model of [math]\displaystyle{ B \cup H }[/math], and consistent, meaning that no negative example is a model of [math]\displaystyle{ B \cup H }[/math].[16]

Approaches to ILP

An inductive logic programming system is a program that takes as an input logic theories [math]\displaystyle{ B, E^+, E^- }[/math] and outputs a correct hypothesis H with respect to theories [math]\displaystyle{ B, E^+, E^- }[/math]. A system is complete if and only if for any input logic theories [math]\displaystyle{ B, E^+, E^- }[/math] any correct hypothesis H with respect to these input theories can be found with its hypothesis search procedure. Inductive logic programming systems can be roughly divided into two classes, search-based and meta-interpretative systems.

Search-based systems exploit that the space of possible clauses forms a complete lattice under the subsumption relation, where one clause [math]\displaystyle{ C_1 }[/math] subsumes another clause [math]\displaystyle{ C_2 }[/math] if there is a substitution [math]\displaystyle{ \theta }[/math] such that [math]\displaystyle{ C_1\theta }[/math], the result of applying [math]\displaystyle{ \theta }[/math] to [math]\displaystyle{ C_1 }[/math], is a subset of [math]\displaystyle{ C_2 }[/math]. This lattice can be traversed either bottom-up or top-down.

Bottom-up search

Bottom-up methods to search the subsumption lattice have been investigated since Plotkin's first work on formalising induction in clausal logic in 1970.[1][20] Techniques used include least general generalisation, based on anti-unification, and inverse resolution, based on inverting the resolution inference rule.

Least general generalisation

A least general generalisation algorithm takes as input two clauses [math]\displaystyle{ C_1 }[/math] and [math]\displaystyle{ C_2 }[/math] and outputs the least general generalisation of [math]\displaystyle{ C_1 }[/math] and [math]\displaystyle{ C_2 }[/math], that is, a clause [math]\displaystyle{ C }[/math] that subsumes [math]\displaystyle{ C_1 }[/math] and [math]\displaystyle{ C_2 }[/math], and that is subsumed by every other clause that subsumes [math]\displaystyle{ C_1 }[/math] and [math]\displaystyle{ C_2 }[/math]. The least general generalisation can be computed by first computing all selections from [math]\displaystyle{ C }[/math] and [math]\displaystyle{ D }[/math], which are pairs of literals [math]\displaystyle{ (L,M) \in (C_1, C_2) }[/math] sharing the same predicate symbol and negated/unnegated status. Then, the least general generalisation is obtained as the disjunction of the least general generalisations of the individual selections, which can be obtained by first-order syntactical anti-unification.[21]

To account for background knowledge, inductive logic programming systems employ relative least general generalisations, which are defined in terms of subsumption relative to a background theory. In general, such relative least general generalisations are not guaranteed to exist; however, if the background theory B is a finite set of ground literals, then the negation of B is itself a clause. In this case, a relative least general generalisation can be computed by disjoining the negation of B with both [math]\displaystyle{ C_1 }[/math] and [math]\displaystyle{ C_2 }[/math] and then computing their least general generalisation as before.[22]

Relative least general generalisations are the foundation of the bottom-up system Golem.[8][9]

Inverse resolution

Inverse resolution is an inductive reasoning technique that involves inverting the resolution operator.

Inverse resolution takes information about the resolvent of a resolution step to compute possible resolving clauses. Two types of inverse resolution operator are in use in inductive logic programming: V-operators and W-operators. A V-operator takes clauses [math]\displaystyle{ R }[/math] and [math]\displaystyle{ C_1 }[/math]as input and returns a clause [math]\displaystyle{ C_2 }[/math] such that [math]\displaystyle{ R }[/math] is the resolvent of [math]\displaystyle{ C_1 }[/math] and [math]\displaystyle{ C_2 }[/math]. A W-operator takes two clauses [math]\displaystyle{ R_1 }[/math] and [math]\displaystyle{ R_2 }[/math] and returns thre clauses [math]\displaystyle{ C_1 }[/math], [math]\displaystyle{ C_2 }[/math] and [math]\displaystyle{ C_3 }[/math] such that [math]\displaystyle{ R_1 }[/math] is the resolvent of [math]\displaystyle{ C_1 }[/math] and [math]\displaystyle{ C_2 }[/math] and [math]\displaystyle{ R_2 }[/math] is the resolvent of [math]\displaystyle{ C_2 }[/math] and [math]\displaystyle{ C_3 }[/math].[23]

Inverse resolution was first introduced by Stephen Muggleton and Wray Buntine in 1988 for use in the inductive logic programming system Cigol.[6] By 1993, this spawned a surge of research into inverse resolution operators and their properties.[23]

Top-down search

The ILP systems Progol,[11] Hail [24] and Imparo [25] find a hypothesis H using the principle of the inverse entailment[11] for theories B, E, H: [math]\displaystyle{ B \land H \models E \iff B \land \neg E \models \neg H }[/math]. First they construct an intermediate theory F called a bridge theory satisfying the conditions [math]\displaystyle{ B \land \neg E \models F }[/math] and [math]\displaystyle{ F \models \neg H }[/math]. Then as [math]\displaystyle{ H \models \neg F }[/math], they generalize the negation of the bridge theory F with anti-entailment.[26] However, the operation of anti-entailment is computationally more expensive since it is highly nondeterministic. Therefore, an alternative hypothesis search can be conducted using the operation of the inverse subsumption (anti-subsumption) instead which is less non-deterministic than anti-entailment.

Questions of completeness of a hypothesis search procedure of specific ILP system arise. For example, Progol's hypothesis search procedure based on the inverse entailment inference rule is not complete by Yamamoto's example.[27] On the other hand, Imparo is complete by both anti-entailment procedure [28] and its extended inverse subsumption [29] procedure.

List of implementations

Probabilistic inductive logic programming

Probabilistic inductive logic programming adapts the setting of inductive logic programming to learning probabilistic logic programs. It can be considered as statistical relational learning within the formalism of probabilistic logic programming.[32][33]

Given

  1. background knowledge as a probabilistic logic program B, and
  2. a set of positive and negative examples [math]\displaystyle{ E^{+} }[/math] and [math]\displaystyle{ E^{-} }[/math]

the goal of probabilistic inductive logic programming is to find a probabilistic logic program [math]\displaystyle{ H }[/math] such that the probability of positive examples according to [math]\displaystyle{ {H \cup B} }[/math] is maximized and the probability of negative examples is minimized.[33]

This problem has two variants: parameter learning and structure learning. In the first, one is given the structure (the clauses) of H and the goal is to infer the probabilities annotations of the given clauses, while in the second the goal was to infer both the structure and the probability parameters of H. Just as in classical inductive logic programming, the examples can be given as examples or as (partial) interpretations.[33]

Parameter Learning

Parameter learning for languages following the distribution semantics has been performed by using an expectation-maximisation algorithm or by gradient descent. An expectation-maximisation algorithm consists of a cycle in which the steps of expectation and maximization are repeatedly performed. In the expectation step, the distribution of the hidden variables is computed according to the current values of the probability parameters, while in the maximisation step, the new values of the parameters are computed. Gradient descent methods compute the gradient of the target function and iteratively modify the parameters moving in the direction of the gradient.[33]

Structure Learning

Structure learning was pioneered by Daphne Koller and Avi Pfeffer in 1997,[34] where the authors learn the structure of first-order rules with associated probabilistic uncertainty parameters. Their approach involves generating the underlying graphical model in a preliminary step and then applying expectation-maximisation.[33]

In 2008, De Raedt et al. presented an algorithm for performing theory compression on ProbLog programs, where theory compression means removing as many clauses as possible from the theory in order to maximize the probability. No new clause can be added to the theory.[33]

In the same year, Meert, W. et al. introduced a method for learning parameters and structure of ground probabilistic logic programs by considering the Bayesian networks equivalent to them and applying techniques for learning Bayesian networks.[35][33]

ProbFOIL, introduced by De Raedt and Ingo Thon in 2010, combined the inductive logic programming system FOIL with ProbLog. Logical rules are learned from probabilistic data in the sense that both the examples themselves and their classifications can be probabilistic. The set of rules has to allow to predict the probability of the examples from their description. In this setting, the parameters (the probability values) are fixed and the structure has to be learned.[36][33]

In 2011, Elena Bellodi and Fabrizio Riguzzi introduced SLIPCASE, which performs a beam search among probabilistic logic programs by iteratively refining probabilistic theories and optimizing the parameters of each theory using expectation-maximisation.[37] Its extension SLIPCOVER, proposed in 2014, uses bottom clauses generated as in Progol to guide the refinement process, thus reducing the number of revisions and exploring more effectively the search space. Moreover, SLIPCOVER separates the search for promising clauses from that of the theory: the space of clauses is explored with a beam search, while the space of theories is searched greedily.[38][33]

See also

References

  1. ↑ 1.0 1.1 1.2 1.3 1.4 1.5 Nienhuys-Cheng, Shan-hwei; Wolf, Ronald de (1997). Foundations of inductive logic programming. Lecture notes in computer science Lecture notes in artificial intelligence. Berlin Heidelberg: Spinger. pp. 174–177. ISBN 978-3-540-62927-6. 
  2. ↑ Plotkin, G.D. (1970). Automatic Methods of Inductive Inference (PDF) (PhD). University of Edinburgh. hdl:1842/6656.
  3. ↑ Template:Cite tech report Reprinted in Lassez, J.-L.; Plotkin, G., eds (1991). Computational logic : essays in honor of Alan Robinson. MIT Press. pp. 199–254. ISBN 978-0-262-12156-9. 
  4. ↑ Shapiro, Ehud Y. (1981). "The model inference system". Proceedings of the 7th international joint conference on Artificial intelligence. 2. Morgan Kaufmann. pp. 1064. https://www.ijcai.org/Proceedings/81-2/Papers/100.pdf. 
  5. ↑ Shapiro, Ehud Y. (1983). Algorithmic program debugging. MIT Press. ISBN 0-262-19218-7. 
  6. ↑ 6.0 6.1 Muggleton, S.H.; Buntine, W. (1988). "Machine invention of first-order predicate by inverting resolution". Proceedings of the 5th International Conference on Machine Learning. pp. 339–352. doi:10.1016/B978-0-934613-64-4.50040-2. ISBN 978-0-934613-64-4. 
  7. ↑ Quinlan, J. R. (August 1990). "Learning logical definitions from relations". Machine Learning 5 (3): 239–266. doi:10.1007/bf00117105. ISSN 0885-6125. 
  8. ↑ 8.0 8.1 8.2 8.3 Nienhuys-Cheng, Shan-hwei; Wolf, Ronald de (1997). Foundations of inductive logic programming. Lecture notes in computer science Lecture notes in artificial intelligence. Berlin Heidelberg: Spinger. pp. 354–358. ISBN 978-3-540-62927-6. 
  9. ↑ 9.0 9.1 Muggleton, Stephen H.; Feng, Cao (1990). Arikawa, Setsuo; Goto, Shigeki; Ohsuga, Setsuo et al.. eds. "Efficient Induction of Logic Programs". Algorithmic Learning Theory, First International Workshop, ALT '90, Tokyo, Japan, October 8–10, 1990, Proceedings (Springer/Ohmsha): 368–381. https://dblp.org/rec/conf/alt/MuggletonF90.bib. 
  10. ↑ 10.0 10.1 Cropper, Andrew; Dumančić, Sebastijan (2022-06-15). "Inductive Logic Programming At 30: A New Introduction". Journal of Artificial Intelligence Research 74: 808. doi:10.1613/jair.1.13507. ISSN 1076-9757. 
  11. ↑ 11.0 11.1 11.2 Muggleton, S.H. (1995). "Inverting entailment and Progol". New Generation Computing 13 (3–4): 245–286. doi:10.1007/bf03037227. 
  12. ↑ Džeroski, Sašo (2001), Džeroski, Sašo; Lavrač, Nada, eds., "Relational Data Mining Applications: An Overview" (in en), Relational Data Mining (Berlin, Heidelberg: Springer Berlin Heidelberg): pp. 339–364, doi:10.1007/978-3-662-04599-2_14, ISBN 978-3-642-07604-6, http://link.springer.com/10.1007/978-3-662-04599-2_14, retrieved 2023-11-27 
  13. ↑ De Raedt, Luc (2008), Logical and Relational Learning, Cognitive Technologies, Berlin, Heidelberg: Springer, p. 14, doi:10.1007/978-3-540-68856-3, ISBN 978-3-540-20040-6, Bibcode: 2008lrl..book.....D, http://dx.doi.org/10.1007/978-3-540-68856-3 
  14. ↑ Muggleton, Stephen H.; Lin, Dianhuan; Pahlavi, Niels; Tamaddoni-Nezhad, Alireza (2013-05-01). "Meta-interpretive learning: application to grammatical inference". Machine Learning 94 (1): 25–49. doi:10.1007/s10994-013-5358-3. ISSN 0885-6125. http://dx.doi.org/10.1007/s10994-013-5358-3. 
  15. ↑ Cropper, Andrew; Dumančić, Sebastijan; Evans, Richard; Muggleton, Stephen (2022). "Inductive logic programming at 30" (in en). Machine Learning 111 (1): 147–172. doi:10.1007/s10994-021-06089-1. ISSN 0885-6125. 
  16. ↑ 16.0 16.1 16.2 16.3 Cropper, Andrew; Dumančić, Sebastijan (2022-06-15). "Inductive Logic Programming At 30: A New Introduction". Journal of Artificial Intelligence Research 74: 779–782. doi:10.1613/jair.1.13507. ISSN 1076-9757. 
  17. ↑ Džeroski, Sašo (1996). "Inductive Logic Programming and Knowledge Discovery in Databases". in Fayyad, U.M.; Piatetsky-Shapiro, G.; Smith, P. et al.. Advances in Knowledge Discovery and Data Mining. MIT Press. pp. 117–152 See §5.2.4. http://kt.ijs.si/SasoDzeroski/pdfs/1996/Chapters/1996_InductiveLogicProgramming.pdf. Retrieved 2021-09-27. 
  18. ↑ De Raedt, Luc (1997). "Logical settings for concept-learning" (in en). Artificial Intelligence 95 (1): 187–201. doi:10.1016/S0004-3702(97)00041-6. https://linkinghub.elsevier.com/retrieve/pii/S0004370297000416. 
  19. ↑ 19.0 19.1 Muggleton, Stephen (1999). "Inductive Logic Programming: Issues, Results and the Challenge of Learning Language in Logic". Artificial Intelligence 114 (1–2): 283–296. doi:10.1016/s0004-3702(99)00067-3. ; here: Sect.2.1
  20. ↑ Plotkin, G.D. (1970). Automatic Methods of Inductive Inference (PDF) (PhD). University of Edinburgh. hdl:1842/6656.
  21. ↑ Nienhuys-Cheng, Shan-hwei; Wolf, Ronald de (1997). Foundations of inductive logic programming. Lecture notes in computer science Lecture notes in artificial intelligence. Berlin Heidelberg: Spinger. p. 255. ISBN 978-3-540-62927-6. 
  22. ↑ Nienhuys-Cheng, Shan-hwei; Wolf, Ronald de (1997). Foundations of inductive logic programming. Lecture notes in computer science Lecture notes in artificial intelligence. Berlin Heidelberg: Spinger. p. 286. ISBN 978-3-540-62927-6. 
  23. ↑ 23.0 23.1 Nienhuys-Cheng, Shan-hwei; Wolf, Ronald de (1997). Foundations of inductive logic programming. Lecture notes in computer science Lecture notes in artificial intelligence. Berlin Heidelberg: Spinger. p. 197. ISBN 978-3-540-62927-6. 
  24. ↑ Ray, O.; Broda, K.; Russo, A.M. (2003). "Hybrid abductive inductive learning". Proceedings of the 13th international conference on inductive logic programming. LNCS. 2835. Springer. pp. 311–328. doi:10.1007/978-3-540-39917-9_21. ISBN 978-3-540-39917-9. https://link.springer.com/chapter/10.1007/978-3-540-39917-9_21. 
  25. ↑ Kimber, T.; Broda, K.; Russo, A. (2009). "Induction on failure: learning connected Horn theories". Proceedings of the 10th international conference on logic programing and nonmonotonic reasoning. LNCS. 575. Springer. pp. 169–181. doi:10.1007/978-3-642-04238-6_16. ISBN 978-3-642-04238-6. https://link.springer.com/chapter/10.1007/978-3-642-04238-6_16. 
  26. ↑ Yamamoto, Yoshitaka; Inoue, Katsumi; Iwanuma, Koji (2012). "Inverse subsumption for complete explanatory induction". Machine Learning 86: 115–139. doi:10.1007/s10994-011-5250-y. https://link.springer.com/content/pdf/10.1007/s10994-011-5250-y.pdf. 
  27. ↑ Yamamoto, Akihiro (1997). "Which hypotheses can be found with inverse entailment?". International Conference on Inductive Logic Programming. Lecture Notes in Computer Science. 1297. Springer. pp. 296–308. doi:10.1007/3540635149_58. ISBN 978-3-540-69587-5. https://link.springer.com/chapter/10.1007/3540635149_58. 
  28. ↑ 28.0 28.1 Kimber, Timothy (2012). Learning definite and normal logic programs by induction on failure (PhD). Imperial College London. ethos 560694. Archived from the original on 2022-10-21. Retrieved 2022-10-21.
  29. ↑ Toth, David (2014). "Imparo is complete by inverse subsumption". arXiv:1407.3836 [cs.AI].
  30. ↑ Muggleton, Stephen; Santos, Jose; Tamaddoni-Nezhad, Alireza (2009). "ProGolem: a system based on relative minimal generalization". International Conference on Inductive Logic Programming. Springer. pp. 131–148. doi:10.1007/978-3-642-13840-9_13. ISBN 978-3-642-13840-9. https://link.springer.com/chapter/10.1007/978-3-642-13840-9_13. 
  31. ↑ Santos, Jose; Nassif, Houssam; Page, David; Muggleton, Stephen; Sternberg, Mike (2012). "Automated identification of features of protein-ligand interactions using Inductive Logic Programming: a hexose binding case study". BMC Bioinformatics 13: 162. doi:10.1186/1471-2105-13-162. PMID 22783946. 
  32. ↑ De Raedt, Luc; Kersting, Kristian (2008), Probabilistic Inductive Logic Programming, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 1–27, doi:10.1007/978-3-540-78652-8_1, ISBN 978-3-540-78651-1, http://dx.doi.org/10.1007/978-3-540-78652-8_1, retrieved 2023-12-09 
  33. ↑ 33.0 33.1 33.2 33.3 33.4 33.5 33.6 33.7 33.8 Riguzzi, Fabrizio; Bellodi, Elena; Zese, Riccardo (2014-09-18). "A History of Probabilistic Inductive Logic Programming". Frontiers in Robotics and AI 1. doi:10.3389/frobt.2014.00006. ISSN 2296-9144. 
  34. ↑ Koller, Daphne; Pfeffer, Avi (August 1997). "Learning probabilities for noisy first-order rules". IJCAI. http://www.robotics.stanford.edu/~koller/Papers/Koller+Pfeffer:IJCAI97.pdf. 
  35. ↑ Blockeel, Hendrik; Meert, Wannes (2007), "Towards Learning Non-recursive LPADs by Transforming Them into Bayesian Networks", Inductive Logic Programming, Lecture Notes in Computer Science (Berlin, Heidelberg: Springer Berlin Heidelberg) 4455: pp. 94–108, doi:10.1007/978-3-540-73847-3_16, ISBN 978-3-540-73846-6, http://dx.doi.org/10.1007/978-3-540-73847-3_16, retrieved 2023-12-09 
  36. ↑ De Raedt, Luc; Thon, Ingo (2011), Frasconi, Paolo; Lisi, Francesca A., eds., "Probabilistic Rule Learning", Inductive Logic Programming (Berlin, Heidelberg: Springer Berlin Heidelberg) 6489: pp. 47–58, doi:10.1007/978-3-642-21295-6_9, ISBN 978-3-642-21294-9, http://link.springer.com/10.1007/978-3-642-21295-6_9, retrieved 2023-12-09 
  37. ↑ Bellodi, Elena; Riguzzi, Fabrizio (2012), "Learning the Structure of Probabilistic Logic Programs", Inductive Logic Programming (Berlin, Heidelberg: Springer Berlin Heidelberg): pp. 61–75, doi:10.1007/978-3-642-31951-8_10, ISBN 978-3-642-31950-1, http://dx.doi.org/10.1007/978-3-642-31951-8_10, retrieved 2023-12-09 
  38. ↑ Bellodi, Elena; Riguzzi, Fabrizio (2014-01-15). "Structure learning of probabilistic logic programs by searching the clause space". Theory and Practice of Logic Programming 15 (2): 169–212. doi:10.1017/s1471068413000689. ISSN 1471-0684. http://dx.doi.org/10.1017/s1471068413000689. 

Further reading



Retrieved from "https://handwiki.org/wiki/index.php?title=Inductive_logic_programming&oldid=3373280"