Combining FOIL and EBG to Speed-Up Logic Programs (1993)
This paper presents an algorithm that combines traditional EBL techniques and recent developments in inductive logic programming to learn effective clause selection rules for Prolog programs. When these control rules are incorporated into the original program, significant speed-up may be achieved. The algorithm is shown to be an improvement over competing EBL approaches in several domains. Additionally, the algorithm is capable of automatically transforming some intractable algorithms into ones that run in polynomial time.
View:
PDF, PS
Citation:
In Proceedings of the 13th International Joint Conference on Artificial Intelligence, 1106-1111, 1993. San Francisco, CA: Morgan Kaufmann.
Bibtex:

Raymond J. Mooney Professor mooney@cs.utexas.edu
John M. Zelle Alumni (Alumni) john.zelle@wartburg.edu