2000 character limit reached
SLD-Resolution Reduction of Second-Order Horn Fragments -- technical report -- (1902.09900v1)
Published 26 Feb 2019 in cs.LO
Abstract: We present the derivation reduction problem for SLD-resolution, the undecidable problem of finding a finite subset of a set of clauses from which the whole set can be derived using SLD-resolution. We study the reducibility of various fragments of second-order Horn logic with particular applications in Inductive Logic Programming. We also discuss how these results extend to standard resolution.