Abstract

Learning complex programs through inductive logic programming (ILP) remains a formidable challenge. Existing higher-order enabled ILP systems show improved accuracy and learning performance, though remain hampered by the limitations of the underlying learning mechanism. Experimental results show that our extension of the versatile Learning From Failures paradigm by higher-order definitions significantly improves learning performance without the burdensome human guidance required by existing systems. Our theoretical framework captures a class of higher-order definitions preserving soundness of existing subsumption-based pruning methods.

BibTeX

@inproceedings{spdcck-ijcai22,
 author = {Stanisław Purgał and David Cerna and Cezary Kaliszyk},
 booktitle = {Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, {IJCAI} 2022},
 doi = {10.24963/ijcai.2022/378},
 editor = {Luc De Raedt},
 pages = {2726--2733},
 publisher = {ijcai.org},
 title = {Learning Higher-Order Programs without Meta-Interpretive Learning},
 url = {https://doi.org/10.24963/ijcai.2022/378},
 year = {2022}
}