Abstract
AbstractA magic value in a program is a constant symbol that is essential for the execution of the program but has no clear explanation for its choice. Learning programs with magic values is difficult for existing program synthesis approaches. To overcome this limitation, we introduce an inductive logic programming approach to efficiently learn programs with magic values. Our experiments on diverse domains, including program synthesis, drug design, and game playing, show that our approach can (1) outperform existing approaches in terms of predictive accuracies and learning times, (2) learn magic values from infinite domains, such as the value of pi, and (3) scale to domains with millions of constant symbols.
Funder
Engineering and Physical Sciences Research Council
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Software
Reference46 articles.
1. Augusto, D. A., & Barbosa, H. J. (2000). Symbolic regression via genetic programming. In Proceedings. Vol. 1. Sixth Brazilian symposium on neural networks (pp. 173–178). IEEE.
2. Austel, V., Dash, S., Gunluk, O., Horesh, L., Liberti, L., Nannicini, G., & Schieber, B. (2017). Globally optimal symbolic regression. In Interpretable ML, satellite workshop of NIPS 2017.
3. Blockeel, H., De Raedt, L., & Ramon, J. (1998). Top-down induction of clustering trees. In ICML.
4. Blockeel, H., & De Raedt, L. (1997). Lookahead and discretization in ILP. In N. Lavrač & S. Džeroski (Eds.), Inductive Logic Programming (pp. 77–84). Berlin: Springer.
5. Blockeel, H., & De Raedt, L. (1998). Top-down induction of first-order logical decision trees. Artificial Intelligence, 101(1–2), 285–297.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献