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...

Top-down induction of decision trees (TDIDT) is a very popular machine learning technique. Up till now, it has mainly been used for propositional learning, but seldomly for relational learning or inductive logic programming. The main contribution of this paper is the introduction of logical decision trees, which make it possible to use TDIDT in inductive logic programming. An implementation of this top-down induction of logical decision trees, the Tilde system, is presented and experimentally evaluated. 1

Declarative meta-programming is vital, since it is the most promising means by which programs can be made to reason about other programs. A metaprogram is a program that takes another program, called the object program, as data. A declarative programming language is a programming language based on a logic that has a model theory. A meta-program operates on a representation of an object...

Parallel computers and distributed systems are becoming increasingly important. Their impressive computation to cost ratios o#er a considerable higher performance than that possible with sequential machines. Yet there are few commercial applications written for them. The reason is that programming in these environments is substantially more di#cult than programming for sequential machines. In this thesis, we presentTempo and Tempo++, two programming languages which aim to reduce the inherent complexity of writing concurrent programs.

Abstract not found