*Result*: Implementation issues in Inductive Logic Programming
Title:
Implementation issues in Inductive Logic Programming
Authors:
Contributors:
The Pennsylvania State University CiteSeerX Archives
Publication Year:
2003
Collection:
CiteSeerX
Subject Terms:
Document Type:
*Academic Journal*
text
File Description:
application/postscript
Language:
English
Availability:
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Accession Number:
edsbas.6A688F01
Database:
BASE
*Further Information*
*We propose several algorithms for ecient Testing of logical Implication in the case of ground objects. Because the problem of Testing a set of propositional formulas for (un)satis ability is NP-complete there's strong evidence that there exist examples for which every algorithm which solves the problem of testing for (un)satis ability has a runtime that is exponential in the length of the input. So will have our algorithms. We will therefore point out classes of logic programs for which our algorithms have a lower runtime.*