On the Complexity of Some Inductive Logic Programming Problems
Principais autores: | Gottlob, G, Leone, N, Scarcello, F |
---|---|
Formato: | Conference item |
Publicado em: |
Springer
1997
|
Registros relacionados
-
On the Complexity of Some Inductive Logic Programming Problems
por: Gottlob, G, et al.
Publicado em: (1999) -
Complexity Results for Abductive Logic Programming
por: Eiter, T, et al.
Publicado em: (1995) -
Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width
por: Gottlob, G, et al.
Publicado em: (2003) -
Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
por: Gottlob, G, et al.
Publicado em: (2001) -
Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
por: Gottlob, G, et al.
Publicado em: (2001)