• Home
  • Search
  • Revising the logical foundations of inductive logic programming systems with ground reduced programs
  • Cite Icon10
  • https://doi.org/10.1007/bf03037585Copy DOI Icon

Revising the logical foundations of inductive logic programming systems with ground reduced programs

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this paper we revise Muggleton’s theory of inverse entailment, which is the logical foundation of Progol, one of the most famous ILP systems. We first point out that the theory is incomplete in general. Secondly we prove that the theory is complete if the background knowledge given to the system is a ground reduced program, every training example is a ground unit clause, and the hypothesis space is the set of all definite clauses. The proof is obtained by showing that every ground reduced logic program is logically equivalent to the conjunction of all atoms in its least Herbrand model. As a corollary to this equivalence, we are finally able to improve the logical foundation of the GOLEM system.

Similar Papers
  • Research Article
  • Citations69

Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation

  • Jul 01, 2000
  • Journal of Automated Reasoning
  • François Bry +1
  • Research Article
  • Citations117

Inductive Logic Programming: Issues, results and the challenge of Learning Language in Logic

  • Oct 01, 1999
  • Artificial Intelligence
  • Stephen Muggleton
  • PDF
  • Research Article
  • Citations38

Learning efficient logic programs

  • Apr 23, 2018
  • Machine Learning
  • Andrew Cropper +1
  • PDF
  • Research Article

Meta-Interpretive LEarning with Reuse

  • Mar 20, 2024
  • Mathematics
  • Rong Wang +3
  • PDF
  • Research Article
  • Citations1

Neuro-symbolic Predicate Invention: Learning relational concepts from visual scenes

  • Mar 01, 2025
  • Neurosymbolic Artificial Intelligence
  • Jingyuan Sha +3
  • Research Article
  • Citations18

Improving scalability of inductive logic programming via pruning and best-effort optimisation

  • Jun 16, 2017
  • Expert Systems with Applications
  • Mishal Kazmi +2
  • Research Article

Symmetry Breaking for Inductive Logic Programming

  • Mar 14, 2026
  • Andrew Cropper +2
  • Book Chapter
  • Citations5

Stochastic Refinement

  • Jan 01, 2011
  • Alireza Tamaddoni-Nezhad +1
  • Book Chapter
  • Citations5

The semantics of disjunctive deductive databases

  • Jan 01, 1990
  • Hugo Volger
  • Book Chapter
  • Citations5

IndLog — Induction in Logic

  • Jan 01, 2004
  • Rui Camacho
  • Book Chapter
  • Citations10

An Investigation into the Role of Domain-Knowledge on the Use of Embeddings

  • Jan 01, 2018
  • Lovekesh Vig +3
  • Conference Article

Induction Learning Based on Specific Objects

  • Jul 29, 2021
  • Haoran Wang +2
  • Book Chapter
  • Citations6

On the Complexity of H-Subsumption

  • Jan 01, 1999
  • Reinhard Pichler
  • Conference Article
  • Citations3

From a multi-agent simulation theory to GALATEA

  • Jul 16, 2007
  • Jacinto Dávila +2
  • Research Article
  • Citations21

Translations and similarity-based logic programming

  • Apr 23, 2001
  • Soft Computing
  • M I Sessa
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.