We present a self-learning approach for synthesizing programs from integer sequences. Our method relies on a tree search guided by a learned policy. Our system is tested on the On-Line Encyclopedia of Integer Sequences. There, it discovers, on its own, solutions for 27987 sequences starting from basic operators and without human-written training examples
Number sequence problems appear frequently in IQ tests, where the task is to extrapolate finite sequ...
Synthesis of program fragments from specifications can make programs easier to write and easier to r...
Number sequence problems appear frequently in IQ tests, where the task is to extrapolate finite sequ...
We present a self-learning approach for synthesizing programs from integer sequences. Our method rel...
Inductive program synthesis, from input/output examples, can provide an opportunity to automatically...
We introduce a self-learning algorithm for synthesizing programs for OEIS sequences. The algorithm s...
Building systems that can synthesize programs from natural specifications (such as examples or langu...
We apply techniques of experimental mathematics to certain problems in number theory and combinatori...
Abstract. Input-output examples are a simple and accessible way of describing program behaviour. Pro...
Integer Programming: Theory, Applications, and Computations provides information pertinent to the th...
We present a method for example-guided synthesis of higher-order functional pro- grams. Given a set ...
Synthesis from examples enables non-expert users to generate programs by specifying examples of thei...
Knowledge about algorithms, integers and nested patternsA Look and Say sequence is an integer sequen...
Program synthesis is a term that describes a family of techniques that enables automatic generation ...
With the advancement of modern technologies, programming becomes ubiquitous not only among professio...
Number sequence problems appear frequently in IQ tests, where the task is to extrapolate finite sequ...
Synthesis of program fragments from specifications can make programs easier to write and easier to r...
Number sequence problems appear frequently in IQ tests, where the task is to extrapolate finite sequ...
We present a self-learning approach for synthesizing programs from integer sequences. Our method rel...
Inductive program synthesis, from input/output examples, can provide an opportunity to automatically...
We introduce a self-learning algorithm for synthesizing programs for OEIS sequences. The algorithm s...
Building systems that can synthesize programs from natural specifications (such as examples or langu...
We apply techniques of experimental mathematics to certain problems in number theory and combinatori...
Abstract. Input-output examples are a simple and accessible way of describing program behaviour. Pro...
Integer Programming: Theory, Applications, and Computations provides information pertinent to the th...
We present a method for example-guided synthesis of higher-order functional pro- grams. Given a set ...
Synthesis from examples enables non-expert users to generate programs by specifying examples of thei...
Knowledge about algorithms, integers and nested patternsA Look and Say sequence is an integer sequen...
Program synthesis is a term that describes a family of techniques that enables automatic generation ...
With the advancement of modern technologies, programming becomes ubiquitous not only among professio...
Number sequence problems appear frequently in IQ tests, where the task is to extrapolate finite sequ...
Synthesis of program fragments from specifications can make programs easier to write and easier to r...
Number sequence problems appear frequently in IQ tests, where the task is to extrapolate finite sequ...