Extends MIL to learn higher-order programs via higher-order background knowledge, with theory showing reduced hypothesis space and experiments on four domains showing better accuracy and speed than first-order learning.
Efficient exhaustive generation of functional programs using monte-carlo search with iterative deepening
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Learning higher-order logic programs
Extends MIL to learn higher-order programs via higher-order background knowledge, with theory showing reduced hypothesis space and experiments on four domains showing better accuracy and speed than first-order learning.