#### Filter Results:

- Full text PDF available (70)

#### Publication Year

2001

2018

- This year (4)
- Last 5 years (42)
- Last 10 years (89)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Georg Gottlob, Gianluigi Greco, Francesco Scarcello
- J. Artif. Intell. Res.
- 2003

In this paper we investigate complexity issues related to pure Nash equilibria of strategic games. We show that, even in very restrictive settings, determining whether a game has a pure Nash Equilibrium is NP-hard, while deciding whether a game has a strong Nash equilibrium is Σ<sup><i>P</i></sup><sub>2</sub>-complete. We then study practically… (More)

- Gianluigi Greco, Antonella Guzzo, Luigi Pontieri, Domenico Saccà
- IEEE Transactions on Knowledge and Data…
- 2006

Process mining techniques have recently received notable attention in the literature; for their ability to assist in the (re)design of complex processes by automatically discovering models that explain the events registered in some log traces provided as input. Following this line of research, the paper investigates an extension of such basic approaches,… (More)

- Chiara Cumbo, Wolfgang Faber, Gianluigi Greco, Nicola Leone
- ICLP
- 2004

We present a new technique for the optimization of (partially) bound queries over disjunctive datalog programs. The technique exploits the propagation of query bindings, and extends the Magic-Set optimization technique (originally defined for non-disjunctive programs) to the disjunctive case, substantially improving on previously defined approaches.… (More)

- Gianluigi Greco, Sergio Greco, Ester Zumpano
- ICLP
- 2001

- Gianluigi Greco, Sergio Greco, Ester Zumpano
- IEEE Trans. Knowl. Data Eng.
- 2003

- Thomas Eiter, Michael Fink, Gianluigi Greco, Domenico Lembo
- ICLP
- 2003

Many data integration systems provide transparent access to heterogeneous data sources through a unified view of all data in terms of a global schema, which may be equipped with integrity constraints on the data. Since these constraints might be violated by the data retrieved from the sources, methods for handling such a situation are needed. To this end,… (More)

- Wolfgang Faber, Gianluigi Greco, Nicola Leone
- SEBD
- 2005

We propose a generalization of the well-known Magic Sets technique to Datalog¬ programs with (possibly unstratified) negation under stable model semantics. Our technique produces a new program whose evaluation is generally more efficient (due to a smaller instantiation), while preserving soundness under cautious reasoning. Importantly, if the original… (More)

- Ana Karla A. de Medeiros, Antonella Guzzo, +4 authors Domenico Saccà
- Business Process Management Workshops
- 2007

Process mining techniques attempt to extract non-trivial and useful information from event logs recorded by information systems. For example, there are many process mining techniques to automatically discover a process model based on some event log. Most of these algorithms perform well on structured processes with little disturbances. However, in reality… (More)

The computational complexity of relevant corerelated questions for coalitional games is addressed from the coalition structure viewpoint, i.e., without assuming that the grand-coalition necessarily forms. In the analysis, games are assumed to be in “compact” form, i.e., their worth functions are implicitly given as polynomial-time computable functions over… (More)

- Mario Alviano, Wolfgang Faber, Gianluigi Greco, Nicola Leone
- Artif. Intell.
- 2012

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 propagation of query bindings and extends the Magic Set optimization technique (originally defined for non-disjunctive programs). An important feature of disjunctive Datalog… (More)