SLD-Resolution Reduction of Second-Order Horn Fragments -- technical report --

02/26/2019
by   Sophie Tourret, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/25/2019

Logical reduction of metarules

Many forms of inductive logic programming (ILP) use metarules, second-or...
research
03/14/2021

Ordered fragments of first-order logic

Using a recently introduced algebraic framework for the classification o...
research
06/09/2021

Meta-Interpretive Learning as Metarule Specialisation

In Meta-Interpretive Learning (MIL) the metarules, second-order datalog ...
research
04/23/2023

Quantifying over Trees in Monadic Second-Order Logic

Monadic Second-Order Logic (MSO) extends First-Order Logic (FO) with var...
research
04/26/2018

It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before"

Message sequence charts (MSCs) naturally arise as executions of communic...
research
07/10/2023

First order synthesis for data words revisited

We carry on the study of the synthesis problem on data words for fragmen...
research
06/19/2018

The Polylog-Time Hierarchy Captured by Restricted Second-Order Logic

Let SO^plog denote the restriction of second-order logic, where second-o...

Please sign up or login with your details

Forgot password? Click here to reset