Authors: Gottlob, G Leone, N Scarcello, F

Citation: G. Gottlob et al., The complexity of acyclic conjunctive queries, J ACM, 48(3), 2001, pp. 431-498

Authors: Gottlob, G Leone, N Scarcello, F

Citation: G. Gottlob et al., A comparison of structural CSP decomposition methods, ARTIF INTEL, 124(2), 2000, pp. 243-282

Authors: Cadoli, M Scarcello, F

Citation: M. Cadoli et F. Scarcello, Semantical and computational aspects of Horn approximations, ARTIF INTEL, 119(1-2), 2000, pp. 1-17

Authors: Cadoli, M Palopoli, L Scarcello, F

Citation: M. Cadoli et al., Propositional lower bounds: Algorithms and complexity, ANN MATH A, 27(1-4), 1999, pp. 129-148

Authors: Gottlob, G Leone, N Scarcello, F

Citation: G. Gottlob et al., On the complexity of some inductive logic programming problems, NEW GEN COM, 17(1), 1999, pp. 53-75