|
Abstract : |
The generic task of Inductive Logic Programming (ILP) is to search a predefined subspace of first-order logic for hypotheses that in some respect explain examples and background knowledge. In this paper we consider the development of parallel implementations of ILP systems. A first part discusses the division of the ILP-task into subtasks that can be handled concurrently by multiple processes executing a common sequential ILP algorithm. We define the notion of a valid partition of an ILP-task, and test this definition against two problem specifications that have been employed within ILP. The second part of the paper focuses on the comparative evaluation of a parallel version of the clausal discovery system Claudien., |
