Can HOLL Outperform FOLL?

@inproceedings{Pahlavi2010CanHO,
  title={Can HOLL Outperform FOLL?},
  author={Niels Pahlavi and Stephen Muggleton},
  booktitle={ILP},
  year={2010}
}
Learning first-order recursive theories remains a difficult learning task in a normal Inductive Logic Programming (ILP) setting, although numerous approaches have addressed it; using Higher-order Logic (HOL) avoids having to learn recursive clauses for such a task. It is one of the areas where Higher-order Logic Learning (HOLL), which uses the power of expressivity of HOL, can be expected to improve the learnability of a problem compared to First-order Logic Learning (FOLL). We present a first… CONTINUE READING
BETA

Similar Papers

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

Inverse entailment and progol

  • New Generation Computing
  • 1995
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Learning Recursive Theories in the Normal ILP Setting

  • Fundam. Inform.
  • 2003
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Logic for Learning

  • Cognitive Technologies
  • 2003
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Higher-Order Horn Clauses

VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Muggleton . Inverse entailment and Progol

H. S.
  • New Generation Computing
  • 1998