EUVIMEDEUVIMED entdecken
Crossref

Self-Supervised Inductive Logic Programming

Stassa Patsantzis

Proceedings of the AAAI Conference on Artificial Intelligence · 14.03.2026 · 40 (23) · 19337-19344

DOI: 10.1609/aaai.v40i23.39010 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the AAAI Conference on Artificial Intelligence, online erschienen am 14.03.2026. Verfasst von Stassa Patsantzis.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Inductive Logic Programming (ILP) approaches like Meta-Interpretive Learning (MIL) can learn, from few examples, recursive logic programs with invented predicates that generalise well to unseen instances. This ability relies on a background theory and negative examples, both carefully selected with expert knowledge of a learning problem and its solutions. But what if such a problem-specific background theory or negative examples are not available? We formalise this question as a new setting for Self-Supervised ILP and present a new MIL algorithm that learns in the new setting from some positive labelled, and zero or more unlabelled examples, and automatically generates, and labels, new positive and negative examples during learning. We implement this algorithm in Prolog in a new MIL system, called Poker. We compare Poker to state-of-the-art MIL system Louise on experiments learning grammars for Context-Free and L-System languages from labelled, positive example strings, no negative examples, and just the terminal vocabulary of a language, seen in examples, as a first-order background theory. We introduce a new approach for the principled selection of a second-order background theory as a Second Order Definite Normal Form (SONF), sufficiently general to learn all programs in a class, thus removing the need for a backgound theory tailored to a learning task. We find that Poker's performance improves with increasing numbers of automatically generated examples while Louise, bereft of negative examples, over-generalises.

Zitieren

APA

Patsantzis, S. (2026). Self-Supervised Inductive Logic Programming. Proceedings of the AAAI Conference on Artificial Intelligence, 40(23), 19337-19344. https://doi.org/10.1609/aaai.v40i23.39010

Vancouver

Patsantzis S. Self-Supervised Inductive Logic Programming. Proceedings of the AAAI Conference on Artificial Intelligence. 2026;40(23):19337-19344. doi:10.1609/aaai.v40i23.39010

BibTeX
@article{Patsantzis2026,
  author = {Patsantzis, Stassa},
  title = {Self-Supervised Inductive Logic Programming},
  journal = {Proceedings of the AAAI Conference on Artificial Intelligence},
  year = {2026},
  volume = {40},
  number = {23},
  pages = {19337--19344},
  doi = {10.1609/aaai.v40i23.39010}
}
Kostenlos starten →