## 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.

### Weitere Dienste

Verfasserangaben: Robert Kolter urn:nbn:de:hbz:386-kluedo-49800 Interner Bericht des Fachbereich Informatik (325) Bericht Englisch 27.10.2017 2003 Technische Universität Kaiserslautern 27.10.2017 40 Fachbereich Informatik 0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik Creative Commons 4.0 - Namensnennung, nicht kommerziell, keine Bearbeitung (CC BY-NC-ND 4.0)