SLD-Resolution Reduction of Second-Order Horn Fragments -- technical report --
Logic in Computer Science
2019-02-27 v1
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.
Keywords
Cite
@article{arxiv.1902.09900,
title = {SLD-Resolution Reduction of Second-Order Horn Fragments -- technical report --},
author = {Sophie Tourret and Andrew Cropper},
journal= {arXiv preprint arXiv:1902.09900},
year = {2019}
}
Comments
technical report, extends a conference paper accepted at JELIA 2019 with detailed proofs