Tags:graph encoding, Horn clauses, ILP and SLD-resolution
Abstract:
We introduce the derivation reduction problem, the undecidable problem of finding a finite subset of a set of clauses such that the whole set can be derived using SLD-resolution. We also study the derivation reducibility of various fragments of second-order Horn logic using a graph encoding technique, with particular applications in the field of Inductive Logic Programming.
SLD-Resolution Reduction of Second-Order Horn Fragments - Extended Abstract