Conference item
Learning logic programs through divide, constrain, and conquer
- Abstract:
- 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, inductive general game playing, and program synthesis) show that our approach can increase predictive accuracies and reduce learning times.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, 181.9KB, Terms of use)
-
- Publisher copy:
- 10.1609/aaai.v36i6.20596
Authors
- Publisher:
- Association for the Advancement of Artificial Intelligence
- Host title:
- Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022)
- Volume:
- 36
- Issue:
- 6
- Pages:
- 6446-6453
- Publication date:
- 2022-06-28
- Acceptance date:
- 2021-12-01
- Event title:
- 36th AAAI Conference on Artificial Intelligence (AAAI 2022)
- Event location:
- Online
- Event website:
- https://aaai.org/Conferences/AAAI-22/aaai22call/
- Event start date:
- 2022-02-22
- Event end date:
- 2022-03-01
- DOI:
- Language:
-
English
- Keywords:
- Pubs id:
-
1239175
- Local pid:
-
pubs:1239175
- Deposit date:
-
2022-02-11
Terms of use
- Copyright holder:
- Association for the Advancement of Artificial Intelligence
- Copyright date:
- 2022
- Rights statement:
- © 2022, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
- Notes:
- This paper will be presented at the 36th AAAI Conference on Artificial Intelligence (AAAI 2022), 22nd February - 1st March 2022. This is the accepted manuscript version of the article. The final version is available online from AAAI at: https://doi.org/10.1609/aaai.v36i6.20596
If you are the owner of this record, you can report an update to it here: Report update to this record