UNIVERSITÄTSBIBLIOTHEK
  • search hit 1 of 16
Back to Result List

Implementation issues in Inductive Logic Programming

  • We propose several algorithms for efficient Testing of logical Implication in the case of ground objects. Because the problem of Testing a set of propositional formulas for (un)satisfiability is \(NP\)-complete there's strong evidence that there exist examples for which every algorithm which solves the problem of testing for (un)satisfiability 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. At the end of this paper we will give an outline of an algorithm for theory refinement which is based on the algorithms described above.

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Robert Kolter
URN (permanent link):urn:nbn:de:hbz:386-kluedo-49800
Serie (Series number):Interner Bericht des Fachbereich Informatik (325)
Document Type:Report
Language of publication:English
Publication Date:2017/10/27
Year of Publication:2003
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):2017/10/27
Number of page:40
Faculties / Organisational entities:Fachbereich Informatik
DDC-Cassification:0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik
Licence (German):Creative Commons 4.0 - Namensnennung, nicht kommerziell, keine Bearbeitung (CC BY-NC-ND 4.0)