Stephen H. Muggleton. Learning the Time Complexity of Logic Programs. In Emanuel Kitzelmann, Roland Olsson, Ute Schmid, editors, Workshop on Approaches and Applications of Inductive Programming, AAIP 2005, to be held in conjunction with the 22nd International Conference on Machine Learning (ICML 2005), Bonn, Germany, August 7, 2005. pages 9, 2005. [doi]
@inproceedings{Muggleton05-0, title = {Learning the Time Complexity of Logic Programs}, author = {Stephen H. Muggleton}, year = {2005}, url = {https://cogsys.uni-bamberg.de/events/aaip05/proceedings/abs_muggleton.pdf}, researchr = {https://researchr.org/publication/Muggleton05-0}, cites = {0}, citedby = {0}, pages = {9}, booktitle = {Workshop on Approaches and Applications of Inductive Programming, AAIP 2005, to be held in conjunction with the 22nd International Conference on Machine Learning (ICML 2005), Bonn, Germany, August 7, 2005}, editor = {Emanuel Kitzelmann and Roland Olsson and Ute Schmid}, }