Learning efficient logic programs
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
When machine learning programs from data, we ideally want to learn efficient rather than inefficient programs. However, existing inductive logic programming (ILP) techniques cannot distinguish between the efficiencies of programs, such as permutation sort (n!) and merge sort $$O(n\;log\;n)$$ . To address this limitation, we introduce Metaopt, an ILP system which iteratively learns lower cost logic programs, each time further restricting the hypothesis space. We prove that given sufficiently large numbers of examples, Metaopt converges on minimal cost programs, and our experiments show that in practice only small numbers of examples are needed. To learn minimal time-complexity programs, including non-deterministic programs, we introduce a cost function called tree cost which measures the size of the SLD-tree searched when a program is given a goal. Our experiments on programming puzzles, robot strategies, and real-world string transformation problems show that Metaopt learns minimal cost programs. To our knowledge, Metaopt is the first machine learning approach that, given sufficient numbers of training examples, is guaranteed to learn minimal cost logic programs, including minimal time-complexity programs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Because of the symbolic nature of logic programs, ILP can reason about hypotheses, which allows it to learn optimal programs, such as minimal time-complexity programs (Cropper & Muggleton, 2019) and secure access control policies (Law et al., 2020).”
From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Cropper & Muggleton, 2019
In the citing paper
“Metaopt maintains a cost during the hypothesis search and uses this cost to prune the hypothesis space.”
From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Cropper & Muggleton, 2019
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Muggleton, S. (1995) · New Generation Computing · doi:10.1007/bf03037227 · Cited by 1,411
Self-citationAutomating string processing in spreadsheets using input-output examples
Gulwani, S. (2011) · ACM SIGPLAN Notices · doi:10.1145/1925844.1926423 · Cited by 581
Foundations of Inductive Logic Programming
Nienhuys-Cheng, S.-H., & Wolf, R. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-62927-0 · Cited by 471
Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited
Muggleton, S. H., Lin, D., & Tamaddoni-Nezhad, A. (2015) · Machine Learning · doi:10.1007/s10994-014-5471-y · Cited by 184
Self-citationMeta-interpretive learning: application to grammatical inference
Muggleton, S. H., Lin, D., Pahlavi, N., & Tamaddoni-Nezhad, A. (2014) · Machine Learning · doi:10.1007/s10994-013-5358-3 · Cited by 144 · cited 1×
“Since the hypothesis space is exponential in the length of the hypothesis [Lin et al., 2014], the hypothesis H 1 is the most tractable to learn.”
BackgroundSelf-citationInductive Learning of Answer Set Programs
Law, M., Russo, A., & Broda, K. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-11558-0_22 · Cited by 133 · cited 1×
“However, existing ILP systems cannot distinguish between the efficiencies of programs, and typically rely on an Occamist bias to learn textually simple programs, such as those using the fewest literals (Law et al. 2014) or fewest clauses (Muggleton et al.”
Bias reformulation for one-shot function induction
Dianhuan, L., Eyal, D., Kevin, E., Joshua, T., & Stephen, M. (2014) · Frontiers in Artificial Intelligence and Applications · doi:10.3233/978-1-61499-419-0-525 · Cited by 53
Cited by
Inductive Logic Programming At 30: A New Introduction
Cropper, A., & Dumančić, S. (2022) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.13507 · Cited by 83
“ILP systems that aim to induce algorithms and general-purpose programs (Shapiro, 1983; Cropper & Muggleton, 2019; Cropper & Morel, 2020) often induce definite programs, typically as Prolog programs.”
BackgroundInfluentialSelf-citationInductive logic programming at 30
Cropper, A., Dumančić, S., Evans, R., & Muggleton, S. H. (2022) · Machine Learning · doi:10.1007/s10994-021-06089-1 · Cited by 61
Self-citationEvans, R., Hernández-Orallo, J., Welbl, J., Kohli, P., & Sergot, M. (2021) · Artificial Intelligence · doi:10.1016/j.artint.2020.103438 · Cited by 58
Abductive Knowledge Induction from Raw Data
Dai, W.-Z., & Muggleton, S. (2021) · Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2021/254 · Cited by 42
Self-citationPlaygol: Learning Programs Through Play
Cropper, A. (2019) · Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/841 · Cited by 30
Self-citation
Metadata
- Authors
- Cropper, A., & Muggleton, S. H.
- Venue
- Machine Learning
- Published
- 2018-04-23
- Volume
- 108
- Issue
- 7
- Pages
- 1063-1083
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2395903764
- Cited by
- 31
- References
- 7
- FWCI
- 3.11
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Learning efficient logic programs. https://app.cochat.ai/papers/10.1007/s10994-018-5712-6
- The paper
- Cropper, A., & Muggleton, S. H. (2019). Learning efficient logic programs. Machine Learning. https://doi.org/10.1007/s10994-018-5712-6
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.