On the Complexity of Some Inductive Logic Programming Problems
Главные авторы: | Gottlob, G, Leone, N, Scarcello, F |
---|---|
Формат: | Conference item |
Опубликовано: |
Springer
1997
|
Схожие документы
-
On the Complexity of Some Inductive Logic Programming Problems
по: Gottlob, G, и др.
Опубликовано: (1999) -
Complexity Results for Abductive Logic Programming
по: Eiter, T, и др.
Опубликовано: (1995) -
Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width
по: Gottlob, G, и др.
Опубликовано: (2003) -
Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
по: Gottlob, G, и др.
Опубликовано: (2001) -
Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
по: Gottlob, G, и др.
Опубликовано: (2001)