@inproceedings{conf/icde/GhionnaGGS07,
  added-at = {2012-01-23T00:00:00.000+0100},
  author = {Ghionna, Lucantonio and Granata, Luigi and Greco, Gianluigi and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/2b09e9bc3d7cfd3425dde3445507156d5/dblp},
  booktitle = {ICDE},
  crossref = {conf/icde/2007},
  editor = {Chirkova, Rada and Dogac, Asuman and Özsu, M. Tamer and Sellis, Timos K.},
  ee = {http://doi.ieeecomputersociety.org/10.1109/ICDE.2007.367849},
  interhash = {cfe5703dd2d6315d3f5cd71569f78006},
  intrahash = {b09e9bc3d7cfd3425dde3445507156d5},
  keywords = {dblp},
  pages = {36-45},
  publisher = {IEEE},
  title = {Hypertree Decompositions for Query Optimization.},
  url = {http://dblp.uni-trier.de/db/conf/icde/icde2007.html#GhionnaGGS07},
  year = 2007
}

@article{journals/corr/cs-DB-9812022,
  added-at = {2011-12-05T00:00:00.000+0100},
  author = {Gottlob, Georg and Leone, Nicola and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/21faddf7bdb550608a0cad8c331a8d366/dblp},
  ee = {http://arxiv.org/abs/cs.DB/9812022},
  interhash = {40d33b555d08f425065d56ee88e0fa1e},
  intrahash = {1faddf7bdb550608a0cad8c331a8d366},
  journal = {CoRR},
  keywords = {dblp},
  title = {Hypertree Decompositions and Tractable Queries},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr9812.html#cs-DB-9812022},
  volume = {cs.DB/9812022},
  year = 1998
}

@article{journals/corr/cs-AI-0211004,
  added-at = {2011-12-05T00:00:00.000+0100},
  author = {Leone, Nicola and Pfeifer, Gerald and Faber, Wolfgang and Eiter, Thomas and Gottlob, Georg and Perri, Simona and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/28dcd196112fce63544f45855033826bb/dblp},
  ee = {http://arxiv.org/abs/cs.AI/0211004},
  interhash = {6a4c2add17ed72edbdc5b281c9dbc0b9},
  intrahash = {8dcd196112fce63544f45855033826bb},
  journal = {CoRR},
  keywords = {dblp},
  title = {The DLV System for Knowledge Representation and Reasoning},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr0211.html#cs-AI-0211004},
  volume = {cs.AI/0211004},
  year = 2002
}

@article{journals/corr/abs-1109-2152,
  added-at = {2011-12-05T00:00:00.000+0100},
  author = {Gottlob, Georg and Greco, Gianluigi and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/2d563d5d4b245dbf419e4f6a3b65bf09c/dblp},
  ee = {http://arxiv.org/abs/1109.2152},
  interhash = {5bc2e5b729eb58679676d90ae270b1f1},
  intrahash = {d563d5d4b245dbf419e4f6a3b65bf09c},
  journal = {CoRR},
  keywords = {dblp},
  title = {Pure Nash Equilibria: Hard and Easy Games},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr1109.html#abs-1109-2152},
  volume = {abs/1109.2152},
  year = 2011
}

@article{journals/corr/cs-LO-0111010,
  added-at = {2011-12-05T00:00:00.000+0100},
  author = {Ianni, Giovambattista and Leone, Nicola and Perri, Simona and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/2a3385b2693f5e79f84993f9be5a4585d/dblp},
  ee = {http://arxiv.org/abs/cs.LO/0111010},
  interhash = {0cd28b94488fd6ce3d0f822dddcf9e2d},
  intrahash = {a3385b2693f5e79f84993f9be5a4585d},
  journal = {CoRR},
  keywords = {dblp},
  title = {Abduction with Penalization in Logic Programming},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr0111.html#cs-LO-0111010},
  volume = {cs.LO/0111010},
  year = 2001
}

@article{journals/corr/abs-0810-3136,
  added-at = {2011-12-05T00:00:00.000+0100},
  author = {Malizia, Enrico and Palopoli, Luigi and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/2782fa21e32045b1eafc2f21539a5fed4/dblp},
  ee = {http://arxiv.org/abs/0810.3136},
  interhash = {eeb3057de35bde9c2653e5e3eda64569},
  intrahash = {782fa21e32045b1eafc2f21539a5fed4},
  journal = {CoRR},
  keywords = {dblp},
  title = {On the Computational Complexity of the Bargaining Set and the Kernel in Compact Coalitional Games},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr0810.html#abs-0810-3136},
  volume = {abs/0810.3136},
  year = 2008
}

@article{journals/corr/cs-AI-0310047,
  added-at = {2011-12-05T00:00:00.000+0100},
  author = {Perri, Simona and Scarcello, Francesco and Leone, Nicola},
  biburl = {http://www.bibsonomy.org/bibtex/284e79244a1fa5ac8b5017ad6b9f5c6a7/dblp},
  ee = {http://arxiv.org/abs/cs.AI/0310047},
  interhash = {d35dc7aa35736bf65ae6281ca7216275},
  intrahash = {84e79244a1fa5ac8b5017ad6b9f5c6a7},
  journal = {CoRR},
  keywords = {dblp},
  title = {Abductive Logic Programs with Penalization: Semantics, Complexity and Implementation},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr0310.html#cs-AI-0310047},
  volume = {cs.AI/0310047},
  year = 2003
}

@article{journals/corr/abs-1005-1567,
  added-at = {2011-12-05T00:00:00.000+0100},
  author = {Greco, Gianluigi and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/28c0e9b62fcf453032640f9d19f50a552/dblp},
  ee = {http://arxiv.org/abs/1005.1567},
  interhash = {ae0ec9d830099f555aac77957715c071},
  intrahash = {8c0e9b62fcf453032640f9d19f50a552},
  journal = {CoRR},
  keywords = {dblp},
  title = {On The Power of Tree Projections: Structural Tractability of Enumerating CSP Solutions},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr1005.html#abs-1005-1567},
  volume = {abs/1005.1567},
  year = 2010
}

@inproceedings{conf/cikm/GhionnaGS11,
  added-at = {2011-11-11T00:00:00.000+0100},
  author = {Ghionna, Lucantonio and Greco, Gianluigi and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/2c168cd2b251c561a55c1b5d3864aa4cf/dblp},
  booktitle = {CIKM},
  crossref = {conf/cikm/2011},
  editor = {Macdonald, Craig and Ounis, Iadh and Ruthven, Ian},
  ee = {http://doi.acm.org/10.1145/2063576.2064023},
  interhash = {beaa254904a626643707f292696ec1bf},
  intrahash = {c168cd2b251c561a55c1b5d3864aa4cf},
  isbn = {978-1-4503-0717-8},
  keywords = {dblp},
  pages = {2573-2576},
  publisher = {ACM},
  title = {H-DB: a hybrid quantitative-structural sql optimizer.},
  url = {http://dblp.uni-trier.de/db/conf/cikm/cikm2011.html#GhionnaGS11},
  year = 2011
}

@inproceedings{conf/focs/GottlobLS98,
  added-at = {2011-10-19T00:00:00.000+0200},
  author = {Gottlob, Georg and Leone, Nicola and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/2c4cb8e89e3f6cf4327534946ccadd727/dblp},
  booktitle = {FOCS},
  crossref = {conf/focs/1998},
  ee = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743521},
  interhash = {72272b61a87a327edcad7b2fd03d9569},
  intrahash = {c4cb8e89e3f6cf4327534946ccadd727},
  keywords = {dblp},
  pages = {706-715},
  publisher = {IEEE Computer Society},
  title = {The Complexity of Acyclic Conjunctive Queries.},
  url = {http://dblp.uni-trier.de/db/conf/focs/focs98.html#GottlobLS98},
  year = 1998
}

@article{journals/twc/IeraMRS11,
  added-at = {2011-09-14T00:00:00.000+0200},
  author = {Iera, Antonio and Militano, Leonardo and Romeo, Luca Paolo and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/29894508df9231a5fb52b1743d4a60fb9/dblp},
  ee = {http://dx.doi.org/10.1109/TWC.2011.052511.100749},
  interhash = {fc40a41288b22ca47038b823241f3fef},
  intrahash = {9894508df9231a5fb52b1743d4a60fb9},
  journal = {IEEE Transactions on Wireless Communications},
  keywords = {dblp},
  number = 8,
  pages = {2566-2576},
  title = {Fair Cost Allocation in Cellular-Bluetooth Cooperation Scenarios.},
  url = {http://dblp.uni-trier.de/db/journals/twc/twc10.html#IeraMRS11},
  volume = 10,
  year = 2011
}

@article{journals/aicom/BuccafuriLS96,
  added-at = {2011-09-09T00:00:00.000+0200},
  author = {Buccafurri, Francesco and Leone, Nicola and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/2a598345f2f2e25f4736c7445e28f786b/dblp},
  ee = {http://dx.doi.org/10.3233/AIC-1996-9101},
  interhash = {d02f25a0f77dc9f33f7559341fdd371d},
  intrahash = {a598345f2f2e25f4736c7445e28f786b},
  journal = {AI Commun.},
  keywords = {dblp},
  number = 1,
  pages = {4-13},
  title = {On the Expressive Power of Ordered Logic.},
  url = {http://dblp.uni-trier.de/db/journals/aicom/aicom9.html#BuccafuriLS96},
  volume = 9,
  year = 1996
}

@inproceedings{conf/cp/GrecoS11,
  added-at = {2011-09-02T00:00:00.000+0200},
  author = {Greco, Gianluigi and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/249eee11fdea752ed14feed99d56a329b/dblp},
  booktitle = {CP},
  crossref = {conf/cp/2011},
  editor = {Lee, Jimmy Ho-Man},
  ee = {http://dx.doi.org/10.1007/978-3-642-23786-7_27},
  interhash = {9f1d38d13696f203f1d68fbce01d5515},
  intrahash = {49eee11fdea752ed14feed99d56a329b},
  isbn = {978-3-642-23785-0},
  keywords = {dblp},
  pages = {340-355},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Structural Tractability of Constraint Optimization.},
  url = {http://dblp.uni-trier.de/db/conf/cp/cp2011.html#GrecoS11},
  volume = 6876,
  year = 2011
}

@inproceedings{conf/ijcai/GrecoMPS11,
  added-at = {2011-08-09T00:00:00.000+0200},
  author = {Greco, Gianluigi and Malizia, Enrico and Palopoli, Luigi and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/25ef3b66df1d09ef39cd9aaf61180910b/dblp},
  booktitle = {IJCAI},
  crossref = {conf/ijcai/2011},
  editor = {Walsh, Toby},
  ee = {http://ijcai.org/papers11/Papers/IJCAI11-047.pdf},
  interhash = {4e2aaffab35cdcab2e271e22314d0112},
  intrahash = {5ef3b66df1d09ef39cd9aaf61180910b},
  isbn = {978-1-57735-516-8},
  keywords = {dblp},
  pages = {216-221},
  publisher = {IJCAI/AAAI},
  title = {On the Complexity of the Core over Coalition Structures.},
  url = {http://dblp.uni-trier.de/db/conf/ijcai/ijcai2011.html#GrecoMPS11},
  year = 2011
}

@article{journals/ai/GrecoMPS11,
  added-at = {2011-07-08T00:00:00.000+0200},
  author = {Greco, Gianluigi and Malizia, Enrico and Palopoli, Luigi and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/2105ca561cff84d36e576a94975810910/dblp},
  ee = {http://dx.doi.org/10.1016/j.artint.2011.06.002},
  interhash = {0e4df7b69b827b8d56c0ad6482980b8d},
  intrahash = {105ca561cff84d36e576a94975810910},
  journal = {Artif. Intell.},
  keywords = {dblp},
  number = {12-13},
  pages = {1877-1910},
  title = {On the complexity of core, kernel, and bargaining set.},
  url = {http://dblp.uni-trier.de/db/journals/ai/ai175.html#GrecoMPS11},
  volume = 175,
  year = 2011
}

@article{journals/iandc/LeoneRS97,
  added-at = {2011-07-06T00:00:00.000+0200},
  author = {Leone, Nicola and Rullo, Pasquale and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/224f0a05f91dce299787f409584faed9e/dblp},
  ee = {http://dx.doi.org/10.1006/inco.1997.2630},
  interhash = {d03b06a51d017c7ab447a1d848284cb4},
  intrahash = {24f0a05f91dce299787f409584faed9e},
  journal = {Inf. Comput.},
  keywords = {dblp},
  number = 2,
  pages = {69-112},
  title = {Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation.},
  url = {http://dblp.uni-trier.de/db/journals/iandc/iandc135.html#LeoneRS97},
  volume = 135,
  year = 1997
}

@inproceedings{conf/lpnmr/LeonePS01,
  added-at = {2011-06-28T00:00:00.000+0200},
  author = {Leone, Nicola and Perri, Simona and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/26cba6f66beca6055c563248e9d67d935/dblp},
  booktitle = {LPNMR},
  crossref = {conf/lpnmr/2001},
  editor = {Eiter, Thomas and Faber, Wolfgang and Truszczynski, Miroslaw},
  ee = {http://dx.doi.org/10.1007/3-540-45402-0_21},
  interhash = {f286bdc05c80a4f1e5b0d8494d66e2d9},
  intrahash = {6cba6f66beca6055c563248e9d67d935},
  isbn = {3-540-42593-4},
  keywords = {dblp},
  pages = {280-294},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Improving ASP Instantiators by Join-Ordering Methods.},
  url = {http://dblp.uni-trier.de/db/conf/lpnmr/lpnmr2001.html#LeonePS01},
  volume = 2173,
  year = 2001
}

@inproceedings{conf/lpar/FranconiPLPS01,
  added-at = {2011-06-28T00:00:00.000+0200},
  author = {Franconi, Enrico and Palma, Antonio Laureti and Leone, Nicola and Perri, Simona and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/2f4775ad0dbc2548eed8d35b1f6a3fc07/dblp},
  booktitle = {LPAR},
  crossref = {conf/lpar/2001},
  editor = {Nieuwenhuis, Robert and Voronkov, Andrei},
  ee = {http://dx.doi.org/10.1007/3-540-45653-8_39},
  interhash = {0424b9d8e107191e550f96d8fc3c2198},
  intrahash = {f4775ad0dbc2548eed8d35b1f6a3fc07},
  isbn = {3-540-42957-3},
  keywords = {dblp},
  pages = {561-578},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Census Data Repair: a Challenging Application of Disjunctive Logic Programming.},
  url = {http://dblp.uni-trier.de/db/conf/lpar/lpar2001.html#FranconiPLPS01},
  volume = 2250,
  year = 2001
}

@inproceedings{conf/aiia/LeonePS01,
  added-at = {2011-06-28T00:00:00.000+0200},
  author = {Leone, Nicola and Perri, Simona and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/267fea1cfdeaf7f63aad092d791fe9416/dblp},
  booktitle = {AI*IA},
  crossref = {conf/aiia/2001},
  editor = {Esposito, Floriana},
  ee = {http://dx.doi.org/10.1007/3-540-45411-X_14},
  interhash = {9c1645b854292d6ea2bda7a25f01ebe9},
  intrahash = {67fea1cfdeaf7f63aad092d791fe9416},
  isbn = {3-540-42601-9},
  keywords = {dblp},
  pages = {123-134},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Abduction with Penalization in Logic Programming.},
  url = {http://dblp.uni-trier.de/db/conf/aiia/aiia2001.html#LeonePS01},
  volume = 2175,
  year = 2001
}

@inproceedings{conf/mfcs/GottlobLS01,
  added-at = {2011-06-28T00:00:00.000+0200},
  author = {Gottlob, Georg and Leone, Nicola and Scarcello, Francesco},
  biburl = {http://www.bibsonomy.org/bibtex/252d3efcf7c0f7158e3dcce825f771572/dblp},
  booktitle = {MFCS},
  crossref = {conf/mfcs/2001},
  editor = {Sgall, Jiri and Pultr, Ales and Kolman, Petr},
  ee = {http://dx.doi.org/10.1007/3-540-44683-4_5},
  interhash = {0d33e1bafd4fb6cd6814a7b36f23c0d3},
  intrahash = {52d3efcf7c0f7158e3dcce825f771572},
  isbn = {3-540-42496-2},
  keywords = {dblp},
  pages = {37-57},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Hypertree Decompositions: A Survey.},
  url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs2001.html#GottlobLS01},
  volume = 2136,
  year = 2001
}