Editing Inductive logic programming (section)

=== Metainterpretive learning ===
Rather than explicitly searching the hypothesis graph, metainterpretive or ''meta-level'' systems encode the inductive logic programming program as a meta-level logic program which is then solved to obtain an optimal hypothesis. Formalisms used to express the problem specification include [[Prolog]] and [[answer set programming]], with existing Prolog systems and answer set solvers used for solving the constraints.<ref name=":0">{{Cite journal |last1=Cropper |first1=Andrew |last2=Dumančić |first2=Sebastijan |date=2022-06-15 |title=Inductive Logic Programming At 30: A New Introduction |journal=Journal of Artificial Intelligence Research |volume=74 |page=795 |doi=10.1613/jair.1.13507 |issn=1076-9757|doi-access=free |arxiv=2008.07912 }}</ref>

And example of a Prolog-based system is [[Metagol]], which is based on a [[Meta-interpreters in Prolog|meta-interpreter in Prolog]], while ASPAL and ILASP are based on an encoding of the inductive logic programming problem in answer set programming.<ref name=":0" />