Learning logic programs by discovering where not to search
The goal of inductive logic programming (ILP) is to search for a hypothesis that generalises training examples and background knowledge (BK). To improve performance, we introduce an approach that, before searching for a hypothesis, first discovers "where not to search". We use given BK to...
Prif Awduron: | Cropper, A, Hocquette, C |
---|---|
Fformat: | Conference item |
Iaith: | English |
Cyhoeddwyd: |
Association for the Advancement of Artificial Intelligence
2023
|
Eitemau Tebyg
-
Learning logic programs by discovering higher-order abstractions
gan: Hocquette, C, et al.
Cyhoeddwyd: (2024) -
Learning logic programs by combining programs
gan: Cropper, A, et al.
Cyhoeddwyd: (2023) -
Learning MDL logic programs from noisy data
gan: Hocquette, C, et al.
Cyhoeddwyd: (2024) -
Learning programs with magic values
gan: Hocquette, MEJ, et al.
Cyhoeddwyd: (2023) -
Learning big logical rules by joining small rules
gan: Hocquette, C, et al.
Cyhoeddwyd: (2024)