Learning logic programs through divide, constrain, and conquer
We introduce an inductive logic programming approach that combines classical divide-and-conquer search with modern constraint-driven search. Our anytime approach can learn optimal, recursive, and large programs and supports predicate invention. Our experiments on three domains (classification, induc...
| 第一著者: | |
|---|---|
| フォーマット: | Conference item |
| 言語: | English |
| 出版事項: |
Association for the Advancement of Artificial Intelligence
2022
|