activity
20032023
most citedPure Nash Equilibria: Hard and Easy Games

92 citations · 177 across the 17 of their papers we have counts for

collaborators
Showing cs.AIShow all

5 papers · 1 filter

cs.AI2017

Tree Projections and Constraint Optimization Problems: Fixed-Parameter Tractability and Parallel Algorithms

Georg Gottlob, Gianlugi Greco, Francesco Scarcello

Tree projections provide a unifying framework to deal with most structural decomposition methods of constraint satisfaction problems (CSPs). Within this framework, a CSP instance i…

cs.AI2012

Tractable Optimization Problems through Hypergraph-Based Structural Restrictions

Georg Gottlob, Gianluigi Greco, Francesco Scarcello

Several variants of the Constraint Satisfaction Problem have been proposed and investigated in the literature for modelling those scenarios where solutions are associated with some…

cs.AI2012★ 3 cited

Magic Sets for Disjunctive Datalog Programs

Mario Alviano, Wolfgang Faber, Gianluigi Greco +1

In this paper, a new technique for the optimization of (partially) bound queries over disjunctive Datalog programs with stratified negation is presented. The technique exploits the…

cs.AI2010★ 13 cited

On The Power of Tree Projections: Structural Tractability of Enumerating CSP Solutions

Gianluigi Greco, Francesco Scarcello

The problem of deciding whether CSP instances admit solutions has been deeply studied in the literature, and several structural tractability results have been derived so far. Howev…

cs.AI2004

Outlier Detection by Logic Programming

Fabrizio Angiulli, Gianluigi Greco, Luigi Palopoli

The development of effective knowledge discovery techniques has become in the recent few years a very active research area due to the important impact it has in several relevant ap…