SLD-Resolution Reduction of Second-Order Horn Fragments -- technical report --
classification
💻 cs.LO
keywords
sld-resolutionfragmentshornlogicproblemreductionsecond-orderapplications
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.