资源分类
》 资源 》论文》Logic-Based Inductive Synthesis of Efficient Programs

Logic-Based Inductive Synthesis of Efficient Programs

2019-11-25 | |  49 |   39 |   0
Abstract Inductive programming approaches typically rely on an Occamist bias to select hypotheses with minimal textual complexity. This approach, however, fails to distinguish between the efficiencies of hypothesised programs, such as merge sort (O(n log n)) and bubble sort (O(n2 )). We address this issue by introducing techniques to learn logic programs with minimal resource complexity. We describe an algorithm proven to learn minimal resource complexity robot strategies, and we propose future work to generalise the approach to a broader class of programs.

上一篇：Combining Logic and Probability: P-log Perspective

下一篇：An Approach to Cooperation in General-Sum Normal Form Games

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...