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 701–800 of 1,000
Learning Higher-Order Logic Programs From Failures
Purgał, S. J., Cerna, D. M., & Kaliszyk, C. (2022) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2022/378 · Cited by 14
FOLD-SE: An Efficient Rule-Based Machine Learning Algorithm with Scalable Explainability
Wang, H., & Gupta, G. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-52038-9_3 · Cited by 12
Learning Complex Mappings between Ontologies
Hu, W. P., Chen, J., Zhang, H., & Qu, Y. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29923-0_24 · Cited by 12
Using the bottom clause and mode declarations in FOL theory revision from examples
Duboc, A. L., Paes, A., & Zaverucha, G. (2009) · Machine Learning · doi:10.1007/s10994-009-5116-8 · Cited by 12
Improving Expressivity of Inductive Logic Programming by Learning Different Kinds of Fuzzy Rules
Serrurier, M., & Prade, H. M. (2006) · Soft Computing · doi:10.1007/s00500-006-0109-z · Cited by 12
Lifted discriminative learning of probabilistic logic programs
Fadja, A. N., & Riguzzi, F. (2018) · Machine Learning · doi:10.1007/s10994-018-5750-0 · Cited by 12
Uncertain decision tree for bank marketing classification
Yang, S.-B., & Chen, T.-L. (2020) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2020.112710 · Cited by 12
To hop or not, that is the question: Towards effective multi-hop reasoning over knowledge graphs
Liao, J., Zhao, X. H., Tang, J., Zeng, W., & Tan, Z. (2021) · World Wide Web · doi:10.1007/s11280-021-00911-5 · Cited by 12
Experiments in non-monotonic learning
Bain, M. (1991) · Elsevier eBooks · doi:10.1016/b978-1-55860-200-7.50078-7 · Cited by 12
Induction of Recursive Transfer Rules
Boström, H. (2000) · Lecture notes in computer science · doi:10.1007/3-540-40030-3_15 · Cited by 12
Evaluating Pattern Set Mining Strategies in a Constraint Programming Framework
Guns, T., Nijssen, S., & Raedt, L. D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20847-8_32 · Cited by 12
Problem Order Implications for Learning
Li, N., Cohen, W. W., & Koedinger, K. R. (2013) · International Journal of Artificial Intelligence in Education · doi:10.1007/s40593-013-0005-5 · Cited by 12
Refining Numerical Constants in First Order Logic Theories
Botta, M., & Piola, R. (2000) · Machine Learning · doi:10.1023/a:1007686007399 · Cited by 12
Avoiding non-termination when learning logic programs: A case study with FOIL and FOCL
Semeraro, G. M., Esposito, F., Malerba, D., Brunk, C. A., & Pazzani, M. J. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58792-6_12 · Cited by 12
Unsupervised learning of mDTD extraction patterns for Web text mining
Kim, D., Jung, H., & Lee, G. G. (2003) · Information Processing & Management · doi:10.1016/s0306-4573(03)00004-9 · Cited by 12
Bayesian Inductive Logic Programming
Muggleton, S. (1994) · Elsevier eBooks · doi:10.1016/b978-1-55860-335-6.50052-0 · Cited by 12
Comprehensible Knowledge Discovery: Gaining Insight from Data
Pazzani, M. J. (1997) · Cited by 12
Learning recursive functions from noisy examples using generic genetic programming
Wong, M. L., & Leung, K. (1996) · Cited by 12
A Comparison of First-Order and Zeroth-Order Induction for Input-Output Agent Modelling
Chiu, B. C., Webb, G. I., & Kuzmycz, M. (1997) · Springer eBooks · doi:10.1007/978-3-7091-2670-7_35 · Cited by 12
Integration of Analogical Search Control and Explanation-Based Learning of Correctness
VanLehn, K. A., & Jones, R. M. (1993) · Elsevier eBooks · doi:10.1016/b978-1-4832-0774-2.50014-7 · Cited by 12
Bottom-Up Learning of Logic Programs for Information Extraction from Hypertext Documents
Thomas, B. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39804-2_39 · Cited by 12
Induction of Slovene nominal paradigms
Džeroski, S., & Erjavec, T. (1997) · Lecture notes in computer science · doi:10.1007/3540635149_42 · Cited by 12
Turney, P. D. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0212039 · Cited by 12
Learning Hierarchies from Ambiguous Natural Language Data
Yamazaki, T., Pazzani, M. J., & Merz, C. J. (1995) · Elsevier eBooks · doi:10.1016/b978-1-55860-377-6.50077-3 · Cited by 12
An ILP model for a monotone graded classification problem
Vojtáš, P., Horváth, T., Krajči, S., & Lencses, R. (2004) · Czech digital mathematics library · Cited by 12
Learning higher-order logic programs
Cropper, A., Morel, R., & Muggleton, S. (2020) · Machine Learning · doi:10.1007/s10994-019-05862-7 · Cited by 11
“ILP systems, including the popular systems FOIL [37], Progol [31], ALEPH [41], and TILDE [1], usually learn first-order programs.”
BackgroundA belief rule-based classification system using fuzzy unordered rule induction algorithm
Li, Y., Pérez, I. J., Cabrerizo, F. J., Garg, H., & Morente-Molinera, J. A. (2024) · Information Sciences · doi:10.1016/j.ins.2024.120462 · Cited by 11
Benchmark of Rule-Based Classifiers in the News Recommendation Task
Kliegr, T., & Kuchař, J. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24027-5_11 · Cited by 11
Framework for integration of domain knowledge into logistic regression
Radovanović, S., Delibašić, B., Jovanović, M., Vukičević, M., & Suknović, M. (2018) · International Conference on Web Intelligence, Mining and Semantics · doi:10.1145/3227609.3227653 · Cited by 11
Learning Relations by Path Finding and Simultaneous Covering
Gao, Z., Zhang, Z., & Huang, Z. (2009) · doi:10.1109/csie.2009.100 · Cited by 11
Online inference-rule learning from natural-language extractions
Raghavan, S., & Mooney, R. J. (2013) · Cited by 11
CORER: A New Rule Generator Classifier
Basiri, A., Taghiyareh, F., & Gazani, S. (2010) · IEEE International Conference on Computational Science and Engineering (CSE) · doi:10.1109/cse.2010.18 · Cited by 11
Learning recursive HTN-method structures for planning
Yang, Q., Pan, R., & Pan, S. J. (2007) · Cited by 11
Wang, H., Shakerin, F., & Gupta, G. (2022) · Theory and Practice of Logic Programming · doi:10.1017/s1471068422000205 · Cited by 15
Interactions and information: Exploring task allocation in ant colonies using network analysis
Swain, A., Williams, S. D., Felice, L. J. D., & Hobson, E. A. (2021) · Animal Behaviour · doi:10.1016/j.anbehav.2022.04.015 · Cited by 11
Matsuda, N., Cohen, W. W., Sewall, J., Lacerda, G., & Koedinger, K. R. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73078-1_14 · Cited by 11
A Perspective on Inductive Logic Programming
Raedt, L. D. (1999) · Artificial intelligence · doi:10.1007/978-3-642-60085-2_14 · Cited by 11
A Simulated Annealing Framework for ILP
Serrurier, M., Prade, H. M., & Richard, G. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30109-7_22 · Cited by 11
Statistical Relational Learning
Blockeel, H. (2013) · Intelligent systems reference library · doi:10.1007/978-3-642-36657-4_8 · Cited by 11
EVOLVING NEURAL-SYMBOLIC SYSTEMS GUIDED BY ADAPTIVE TRAINING SCHEMES: APPLICATIONS IN FINANCE
Tsakonas, A., & Dounias, G. D. (2007) · Applied Artificial Intelligence · doi:10.1080/08839510701492603 · Cited by 11
From Inductive Logic Programming to Relational Data Mining
Džeroski, S. (2006) · Lecture notes in computer science · doi:10.1007/11853886_1 · Cited by 11
On the Use of Data-Mining Techniques in Knowledge-Based Systems
Oprea, M. M. (2006) · Cited by 11
Money laundering control in Mexico
Martínez-Sánchez, J. F., Cruz-García, S., & Venegas-Martı́nez, F. (2020) · Journal of Money Laundering Control · doi:10.1108/jmlc-10-2019-0083 · Cited by 11
Learning Large Logic Programs By Going Beyond Entailment
Cropper, A., & Dumančić, S. (2020) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2020/287 · Cited by 14
A Learning Classifier System Approach to Relational Reinforcement Learning
Mellor, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88138-4_10 · Cited by 11
Learning approaches for natural language processing
Wermter, S., Riloff, E., & Scheler, G. (1996) · Lecture notes in computer science · doi:10.1007/3-540-60925-3_34 · Cited by 11
Traps and pitfalls when learning logical definitions from relations
Esposito, F., Malerba, D., Semeraro, G. M., Brunk, C. A., & Pazzani, M. J. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58495-1_38 · Cited by 11
On the Hardness of Learning Acyclic Conjunctive Queries
Hirata, K. (2000) · Lecture notes in computer science · doi:10.1007/3-540-40992-0_18 · Cited by 11
Grounding GDMs: a structured case study
Motta, E., O’Hara, K., & Shadbolt, N. (1994) · International Journal of Human-Computer Studies · doi:10.1006/ijhc.1994.1015 · Cited by 11
Agrawal, R. (1994) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/182591.182600 · Cited by 11
Dai, W.-Z. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-09087-4 · Cited by 11
Fürnkranz, J. (2006) · Springer eBooks · doi:10.1007/0-387-25465-x_42 · Cited by 11
Morik, K. J. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3202-6_6 · Cited by 11
Induction of Recursive Theories in the Normal ILP Setting: Issues and Solutions
Esposito, F., Malerba, D., & Lisi, F. A. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44960-4_6 · Cited by 11
Learning DNF Via Probabilistic Evidence Combination
Norton, S. W., & Hirsh, H. (1993) · Elsevier eBooks · doi:10.1016/b978-1-55860-307-3.50035-6 · Cited by 11
The reuse of knowledge in ripple down rule knowledge based systems
Richards, D. C. (2022) · UNSWorks (University of New South Wales, Sydney, Australia) · doi:10.26190/unsworks/10536 · Cited by 11
Neuro-Symbolic Hierarchical Rule InductionPreprint
Glanois, C., Feng, X., Jiang, Z., Weng, P., Zimmer, M., Li, D., & Liu, W. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2112.13418 · Cited by 11
Ray, S., Scott, S., & Blockeel, H. (2010) · Encyclopedia of Machine Learning · doi:10.1007/978-0-387-30164-8_569 · Cited by 11
Thaicharoen, S., Altman, T., Gardiner, K., & Cios, K. J. (2009) · IEEE Symposium on Computational Intelligence and Data Mining (CIDM) · doi:10.1109/cidm.2009.4938661 · Cited by 10
TÉCNICAS DE ANÁLISIS DE DATOS APLICACIONES PRÁCTICAS UTILIZANDO MICROSOFT EXCEL Y WEKA
Molina, J. M., & Garcı́a, J. (2006) · Cited by 10
Unsupervised induction of sentence compression rules
Cordeiro, J., Dias, G. H., & Brazdil, P. (2009) · doi:10.3115/1708155.1708160 · Cited by 10
Mutlu, A., Senkul, P., & Kavurucu, Y. (2011) · Knowledge-Based Systems · doi:10.1016/j.knosys.2011.11.001 · Cited by 10
A defeasible reasoning model of inductive concept learning from examples and communication
Ontañón, S., Dellunde, P., Godo, L., & Plaza, E. (2012) · Artificial Intelligence · doi:10.1016/j.artint.2012.08.006 · Cited by 10
A System for Learning GCI Axioms in Fuzzy Description Logics.
Lisi, F. A., & Straccia, U. (2013) · Cited by 10
On the use of stochastic local search techniques to revise first-order logic theories from examples
Paes, A., Zaverucha, G., & Costa, V. S. (2016) · Machine Learning · doi:10.1007/s10994-016-5595-3 · Cited by 10
Malik, M. M., & Haouassi, H. (2021) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2021.08.032 · Cited by 10
A FOIL-Like Method for Learning under Incompleteness and Vagueness
Lisi, F. A., & Straccia, U. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44923-3_9 · Cited by 10
Abduction and Induction in AI: Report of the IJCAI'97 Workshop
Flach, P. A., & Kakas, A. C. (1998) · Bristol Research (University of Bristol) · Cited by 10
Karwath, A., & Raedt, L. D. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30214-8_1 · Cited by 10
Data Mining and Applications in Genomics
Ao, S.-I. (2008) · Lecture notes in electrical engineering · doi:10.1007/978-1-4020-8975-6 · Cited by 10
Coordinated inductive learning using argumentation-based communication
Ontañón, S., & Plaza, E. (2014) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-014-9256-2 · Cited by 11
Building Cognitive Tutors with Programming by Demonstration
Matsuda, N., Cohen, W. W., & Koedinger, K. R. (2018) · doi:10.1184/r1/6469862 · Cited by 10
MacDonald, B. A. (1991) · Knowledge Acquisition · doi:10.1016/s1042-8143(05)80026-3 · Cited by 10
Noise detection and elimination applied to noise handling in a KRK chess endgame
Gamberger, D., & Nada Lavrač, A. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63494-0_49 · Cited by 10
Learning Spatial Relations from Images
Hiraki, K., Gennari, J. H., Yamamoto, Y., & Anzai, Y. (1991) · Elsevier eBooks · doi:10.1016/b978-1-55860-200-7.50084-2 · Cited by 10
Applications of machine learning
Morik, K. J. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55546-3_31 · Cited by 10
Induction of logic programs with more than one recursive clause by analyzing saturations
Furusawa, M., Inuzuka, N., Seki, H., & Itoh, H. (1997) · Lecture notes in computer science · doi:10.1007/3540635149_45 · Cited by 10
Transferring and etraining Learned
Cohen, W. W., & Kudenko⋆, D. (1997) · Cited by 10
A Refinement Operator for Theories
Badea, L. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44797-0_1 · Cited by 10
Learning logic programs by using the product homomorphism method
Horváth, T., Sloan, R. H., & Turán, G. (1997) · Conference on Learning Theory · doi:10.1145/267460.267468 · Cited by 10
Inductive logic programming for relational knowledge discovery
Lavrač, N., Džeroski, S., & Numao, M. (1999) · New Generation Computing · doi:10.1007/bf03037580 · Cited by 11
Information extraction with automatic knowledge expansion
Jung, H., Yi, E., Kim, D., & Lee, G. G. (2003) · Information Processing & Management · doi:10.1016/s0306-4573(03)00066-9 · Cited by 10
Detection of bronchovascular pairs on HRCT lung images through relational learning
Prasad, M. N., & Sowmya, A. (2005) · IEEE International Symposium on Biomedical Imaging (ISBI) · doi:10.1109/isbi.2004.1398743 · Cited by 10
(2004) · Lecture notes in computer science · doi:10.1007/b99475 · Cited by 10
Extension of the Top-Down Data-Driven Strategy to ILP
Alphonse, É., & Rouveirol, C. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73847-3_13 · Cited by 10
Specialization of recursive predicates
Boström, H. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59286-5_51 · Cited by 10
Knowledge discovery from distributed and textual data
Cho, V. (1999) · doi:10.14711/thesis-b627670 · Cited by 10
Efficient Random Walk Inference with Knowledge Bases
Lao, N. (2025) · doi:10.1184/r1/28840673 · Cited by 9
Learning with Kernels and Logical Representations
Frasconi, P. (2008) · Springer eBooks · doi:10.1007/978-3-540-78469-2_1 · Cited by 9
Learning Guided Planning for Robust Task Execution in Cognitive Robotics
Karapınar, S., Sarıel, S., Yıldız, P., & Ersen, M. (2013) · Cited by 9
Improving Rare Tree Species Classification Using Domain Knowledge
Harmon, I., Marconi, S., Weinstein, B. G., Bai, Y., Wang, D. Z., White, E. P., & Bohlman, S. (2023) · IEEE Geoscience and Remote Sensing Letters · doi:10.1109/lgrs.2023.3278170 · Cited by 9
Machine learning applications in anthropology: Automated discovery over kinship structures
Cunningham, S. J. (1997) · Computers and the Humanities · doi:10.1007/bf00057936 · Cited by 9
Knowledge Discovery in Biomedical Data: Theory and Methods
Holmes, J. H. (2013) · Elsevier eBooks · doi:10.1016/b978-0-12-401678-1.00007-5 · Cited by 9
Processing the structure of documents: Logical Layout Analysis of historical newspapers in French
Gutehrlé, N., & Atanassova, I. (2022) · Journal of Data Mining & Digital Humanities · doi:10.46298/jdmdh.9093 · Cited by 9
FOIL-D: Efficiently Scaling FOIL for Multi-relational Data Mining of Large Datasets
Bockhorst, J. P., & Ong, I. M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30109-7_9 · Cited by 9
Mining in the Proximity of Subgraphs
Ketkar, N. S., Holder, L. B., & Cook, D. J. (2006) · Cited by 9
Finding representative association rules from large rule collections
Davis, W., Schwarz, P., & Terzi, E. (2009) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972795.45 · Cited by 9
Machine learning in engineering automation —The present and the future
Whitehall, B. L., & Lu, S. C.-Y. (1991) · Computers in Industry · doi:10.1016/0166-3615(91)90023-3 · Cited by 9
uRule: A Rule-Based Classification System for Uncertain Data
Qin, B., Xia, Y., Sathyesh, R., Prabhakar, S., & Tu, Y.-C. (2010) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2010.73 · Cited by 9
Machine Learning and Data Mining
Fürnkranz, J., Gamberger, D., & Lavrač, N. (2012) · Cognitive technologies · doi:10.1007/978-3-540-75197-7_1 · Cited by 9
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
