This code is part of the BEP projects of F. Azimzade, B. Jenneboer, N. Matulewicz, S. Rasing and V. van Wieringen.
Robot and Pixel test/training data was generated by A. Cropper and S. Dumančić for their paper "Learning large logic programs by going beyond entailment." arXiv preprint arXiv:2004.09855 (2020).
The String test/training data was received from S. Dumančić who took them from the paper by Lin, Dianhuan, et al. "Bias reformulation for one-shot function induction." (2014).
There are three runnable main files for this project: main.py, debug_main.py and hpc_main.py.
This main is an easy to run file that can run test cases and print out some results. In this file you can set the time limit, search algorithm, domain, heuristic (or distance measure) to use and number of trials that will be run. In the file each setting is explained further.
This main implements an easy way to debug the code. The settings are almost the same as in the normal main.py file, only without the number of trials. There is a more elaborate way to set which test cases to run, which is explained in the file. When a test case is completed (either solved or time out) a console line is printed with its results.
This main can be used for the High Performance Cluster (HPC). With system arguments the search algorithm, domain and distance heuristic can be set. You can also run this on your own PC. Test case results will be stored when run by this file.