Inductive logic programming: Difference between revisions

Revision as of 20:52, 30 November 2023

Revision as of 12:36, 3 December 2023

Line 20:

The ''background knowledge'' is given as a logic theory {{mvar|B}}, commonly in the form of [[Horn clauses]] used in [[logic programming]].

The ''positive'' and ''negative'' examples are given as a conjunction <math>E^+</math> and <math>E^-</math> of unnegated and negated [[ground expression|ground]] [[Literal (mathematical logic)|literals]], respectively.

A ''correct hypothesis'' {{mvar|h}} is a logic proposition satisfying the following requirements.<ref>{{cite journal|first1=Stephen|last1=Muggleton|title=Inductive Logic Programming: Issues, Results and the Challenge of Learning Language in Logic|journal=Artificial Intelligence|volume=114|issue=1–2|pages=283–296|year=1999|doi=10.1016/s0004-3702(99)00067-3|doi-access=free}}; here: Sect.2.1</ref>

:[[Entailment#Semantic consequence|

<math>\begin{array}{llll}