Towards meta-interpretive learning of programming language semantics
Not on the map. Why?
Abstract (arXiv)
We introduce a new application for inductive logic programming: learning the semantics of programming languages from example evaluations. In this short paper, we explored a simplified task in this domain using the Metagol meta-interpretive learning system. We highlighted the challenging aspects of this scenario, including abstracting over function symbols, nonterminating examples, and learning non-observed predicates, and proposed extensions to Metagol helpful for overcoming these challenges, which may prove useful in other domains.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Jul 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 1.
5 papers.
- 2021Inductive logic programming at 30cited by 46
- 2023Learning MDL logic programs from noisy datacited by 15
- 2022Learning logic programs by combining programscited by 7
- 2022Learning logic programs by discovering where not to searchcited by 4
- 2024Learning big logical rules by joining small rulescited by 4
- 2024Learning big logical rules by joining small rules29 Jan 2024
- 2023Learning MDL logic programs from noisy data18 Aug 2023
- 2022Learning logic programs by combining programs1 Jun 2022
- 2022Learning logic programs by discovering where not to search20 Feb 2022
- 2021Inductive logic programming at 3021 Feb 2021