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...
Váldodahkkit: | Cropper, A, Hocquette, C |
---|---|
Materiálatiipa: | Conference item |
Giella: | English |
Almmustuhtton: |
Association for the Advancement of Artificial Intelligence
2023
|
Geahča maid
-
Learning logic programs by discovering higher-order abstractions
Dahkki: Hocquette, C, et al.
Almmustuhtton: (2024) -
Learning logic programs by combining programs
Dahkki: Cropper, A, et al.
Almmustuhtton: (2023) -
Learning MDL logic programs from noisy data
Dahkki: Hocquette, C, et al.
Almmustuhtton: (2024) -
Learning programs with magic values
Dahkki: Hocquette, MEJ, et al.
Almmustuhtton: (2023) -
Learning big logical rules by joining small rules
Dahkki: Hocquette, C, et al.
Almmustuhtton: (2024)