The DOI matches its Crossref record; 40 of the 45 references it cites were found in a registry or an index.
Learning Logical Definitions from Relations
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“ILP systems such as ALEPH (Srinivasan 2001) and FOIL (Quinlan 1990) have no predicate invention and limited recursion learning and therefore cannot learn recursive grammars from example sequences.”
From Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited (2015) · cites this paper as Quinlan 1990
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Indeed, many popular ILP systems, such as FOIL (Quinlan 1990), Progol (Muggleton 1995), TILDE (Blockeel and De Raedt 1998), and Aleph (Srinivasan 2001) struggle to learn recursive programs.”
From Learning programs by learning from failures (2021) · cites this paper as Quinlan 1990
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Although early work in ILP explored this form of learning (Sammut, 1981; Quinlan, 1990), it has been under-explored until recently (Lin et al., 2014; Cropper, 2019, 2020; Hocquette & Muggleton, 2020; Dumancic et al., 2021), mostly because of new techniques for PI.”
From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Quinlan, 1990
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Quinlan's (1990) FOIL system is one of the most well-known ILP systems and is a natural extension of ID3 (Quinlan, 1986) from the propositional setting to the first-order setting.”
From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Quinlan, 1990
The cited source says what the claim attributes to it.
In the citing paper
“The above paragraph refers only to generality orders on single clauses, as many systems employ the covering algorithm whereby hypotheses are constructed iteratively clause by clause (Quinlan, 1990; De Raedt & Dehaspe, 1997; Muggleton, 1995; Blockeel & De Raedt, 1998; Srinivasan, 2001).”
From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Quinlan, 1990
The cited source says what the claim attributes to it.
In the citing paper
“Top-down algorithms, (Quinlan, 1990; Blockeel & De Raedt, 1998; Bratko, 1999; Muggleton et al., 2008) start with a general hypothesis and then specialise it.”
From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Quinlan, 1990
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
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,867
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Self-citationClassification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 21,030
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Quinlan, J. R. (1987) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(87)80053-6 · Cited by 2,553
Self-citationClark, P. A., & Niblett, T. (1989) · Machine Learning · doi:10.1023/a:1022641700528 · Cited by 2,267
A Universal Prior for Integers and Estimation by Minimum Description Length
Rissanen, J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346150 · Cited by 1,655
Explanation-Based Generalization: A Unifying View
Mitchell, T. M., Keller, R. M., & Kedar-Cabelli, S. T. (1986) · Machine Learning · doi:10.1023/a:1022691120807 · Cited by 1,382
Expert systems in the micro-electronic age
Michie, D. (1979) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,119
Shapiro, E. Y. (1983) · doi:10.7551/mitpress/1192.001.0001 · Cited by 1,085
Research works printed but not linked: 2
- Brebner, P.C. (1988). Gargantubrain: An heuristic algorithm for learning non-recursive Horn clauses from positive and negative examples. (Technical Report 8802). Sydney, Australia: University of New South Wales, School of Electrical Engineering and Computer Science.
- Schlimmer, J.C., and Fisher, D. (1986). A case study of incremental concept formation. Proceedings of the Fifth National Conference on Artificial Intelligence (pp.296-501). Philadelphia, PA: Morgan Kaufmann.
Cited by
Sorted by citations
Items 901–1,000 of 1,000
The logic of learning: a brief introduction to Inductive Logic Programming
Flach, P. A. (1998) · Cited by 7
Learning with Globally Predictive Tests
Pazzani, M. J. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49292-5_20 · Cited by 7
Scalability Issues in Inductive Logic Programming
Wrobel, S. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49730-7_2 · Cited by 7
Inducing shogi heuristics using inductive logic programming
Nakano, T., Inuzuka, N., Seki, H., & Itoh, H. (1998) · Lecture notes in computer science · doi:10.1007/bfb0027319 · Cited by 7
Learning on the phase transition edge
Serra, A., Giordana, A., & Saitta, L. (2001) · International Joint Conference on Artificial Intelligence · Cited by 7
Learning simple recursive theories
Giordana, A., Saitta, L., & Cristina Baroglio, A. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56804-2_40 · Cited by 7
A Constraint-Based Induction Algorithm in FOL
Sébag, M. (1994) · Elsevier eBooks · doi:10.1016/b978-1-55860-335-6.50041-6 · Cited by 7
Learning effective and robust knowledge for semantic query optimization
Hsu, C. (2015) · doi:10.25549/usctheses-c17-235971 · Cited by 7
Design and analysis of scalable rule induction systems
Afify, A. A. (2004) · ORCA Online Research @Cardiff (Cardiff University) · Cited by 7
Biases and their effects in Inductive Logic Programming
Tausend, B. (1994) · Lecture notes in computer science · doi:10.1007/3-540-57868-4_91 · Cited by 7
Learning prototype-selection rules for case-based iterative design
Schwabacher, M., Hirsh, H., & Ellman, T. (2002) · Conference on Artificial Intelligence for Applications · doi:10.1109/caia.1994.323692 · Cited by 7
On control knowledge acquisition by exploiting human-computer interaction
Aler, R., & Borrajo, D. (2002) · International Conference on Artificial Intelligence Planning Systems · Cited by 7
The Space of Mathematical Software Systems -- A Survey of Paradigmatic SystemsPreprint
Berčič, K., Carette, J., Farmer, W. M., Kohlhase, M., Müller, D., Rabe, F., & Sharoda, Y. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.04955 · Cited by 7
Fürnkranz, J. (2010) · Encyclopedia of Machine Learning · doi:10.1007/978-0-387-30164-8_738 · Cited by 7
A Survey of Task-Oriented Knowledge Graph Reasoning: Status, Applications, and ProspectsPreprint
Niu, G., Li, B., & Lin, Y. (2025) · doi:10.36227/techrxiv.174961563.32605293/v1 · Cited by 8
Estimation-based optimizations for the semantic compression of RDF knowledge bases
Wang, R., Wong, R. K., & Sun, D. W. (2024) · Information Processing & Management · doi:10.1016/j.ipm.2024.103799 · Cited by 6
OpenDrift: Online Evolving Fraud Detection for Open-Category and Concept-Drift Transactions
Wang, C., Chai, S., & Zhu, H. (2023) · IEEE International Conference on Web Services (ICWS) · doi:10.1109/icws60048.2023.00079 · Cited by 6
Котельников, Е. В., & Milov, V. R. (2018) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1015/3/032068 · Cited by 6
SInC: Semantic approach and enhancement for relational data compression
Wang, R., Sun, D. W., Wong, R. K., Raj, R., & Zomaya, A. Y. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.110001 · Cited by 6
Learning MDL Logic Programs from Noisy Data
Hocquette, C., Niskanen, A., Järvisalo, M., & Cropper, A. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i9.28925 · Cited by 6
A Voting Approach for Explainable Classification with Rule Learning
Nössig, A., Hell, T., & Moser, G. (2024) · IFIP advances in information and communication technology · doi:10.1007/978-3-031-63223-5_12 · Cited by 7
Knowledge discovery in databases: the purpose, necessity, and challenges
Klösgen, W., & Żytkow, J. M. (2002) · Oxford University Press eBooks · Cited by 6
Relational Feature Mining with Hierarchical Multitask kFOIL
Cilia, E., Landwehr, N., & Passerini, A. (2011) · Fundamenta Informaticae · doi:10.3233/fi-2011-604 · Cited by 6
Amin, A. (2002) · IAPR International Conference on Document Analysis and Recognition (ICDAR) · doi:10.1109/icdar.2001.953809 · Cited by 6
Correlation-Based Refinement of Rules with Numerical Attributes
Melo, A., Theobald, M., & Völker, J. (2014) · The Florida AI Research Society · Cited by 6
Learning Classifiers From a Relational Database of Tutor Logs
Mostow, J., González-Brenes, J. P., & Tan, B. H. (2011) · Cited by 6
A global workspace framework for combined reasoning
Charnley, J. (2009) · doi:10.25560/5591 · Cited by 6
Meta-Interpretive Learning: Achievements and Challenges (Invited Paper)
Muggleton, S. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-61252-2_1 · Cited by 7
kProbLog: an algebraic Prolog for machine learning
Orsini, F., Frasconi, P., & Raedt, L. D. (2017) · Machine Learning · doi:10.1007/s10994-017-5668-y · Cited by 6
Refinement-Based OWL Class Induction with Convex Measures
Ratcliffe, D., & Taylor, K. L. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70682-5_4 · Cited by 6
A Knowledge Base Completion Model Based on Path Feature Learning
Lin, X., Liang, Y., Wang, L., Wang, X., Yang, M. Q., & Guan, R. (2018) · International Journal of Computers Communications & Control · doi:10.15837/ijccc.2018.1.3104 · Cited by 6
RDF Knowledge Base Summarization by Inducing First-Order Horn Rules
Wang, R., Sun, D. W., & Wong, R. K. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-26390-3_12 · Cited by 6
Resampling vs Reweighting in Boosting a Relational Weak Learner
Botta, M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45411-x_9 · Cited by 6
Integrity constraints in ILP using a Monte Carlo approach
Jorge, A., & Brazdil, P. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63494-0_58 · Cited by 6
A Lexically Based Semantic Bias for Theory Revision
Brunk, C. A., & Pazzani, M. J. (1995) · Elsevier eBooks · doi:10.1016/b978-1-55860-377-6.50019-0 · Cited by 6
Learning query rules for optimizing databases with update rules
Laurent, D., & Vrain, C. (1996) · Lecture notes in computer science · doi:10.1007/bfb0031740 · Cited by 6
A tight integration of pruning and learning (Extended abstract)
Fürnkranz, J. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59286-5_70 · Cited by 6
Can Relational Learning Scale Up?
Giordana, A., Saitta, L., Sébag, M., & Botta, M. (2000) · Lecture notes in computer science · doi:10.1007/3-540-39963-1_4 · Cited by 6
Wachowicz, M., Ligtenberg, A., Renso, C., & Gürses, S. F. (2008) · Springer eBooks · doi:10.1007/978-3-540-75177-9_3 · Cited by 6
Prototype Learning with Attributed Relational Graphs
Foggia, P., Genna, R., & Vento, M. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44522-6_46 · Cited by 6
Learning from Multiple Bayesian Networks for the Revision and Refinement of Expert Systems
Borth, M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45751-8_6 · Cited by 6
Botta, M. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58495-1_36 · Cited by 6
Representation of Incomplete Knowledge by Induction of Default Theories
Nicolas, P., & Duval, B. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45402-0_12 · Cited by 6
Cohen, W. W., & Dévanbu, P. (1999) · International Journal of Software Engineering and Knowledge Engineering · doi:10.1142/s0218194099000292 · Cited by 6
Rejecting unclassifiable samples with decision forests
Keefer, C. E., & Woody, N. A. (2006) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2006.04.013 · Cited by 6
Learning to extract information from large websites using sequential models
Vydiswaran, V. G. V., & Sarawagi, S. (2005) · Conference on Management of Data · Cited by 6
Neural Networks for Scientific Paper Classification
Zhang, M., Gao, X., Cao, M. D., & Ma, Y. (2006) · International Conference on Innovative Computing, Information and Control · doi:10.1109/icicic.2006.319 · Cited by 6
Can ILP Deal with Incomplete and Vague Structured Knowledge?
Lisi, F. A., & Straccia, U. (2014) · IMPERIAL COLLEGE PRESS eBooks · doi:10.1142/9781783265091_0021 · Cited by 6
Sources of Success for Information Extraction Methods
Kauchak, D., Smarr, J., & Elkan, C. (2002) · Cited by 6
On the Induction of Different Kinds of First-Order Fuzzy Rules
Prade, H. M., Richard, G., & Serrurier, M. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45062-7_30 · Cited by 6
On the utility of predicate invention in inductive logic programming
Stahl, I. (1994) · Lecture notes in computer science · doi:10.1007/3-540-57868-4_64 · Cited by 6
Measuring the Difficulty of Specific Learning Problems
Thornton, C. (1995) · Connection Science · doi:10.1080/09540099508915658 · Cited by 6
Mooney, R. J., & Zelle, J. M. (1994) · ACM SIGART Bulletin · doi:10.1145/181668.181673 · Cited by 6
Inductive Synthesis of Logic Programs and Inductive Logic Programming
Bergadano, F., & Gunetti, D. (1994) · Workshops in computing · doi:10.1007/978-1-4471-3234-9_4 · Cited by 6
IBSEAD: - A Self-Evolving Self-Obsessed Learning Algorithm for Machine LearningPreprint
Dundas, J., & Chik, D. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1106.6186 · Cited by 6
An inductive logic programming query language for database mining
Raedt, L. D. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055898 · Cited by 6
Are Substitutions the Better Examples? Learning complete Set of Clauses with Frog.
Fensel, D., Zickwolff, M., & Wiese, M. (1995) · UvA-DARE (University of Amsterdam) · Cited by 6
Wolters, M. K. (2002) · Cited by 6
Symbolic Methodology in Numeric Data Mining: Relational Techniques for Financial ApplicationsPreprint
Kovalerchuk, B., Vityaev, E. E., & Yusupov, H. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0208022 · Cited by 6
Raedt, L. D. (2010) · Encyclopedia of Machine Learning · doi:10.1007/978-0-387-30164-8_396 · Cited by 6
Interactively Matching Hand-Drawings Using Induction
Pearce, A. R., & Caelli, T. (1999) · Computer Vision and Image Understanding · doi:10.1006/cviu.1998.0742 · Cited by 6
Fuzzy controller synthesis in robotic assembly: procedure and experiments
Nuttin, M., Brussel, H. V., Cristina Baroglio, A., & Piola, R. (1994) · IEEE International Conference on Fuzzy Systems (FUZZ-IEEE) · doi:10.1109/fuzzy.1994.343648 · Cited by 6
A Multistrategy Learning System for Planning Operator Acquisition
Wang, X. (1996) · Cited by 6
DEFT guessing: using inductive transfer to improve rule evaluation from limited data
Reid, M. D. (2007) · UNSWorks (University of New South Wales, Sydney, Australia) · doi:10.26190/unsworks/17020 · Cited by 6
Learning and inference in collective knowledge bases
Richardson, M., & Domingos, P. (2004) · Cited by 6
Foo, N. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60161-9_26 · Cited by 6
Brunner, N., Das, S., Singh, A., & Starkl, M. (2024) · Water · doi:10.3390/w16192838 · Cited by 5
CON-FOLD Explainable Machine Learning with Confidence
McGinness, L. P., & Baumgartner, P. (2024) · Theory and Practice of Logic Programming · doi:10.1017/s1471068424000346 · Cited by 5
A Novel Structure Refining Algorithm for Statistical-Logical Models
Biba, M., Ballhysa, E., Vajjhala, N. R., & Mullagiri, V. R. (2010) · ... International Conference on Complex, Intelligent and Software Intensive Systems · doi:10.1109/cisis.2010.86 · Cited by 5
Intelligent Systems in Modeling Phase of Information Mining Development Process
Martins, S., Pesado, P. M., & García-Martínez, R. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-42007-3_1 · Cited by 5
Simple Augmentations of Logical Rules for Neuro-Symbolic Knowledge Graph Completion
Nandi, A., Kaur, N., Singla, P., & Mausam, M. (2023) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/2023.acl-short.23 · Cited by 5
Fürnkranz, J., Gamberger, D., & Nada Lavrač, A. (2012) · Cognitive technologies · doi:10.1007/978-3-540-75197-7_7 · Cited by 5
A comparison of pruning methods for relational concept learning
Fürnkranz, J. (1994) · Cited by 5
Induction of Decision Multi-trees Using Levin Search
Ferri, C., Hernández‐Orallo, J., & Ramírez-Quintana, M. J. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46043-8_16 · Cited by 5
Bottom-Up ILP Using Large Refinement Steps
Arias, M., & Khardon, R. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30109-7_7 · Cited by 5
Reference classes and relational learning
Chiang, M., & Poole, D. (2011) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2011.05.002 · Cited by 5
Weakening the language bias in LINUS
Nada Lavrač, A., & Džeroski, S. (1994) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/09528139408953783 · Cited by 5
Learning Rules from Incomplete Examples via Implicit Mention Models
Doppa, J. R., Sorower, M. S., NasrEsfahani, M., Irvine, J., Orr, W., Dietterich, T. G., Fern, X. Z., & Tadepalli, P. V. (2011) · Asian Conference on Machine Learning · Cited by 5
Type Extension Trees for feature construction and learning in relational domains
Jaeger, M., Lippi, M., Passerini, A., & Frasconi, P. (2013) · Artificial Intelligence · doi:10.1016/j.artint.2013.08.002 · Cited by 7
Towards learning rules from natural texts
Doppa, J. R., NasrEsfahani, M., Sorower, M. S., Dietterich, T. G., Fern, X. Z., & Tadepalli, P. V. (2010) · North American Chapter of the Association for Computational Linguistics · Cited by 5
Inductive Learning of the Surgical Workflow Model through Video Annotations
Nakawala, H., Momi, E. D., Pescatori, L. E., Morelli, A. M., & Ferrigno, G. (2017) · Proceedings - IEEE Symposium on Computer-Based Medical Systems · doi:10.1109/cbms.2017.91 · Cited by 5
The Need for Interpretability Biases
Fürnkranz, J., & Kliegr, T. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-01768-2_2 · Cited by 5
REMAINING LIFE TIME PREDICTION OF BEARINGS USING K-STAR ALGORITHM – A STATISTICAL APPROACH
Satishkumar, R., & Sugumaran, V. (2017) · DOAJ (DOAJ: Directory of Open Access Journals) · Cited by 5
Human–Machine Collaboration for Democratizing Data Science
Gautrais, C., Dauxais, Y., Teso, S., Kolb, S., Verbruggen, G., & Raedt, L. D. (2021) · Oxford University Press eBooks · doi:10.1093/oso/9780198862536.003.0019 · Cited by 6
Dimensionality Reduction in Data Summarization Approach to Learning Relational Data
Kheau, C. S., Alfred, R., & Keng, L. H. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-36546-1_18 · Cited by 5
Learning Probabilistic Logic Programs over Continuous Data
Speichert, S., & Belle, V. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-49210-6_11 · Cited by 5
From Reinforcement Learning Towards Artificial General Intelligence
Rocha, F. M., Costa, V. S., & Reis, L. P. (2020) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-45691-7_37 · Cited by 6
Probabilistic Rule Learning Systems
Salam, A., Schwitter, R., & Orgun, M. A. (2021) · ACM Computing Surveys · doi:10.1145/3447581 · Cited by 5
Scalable and Usable Relational Learning With Automatic Language Bias
Picado, J., Termehchy, A., Fern, A., Pathak, S., Ilango, P., & Davis, J. (2021) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3448016.3457275 · Cited by 5
Learning Distributional Programs for Relational Autocompletion
Kumar, N., Kuželka, O., & Raedt, L. D. (2021) · Theory and Practice of Logic Programming · doi:10.1017/s1471068421000144 · Cited by 6
Learning Temporal Interval Relations Using Inductive Logic Programming
Nicoletti, M. D. C., Lisboa, F. O. S. D. S., & Junior, E. R. H. (2011) · Communications in computer and information science · doi:10.1007/978-3-642-22247-4_8 · Cited by 5
Otani, N., Tadokoro, K., Kurihara, S., & Numao, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32695-0_36 · Cited by 5
Fürnkranz, J. (2004) · Cited by 5
Efficient Cross-Validation in ILP
Struyf, J., & Blockeel, H. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44797-0_19 · Cited by 5
Reducing complexity of rule based models via meta mining
Kurgan, L. (2005) · International Conference on Machine Learning and Applications · doi:10.1109/icmla.2004.1383520 · Cited by 5
Inducing Relational Concepts with Neural Networks Via the LINUS System
Basílio, R., Zaveryukha, O. S., & Garcez, A. D. (1998) · Cited by 5
Classification learning using all rules
Viswanathan, M., & Webb, G. I. (1998) · Lecture notes in computer science · doi:10.1007/bfb0026685 · Cited by 5
Learning Linear Constraints in Inductive Logic Programming
Martin, L., & Vrain, C. (1997) · Lecture notes in computer science · doi:10.1007/3-540-62858-4_81 · Cited by 5
Perfect refinement operators can be flexible
Badea, L. (2000) · Cited by 5
Forgetting to Learn Logic Programs
Cropper, A. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5776
Metadata
- Authors
- Quinlan, J. R.
- Affiliations
- The University of Sydney (AU)
- Corresponding author
- Quinlan, J.R.
- Venue
- Machine Learning
- Published
- 1990-08
- Volume
- 5
- Issue
- 3
- Pages
- 239-266
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1999138184
- Cited by
- 1,644
- References
- 45
- Citations by year
- 2026: 8 · 2025: 18 · 2024: 21 · 2023: 23 · 2022: 22 · 2021: 34 · 2020: 34 · 2019: 26 · 2018: 36 · 2017: 29 · 2016: 25 · 2015: 29 · 2014: 44 · 2013: 44 · 2012: 41
- FWCI
- 47.93
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Machine Learning (publishedVersion)
- Funders
- Australian Research Council
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
- Keywords
- foil, inductive logic programming, Horn clauses, relational data, first-order logic, rule induction
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
