Boosting Inductive Logic Programming via Decomposition, Merging, and Refinement

Abstrakt

The papers describes a technique for improving efficiency of generating templates for inductive logic programming via decomposition of examples and merging and refinement of hypothesis.

Klíčová slova

• Inductive Logic Programming
• Decomposition
• Merging
• Refinement