Most Inductive Logic Programming (ILP) systems use a greedy covering algorithm to nd a set of clauses that best model positive examples. This set of clauses is called a theory and can be seen as an ensemble of clauses. It turns out that the search for a theory within the ILP system is very time consuming and often yields overly complex classi ers. One alternative approach to obtain a theory is ...

Test set compaction is a fundamental problem in digital system testing. In recent years, many competitive solutions have been proposed, most of which based on heuristics approaches. This paper studies the application of set covering models to the compaction of test sets, which can be used with any heuristic test set compaction procedure. For this purpose, recent and highly effective set coverin...