The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Learning nonrecursive definitions of relations with linus
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.
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
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Learning Logical Definitions from Relations
Quinlan, J. R. (1990) · Machine Learning · doi:10.1023/a:1022699322624 · Cited by 1,644
Cited by
Inductive Logic Programming: Theory and methods
Muggleton, S., & de Raedt, L. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90035-3 · Cited by 1,537
Separate-and-Conquer Rule Learning
Fürnkranz, J. (1999) · Artificial Intelligence Review · doi:10.1023/a:1006524209794 · Cited by 528
Džeroski, S. (2006) · Data Mining and Knowledge Discovery Handbook · doi:10.1007/0-387-25465-x_41 · Cited by 520
Self-citationSelected techniques for data mining in medicine
Lavrač, N. (1999) · Artificial Intelligence in Medicine · doi:10.1016/s0933-3657(98)00062-1 · Cited by 351
Self-citationPropositionalization Approaches to Relational Data Mining
Kramer, S., Lavrač, N., & Flach, P. (2001) · Relational Data Mining · doi:10.1007/978-3-662-04599-2_11 · Cited by 271
Self-citationMulti-relational data mining: an introduction
Džeroski, S. (2003) · ACM SIGKDD Explorations Newsletter · doi:10.1145/959242.959245 · Cited by 267
Self-citationA 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
“Techniques for automatic construction of Boolean-valued features from relational domainknowledge have a long history in the field of ILP [15; 16; 17], originating from the LINUS [7].”
InfluentialILP turns 20: Biography and future challenges
Muggleton, S., De Raedt, L., Poole, D., Bratko, I., Flach, P., Inoue, K., & Srinivasan, A. (2012) · Machine Learning · doi:10.1007/s10994-011-5259-2 · Cited by 126
Dierkes, T., Bichler, M., & Krishnan, R. (2011) · Decision Support Systems · doi:10.1016/j.dss.2011.01.002 · Cited by 76
A Critical Review of Inductive Logic Programming Techniques for Explainable AI
Zhang, Z., Yilmaz, L., & Liu, B. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2023.3246980 · Cited by 25
Large-Scale Assessment of Deep Relational Machines
Dash, T., Srinivasan, A., Vig, L., Orhobor, O. I., & King, R. D. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-99960-9_2 · Cited by 19
Metadata
- Authors
- Lavrač, N., Džeroski, S., & Grobelnik, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1991
- Pages
- 265-281
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1506152736
- Cited by
- 161
- References
- 2
- FWCI
- 12.67
- Type
- conference paper
- Language
- en
- Open access
- closed
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
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.