"Covering vs. Divide-and-Conquer for Top-Down Induction of Logic Programs."

Henrik Boström (1995)

Details and statistics

DOI:

access: open

type: Conference or Workshop Paper

metadata version: 2019-08-20

a service of  Schloss Dagstuhl - Leibniz Center for Informatics