On the Complexity of Some Inductive Logic Programming Problems

Xehetasun bibliografikoak
Egile Nagusiak: Gottlob, G, Leone, N, Scarcello, F
Formatua: Conference item
Argitaratua: Springer 1997
_version_ 1826269711729426432
author Gottlob, G
Leone, N
Scarcello, F
author_facet Gottlob, G
Leone, N
Scarcello, F
author_sort Gottlob, G
collection OXFORD
description
first_indexed 2024-03-06T21:29:23Z
format Conference item
id oxford-uuid:4425a9c2-ad5f-4c0c-9bf6-06ae116a2cf3
institution University of Oxford
last_indexed 2024-03-06T21:29:23Z
publishDate 1997
publisher Springer
record_format dspace
spelling oxford-uuid:4425a9c2-ad5f-4c0c-9bf6-06ae116a2cf32022-03-26T14:59:49ZOn the Complexity of Some Inductive Logic Programming ProblemsConference itemhttp://purl.org/coar/resource_type/c_5794uuid:4425a9c2-ad5f-4c0c-9bf6-06ae116a2cf3Department of Computer ScienceSpringer1997Gottlob, GLeone, NScarcello, F
spellingShingle Gottlob, G
Leone, N
Scarcello, F
On the Complexity of Some Inductive Logic Programming Problems
title On the Complexity of Some Inductive Logic Programming Problems
title_full On the Complexity of Some Inductive Logic Programming Problems
title_fullStr On the Complexity of Some Inductive Logic Programming Problems
title_full_unstemmed On the Complexity of Some Inductive Logic Programming Problems
title_short On the Complexity of Some Inductive Logic Programming Problems
title_sort on the complexity of some inductive logic programming problems
work_keys_str_mv AT gottlobg onthecomplexityofsomeinductivelogicprogrammingproblems
AT leonen onthecomplexityofsomeinductivelogicprogrammingproblems
AT scarcellof onthecomplexityofsomeinductivelogicprogrammingproblems