On the Complexity of Some Inductive Logic Programming Problems
Prif Awduron: | Gottlob, G, Leone, N, Scarcello, F |
---|---|
Fformat: | Conference item |
Cyhoeddwyd: |
Springer
1997
|
Eitemau Tebyg
-
On the Complexity of Some Inductive Logic Programming Problems
gan: Gottlob, G, et al.
Cyhoeddwyd: (1999) -
Complexity Results for Abductive Logic Programming
gan: Eiter, T, et al.
Cyhoeddwyd: (1995) -
Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width
gan: Gottlob, G, et al.
Cyhoeddwyd: (2003) -
Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
gan: Gottlob, G, et al.
Cyhoeddwyd: (2001) -
Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
gan: Gottlob, G, et al.
Cyhoeddwyd: (2001)