Combining FOIL and EBG to Speed-up Logic Programs

Abstract

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. 1 Introduction Explanation-based learning (EBL) research in logic programming has generally focussed on learning macros (compiled rules) [ Mitchell et al., 1986; DeJong and Mooney, 1986; Prieditis and Mostow, 1987 ] , while EBL work in planning and production systems has tended to focus on learning search-control rules [ Minton, 1988; Laird et al., 1986 ] . Recently, Cohen [ Cohen, 1990 ] has argued the advantages of learning search control rules for the clause se...