Inductive logic programming
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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?
Inductive logic programming (ILP) is a form of machine learning.
“Inductive logic programming (ILP) is a form of machine learning.”
From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Muggleton, 1991
ILP as a field was founded by Muggleton (1991), who stated that it lies at the intersection of ML and knowledge representation.
“ILP as a field was founded by Muggleton (1991), who stated that it lies at the intersection of ML and knowledge”
From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Muggleton, 1991
Cites
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Gödel, K. (1931) · Monatshefte für Mathematik und Physik · doi:10.1007/bf01700692 · Cited by 2,395 · see citing works
A formal theory of inductive inference. Part II
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90131-7 · Cited by 1,758 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
A review of some techniques for inclusion of domain-knowledge into deep neural networks
Dash, T., Chitlangia, S., Ahuja, A., & Srinivasan, A. (2022) · Scientific Reports · doi:10.1038/s41598-021-04590-0 · Cited by 196 · see citing works
Inductive 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 · see citing works
Futures of artificial intelligence through technology readiness levels
Martínez-Plumed, F., Gómez, E., & Hernández-Orallo, J. (2021) · Telematics and Informatics · doi:10.1016/j.tele.2020.101525 · Cited by 130 · see citing works
Learning programs by learning from failures
Cropper, A., & Morel, R. (2021) · Machine Learning · doi:10.1007/s10994-020-05934-z · Cited by 86 · see citing works
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 · see citing works
Constraint-Based Synthesis of Datalog Programs
Albarghouthi, A., Koutris, P., Naik, M., & Smith, C. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-66158-2_44 · Cited by 40 · see citing works
Nakhle, F., & Harfouche, A. L. (2021) · Patterns · doi:10.1016/j.patter.2021.100323 · Cited by 28 · see citing works
Question answering systems with deep learning-based symbolic processing
Honda, H., & Hagiwara, M. (2019) · IEEE Access · doi:10.1109/access.2019.2948081 · Cited by 23 · see citing works
Induction of Non-Monotonic Logic Programs to Explain Boosted Tree Models Using LIME
Shakerin, F., & Gupta, G. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33013052 · Cited by 17 · see citing works
Rocha, A., Camacho, R., Ruwaard, J., & Riper, H. (2018) · Internet Interventions · doi:10.1016/j.invent.2018.03.003 · Cited by 7 · see citing works
Autonomous Task Completion Based on Goal-directed Answer Set Programming
Tudor, A. R. (2025) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.416.39
- Authors
- Muggleton, S.
- Affiliations
- Turing Institute (GB)
- Corresponding author
- Muggleton, Stephen
- ORCID
- Muggleton, Stephen
- Venue
- New Generation Computing
- Published
- 1991-02
- Volume
- 8
- Issue
- 4
- Pages
- 295-318
- ISSN
- 0288-3635 (ISSN-L)
- 1882-7055
- OpenAlex
- W2520858206
- Cited by
- 1,044
- References
- 2
- Citations by year
- 2026: 22 · 2025: 35 · 2024: 26 · 2023: 47 · 2022: 46 · 2021: 41 · 2020: 24 · 2019: 44 · 2018: 30 · 2017: 24 · 2016: 27 · 2015: 20 · 2014: 21 · 2013: 22 · 2012: 25
- FWCI
- 40.97
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- New Generation Computing (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
- Keywords
- inductive logic programming, PAC learning, algorithmic complexity, predicate invention
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
