Query Optimization in Inductive Logic Programming by Reordering Literals

This publication has 9 references indexed in Scilit:

• Beyond independence: probabilistic models for query approximation on binary transaction data
  IEEE Transactions on Knowledge and Data Engineering, 2003
• Lattice-Search Runtime Distributions May Be Heavy-Tailed
  Published by Springer Nature ,2003
• Compact Representation of Knowledge Bases in ILP
  Published by Springer Nature ,2003
• Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs
  Journal of Artificial Intelligence Research, 2002
• An Assessment of ILP-assisted models for toxicology and the PTE-3 experiment
  Published by Springer Nature ,1999
• Scaling Up Inductive Logic Programming by Learning from Interpretations
  Data Mining and Knowledge Discovery, 1999
• Inverse entailment and progol
  New Generation Computing, 1995
• Foundations of Logic Programming
  Published by Springer Nature ,1987
• Query Optimization in Database Systems
  ACM Computing Surveys, 1984