Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
On the Complexity of Some Indu...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
On the Complexity of Some Inductive Logic Programming Problems
Show other versions (1)
Bibliographic Details
Main Authors:
Gottlob, G
,
Leone, N
,
Scarcello, F
Format:
Journal article
Published:
1999
Holdings
Description
Other Versions (1)
Similar Items
Staff View
Showing
1 - 1
results of
1
Show all versions (2)
Search Result 1
On the Complexity of Some Inductive Logic Programming Problems
by
Gottlob, G
,
Leone, N
,
Scarcello, F
Published 1997
Conference item
Show all versions (2)
Similar Items
On the Complexity of Some Inductive Logic Programming Problems
by: Gottlob, G, et al.
Published: (1997)
Complexity Results for Abductive Logic Programming
by: Eiter, T, et al.
Published: (1995)
Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width
by: Gottlob, G, et al.
Published: (2003)
Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
by: Gottlob, G, et al.
Published: (2001)
Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
by: Gottlob, G, et al.
Published: (2001)