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...
| Hlavní autoři: | , |
|---|---|
| Médium: | Conference item |
| Jazyk: | English |
| Vydáno: |
Association for the Advancement of Artificial Intelligence
2023
|