Deriving Formulas for Integer Sequences Using Inductive Programming
- 191 Downloads
Solving integer sequences, correctly predicting the next number in a given sequence, is a challenging task for both humans and artificial intelligence. We present a method to derive a formula for an integer sequence given a subsequence. By splitting the known subsequence into ‘windows’, we can derive constraints in the form of linear combinations, which can be generalised to find a formula for the complete sequence. This approach is effective and can compete with existing methods based on pattern recognition and Artificial Neural Networks with regard to performance, success rate, and output quality.
KeywordsInteger sequences Number series Inductive programming Linear combinations
We would like to thank our supervisor Prof. Luc De Raedt for his guidance and support during our bachelor’s thesis.
- 1.Düsel, M., Werner, A., Zeißner, T.: Solving number series with the MagicHaskeller. Technical report, University of Bamberg (2012)Google Scholar
- 2.Hernández-Orallo, J., Martínez-Plumed, F., Schmid, U., Siebers, M., Dowe, D.L.: Computer models solving intelligence test problems: progress andimplications. Artif. Intell. 230, 74–107 (2016). https://doi.org/10.1016/j.artint.2015.09.011. http://www.sciencedirect.com/science/article/pii/S0004370215001538CrossRefGoogle Scholar
- 3.Milovec, M.: Applying inductive programming to solving number series problems. Master’s thesis, University of Bamberg (2014)Google Scholar
- 4.OEIS Foundation Inc.: The Online Encyclopedia of Integer Sequences (2018). https://oeis.org/