Skip to main content

1997 | ReviewPaper | Buchkapitel

On the complexity of some Inductive Logic Programming problems

verfasst von : Georg Gottlob, Nicola Leone, Francesco Scarcello

Erschienen in: Inductive Logic Programming

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

The bounded ILP-consistency problem for function-free Horn clauses is described as follows. Given a set E+ and E− of function-free ground Horn clauses and an integer k polynomial in E+∪E−, does there exist a function-free Horn clause C with no more than k literais such that C subsumes each element in E+ and C does not subsume any element in E−. It is shown that this problem is Σ2P complete. We derive some related results on the complexity of ILP and discuss the usefulness of such complexity results.

Metadaten
Titel
On the complexity of some Inductive Logic Programming problems
verfasst von
Georg Gottlob
Nicola Leone
Francesco Scarcello
Copyright-Jahr
1997
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/3540635149_31