Skip to Main content Skip to Navigation
New interface
Book sections

SLD-Resolution Reduction of Second-Order Horn Fragments

Sophie Tourret 1, 2 Andrew Cropper 3 
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : ()[0000−0002−6070−796X] and Andrew Cropper 2[0000−0002−4543−7199] 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.
Complete list of metadata

Cited literature [49 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02988015
Contributor : Sophie Tourret Connect in order to contact the contributor
Submitted on : Thursday, November 5, 2020 - 9:12:44 AM
Last modification on : Thursday, January 20, 2022 - 5:26:11 PM
Long-term archiving on: : Saturday, February 6, 2021 - 6:26:58 PM

File

jelia2019tc.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Sophie Tourret, Andrew Cropper. SLD-Resolution Reduction of Second-Order Horn Fragments. Logics in Artificial Intelligence - 16th European Conference, JELIA 2019, Rende, Italy, May 7-11, 2019, Proceedings, pp.259-276, 2019, ⟨10.1007/978-3-030-19570-0_17⟩. ⟨hal-02988015⟩

Share

Metrics

Record views

12

Files downloads

117