Conference item
SLD-resolution reduction of second-order horn fragments
- 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.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 336.0KB)
-
- Publisher copy:
- 10.1007/978-3-030-19570-0_17
Authors
Bibliographic Details
- Publisher:
- Springer Verlag Publisher's website
- Host title:
- Lecture Notes in Computer Science
- Journal:
- Lecture Notes in Computer Science Journal website
- Volume:
- 11468
- Pages:
- 259-276
- Publication date:
- 2019-05-01
- Acceptance date:
- 2019-01-18
- DOI:
- ISSN:
-
0302-9743
- ISBN:
- 9783030195694
Item Description
- Pubs id:
-
pubs:1007300
- UUID:
-
uuid:8e9bbfbb-4626-48ca-b837-4c4ef1113914
- Local pid:
- pubs:1007300
- Source identifiers:
-
1007300
- Deposit date:
- 2019-07-18
Terms of use
- Copyright holder:
- Springer Nature
- Copyright date:
- 2019
- Notes:
- © Springer Nature Switzerland AG 2019
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record