<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:burst="http://xmlns.com/burst/0.1/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns="http://purl.org/rss/1.0/" xmlns:admin="http://webns.net/mvcb/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:cc="http://web.resource.org/cc/"><channel rdf:about="http://www.bibsonomy.org/author/Scarcello"><title>BibSonomy publications for /author/Scarcello</title><link>BibSonomyburst/author/Scarcello</link><description>BibSonomy RSS feed for /author/Scarcello</description><dc:date>2012-02-16T01:03:03+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2b09e9bc3d7cfd3425dde3445507156d5/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/21faddf7bdb550608a0cad8c331a8d366/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/28dcd196112fce63544f45855033826bb/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2d563d5d4b245dbf419e4f6a3b65bf09c/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a3385b2693f5e79f84993f9be5a4585d/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2782fa21e32045b1eafc2f21539a5fed4/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/284e79244a1fa5ac8b5017ad6b9f5c6a7/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/28c0e9b62fcf453032640f9d19f50a552/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2c168cd2b251c561a55c1b5d3864aa4cf/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2c4cb8e89e3f6cf4327534946ccadd727/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/29894508df9231a5fb52b1743d4a60fb9/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a598345f2f2e25f4736c7445e28f786b/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/249eee11fdea752ed14feed99d56a329b/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25ef3b66df1d09ef39cd9aaf61180910b/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2105ca561cff84d36e576a94975810910/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/224f0a05f91dce299787f409584faed9e/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/26cba6f66beca6055c563248e9d67d935/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f4775ad0dbc2548eed8d35b1f6a3fc07/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/267fea1cfdeaf7f63aad092d791fe9416/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/252d3efcf7c0f7158e3dcce825f771572/dblp"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/2b09e9bc3d7cfd3425dde3445507156d5/dblp"><title>Hypertree Decompositions for Query Optimization.</title><link>http://www.bibsonomy.org/bibtex/2b09e9bc3d7cfd3425dde3445507156d5/dblp</link><dc:creator>dblp</dc:creator><dc:date>2012-01-23T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Ghionna&#034;&gt;Lucantonio Ghionna&lt;/a&gt;, &lt;a href=&#034;/author/Granata&#034;&gt;Luigi Granata&lt;/a&gt;, &lt;a href=&#034;/author/Greco&#034;&gt;Gianluigi Greco&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;ICDE, &lt;/em&gt;&lt;em&gt;page 36-45. &lt;/em&gt;&lt;em&gt;IEEE, &lt;/em&gt;(&lt;em&gt;2007&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2b09e9bc3d7cfd3425dde3445507156d5/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2b09e9bc3d7cfd3425dde3445507156d5/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/icde/icde2007.html#GhionnaGGS07"/><swrc:date>Mon Jan 23 00:00:00 CET 2012</swrc:date><swrc:booktitle>ICDE</swrc:booktitle><swrc:crossref>conf/icde/2007</swrc:crossref><swrc:pages>36-45</swrc:pages><swrc:publisher><swrc:Organization swrc:name="IEEE"/></swrc:publisher><swrc:title>Hypertree Decompositions for Query Optimization.</swrc:title><swrc:year>2007</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://doi.ieeecomputersociety.org/10.1109/ICDE.2007.367849" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Lucantonio Ghionna"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Luigi Granata"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Gianluigi Greco"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_4></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Rada Chirkova"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Asuman Dogac"/></rdf:_2><rdf:_3><swrc:Person swrc:name="M. Tamer Özsu"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Timos K. Sellis"/></rdf:_4></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/21faddf7bdb550608a0cad8c331a8d366/dblp"><title>Hypertree Decompositions and Tractable Queries</title><link>http://www.bibsonomy.org/bibtex/21faddf7bdb550608a0cad8c331a8d366/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Gottlob&#034;&gt;Georg Gottlob&lt;/a&gt;, &lt;a href=&#034;/author/Leone&#034;&gt;Nicola Leone&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;1998&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/21faddf7bdb550608a0cad8c331a8d366/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/21faddf7bdb550608a0cad8c331a8d366/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr9812.html#cs-DB-9812022"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Hypertree Decompositions and Tractable Queries</swrc:title><swrc:volume>cs.DB/9812022</swrc:volume><swrc:year>1998</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/cs.DB/9812022" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Georg Gottlob"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Nicola Leone"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/28dcd196112fce63544f45855033826bb/dblp"><title>The DLV System for Knowledge Representation and Reasoning</title><link>http://www.bibsonomy.org/bibtex/28dcd196112fce63544f45855033826bb/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Leone&#034;&gt;Nicola Leone&lt;/a&gt;, &lt;a href=&#034;/author/Pfeifer&#034;&gt;Gerald Pfeifer&lt;/a&gt;, &lt;a href=&#034;/author/Faber&#034;&gt;Wolfgang Faber&lt;/a&gt;, &lt;a href=&#034;/author/Eiter&#034;&gt;Thomas Eiter&lt;/a&gt;, &lt;a href=&#034;/author/Gottlob&#034;&gt;Georg Gottlob&lt;/a&gt;, &lt;a href=&#034;/author/Perri&#034;&gt;Simona Perri&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2002&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/28dcd196112fce63544f45855033826bb/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/28dcd196112fce63544f45855033826bb/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr0211.html#cs-AI-0211004"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>The DLV System for Knowledge Representation and Reasoning</swrc:title><swrc:volume>cs.AI/0211004</swrc:volume><swrc:year>2002</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/cs.AI/0211004" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Nicola Leone"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Gerald Pfeifer"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Wolfgang Faber"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Thomas Eiter"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Georg Gottlob"/></rdf:_5><rdf:_6><swrc:Person swrc:name="Simona Perri"/></rdf:_6><rdf:_7><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_7></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2d563d5d4b245dbf419e4f6a3b65bf09c/dblp"><title>Pure Nash Equilibria: Hard and Easy Games</title><link>http://www.bibsonomy.org/bibtex/2d563d5d4b245dbf419e4f6a3b65bf09c/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Gottlob&#034;&gt;Georg Gottlob&lt;/a&gt;, &lt;a href=&#034;/author/Greco&#034;&gt;Gianluigi Greco&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2d563d5d4b245dbf419e4f6a3b65bf09c/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2d563d5d4b245dbf419e4f6a3b65bf09c/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr1109.html#abs-1109-2152"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Pure Nash Equilibria: Hard and Easy Games</swrc:title><swrc:volume>abs/1109.2152</swrc:volume><swrc:year>2011</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/1109.2152" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Georg Gottlob"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Gianluigi Greco"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2a3385b2693f5e79f84993f9be5a4585d/dblp"><title>Abduction with Penalization in Logic Programming</title><link>http://www.bibsonomy.org/bibtex/2a3385b2693f5e79f84993f9be5a4585d/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Ianni&#034;&gt;Giovambattista Ianni&lt;/a&gt;, &lt;a href=&#034;/author/Leone&#034;&gt;Nicola Leone&lt;/a&gt;, &lt;a href=&#034;/author/Perri&#034;&gt;Simona Perri&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2001&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2a3385b2693f5e79f84993f9be5a4585d/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2a3385b2693f5e79f84993f9be5a4585d/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr0111.html#cs-LO-0111010"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Abduction with Penalization in Logic Programming</swrc:title><swrc:volume>cs.LO/0111010</swrc:volume><swrc:year>2001</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/cs.LO/0111010" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Giovambattista Ianni"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Nicola Leone"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Simona Perri"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2782fa21e32045b1eafc2f21539a5fed4/dblp"><title>On the Computational Complexity of the Bargaining Set and the Kernel in Compact Coalitional Games</title><link>http://www.bibsonomy.org/bibtex/2782fa21e32045b1eafc2f21539a5fed4/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Malizia&#034;&gt;Enrico Malizia&lt;/a&gt;, &lt;a href=&#034;/author/Palopoli&#034;&gt;Luigi Palopoli&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2008&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2782fa21e32045b1eafc2f21539a5fed4/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2782fa21e32045b1eafc2f21539a5fed4/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr0810.html#abs-0810-3136"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>On the Computational Complexity of the Bargaining Set and the Kernel in Compact Coalitional Games</swrc:title><swrc:volume>abs/0810.3136</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/0810.3136" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Enrico Malizia"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Luigi Palopoli"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/284e79244a1fa5ac8b5017ad6b9f5c6a7/dblp"><title>Abductive Logic Programs with Penalization: Semantics, Complexity and Implementation</title><link>http://www.bibsonomy.org/bibtex/284e79244a1fa5ac8b5017ad6b9f5c6a7/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Perri&#034;&gt;Simona Perri&lt;/a&gt;, &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt;,  and &lt;a href=&#034;/author/Leone&#034;&gt;Nicola Leone&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2003&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/284e79244a1fa5ac8b5017ad6b9f5c6a7/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/284e79244a1fa5ac8b5017ad6b9f5c6a7/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr0310.html#cs-AI-0310047"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Abductive Logic Programs with Penalization: Semantics, Complexity and Implementation</swrc:title><swrc:volume>cs.AI/0310047</swrc:volume><swrc:year>2003</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/cs.AI/0310047" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Simona Perri"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Nicola Leone"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/28c0e9b62fcf453032640f9d19f50a552/dblp"><title>On The Power of Tree Projections: Structural Tractability of Enumerating CSP Solutions</title><link>http://www.bibsonomy.org/bibtex/28c0e9b62fcf453032640f9d19f50a552/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Greco&#034;&gt;Gianluigi Greco&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2010&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/28c0e9b62fcf453032640f9d19f50a552/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/28c0e9b62fcf453032640f9d19f50a552/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr1005.html#abs-1005-1567"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>On The Power of Tree Projections: Structural Tractability of Enumerating CSP Solutions</swrc:title><swrc:volume>abs/1005.1567</swrc:volume><swrc:year>2010</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/1005.1567" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Gianluigi Greco"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2c168cd2b251c561a55c1b5d3864aa4cf/dblp"><title>H-DB: a hybrid quantitative-structural sql optimizer.</title><link>http://www.bibsonomy.org/bibtex/2c168cd2b251c561a55c1b5d3864aa4cf/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-11T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Ghionna&#034;&gt;Lucantonio Ghionna&lt;/a&gt;, &lt;a href=&#034;/author/Greco&#034;&gt;Gianluigi Greco&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CIKM, &lt;/em&gt;&lt;em&gt;page 2573-2576. &lt;/em&gt;&lt;em&gt;ACM, &lt;/em&gt;(&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2c168cd2b251c561a55c1b5d3864aa4cf/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2c168cd2b251c561a55c1b5d3864aa4cf/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/cikm/cikm2011.html#GhionnaGS11"/><swrc:date>Fri Nov 11 00:00:00 CET 2011</swrc:date><swrc:booktitle>CIKM</swrc:booktitle><swrc:crossref>conf/cikm/2011</swrc:crossref><swrc:pages>2573-2576</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:title>H-DB: a hybrid quantitative-structural sql optimizer.</swrc:title><swrc:year>2011</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://doi.acm.org/10.1145/2063576.2064023" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="978-1-4503-0717-8" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Lucantonio Ghionna"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Gianluigi Greco"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_3></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Craig Macdonald"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Iadh Ounis"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Ian Ruthven"/></rdf:_3></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2c4cb8e89e3f6cf4327534946ccadd727/dblp"><title>The Complexity of Acyclic Conjunctive Queries.</title><link>http://www.bibsonomy.org/bibtex/2c4cb8e89e3f6cf4327534946ccadd727/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-10-19T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Gottlob&#034;&gt;Georg Gottlob&lt;/a&gt;, &lt;a href=&#034;/author/Leone&#034;&gt;Nicola Leone&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;FOCS, &lt;/em&gt;&lt;em&gt;page 706-715. &lt;/em&gt;&lt;em&gt;IEEE Computer Society, &lt;/em&gt;(&lt;em&gt;1998&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2c4cb8e89e3f6cf4327534946ccadd727/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2c4cb8e89e3f6cf4327534946ccadd727/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/focs/focs98.html#GottlobLS98"/><swrc:date>Wed Oct 19 00:00:00 CEST 2011</swrc:date><swrc:booktitle>FOCS</swrc:booktitle><swrc:crossref>conf/focs/1998</swrc:crossref><swrc:pages>706-715</swrc:pages><swrc:publisher><swrc:Organization swrc:name="IEEE Computer Society"/></swrc:publisher><swrc:title>The Complexity of Acyclic Conjunctive Queries.</swrc:title><swrc:year>1998</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743521" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Georg Gottlob"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Nicola Leone"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/29894508df9231a5fb52b1743d4a60fb9/dblp"><title>Fair Cost Allocation in Cellular-Bluetooth Cooperation Scenarios.</title><link>http://www.bibsonomy.org/bibtex/29894508df9231a5fb52b1743d4a60fb9/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-09-14T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Iera&#034;&gt;Antonio Iera&lt;/a&gt;, &lt;a href=&#034;/author/Militano&#034;&gt;Leonardo Militano&lt;/a&gt;, &lt;a href=&#034;/author/Romeo&#034;&gt;Luca Paolo Romeo&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;IEEE Transactions on Wireless Communications&lt;/em&gt; &lt;em&gt;10(8):2566-2576&lt;/em&gt; (&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/29894508df9231a5fb52b1743d4a60fb9/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/29894508df9231a5fb52b1743d4a60fb9/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/twc/twc10.html#IeraMRS11"/><swrc:date>Wed Sep 14 00:00:00 CEST 2011</swrc:date><swrc:journal>IEEE Transactions on Wireless Communications</swrc:journal><swrc:number>8</swrc:number><swrc:pages>2566-2576</swrc:pages><swrc:title>Fair Cost Allocation in Cellular-Bluetooth Cooperation Scenarios.</swrc:title><swrc:volume>10</swrc:volume><swrc:year>2011</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1109/TWC.2011.052511.100749" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Antonio Iera"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Leonardo Militano"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Luca Paolo Romeo"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2a598345f2f2e25f4736c7445e28f786b/dblp"><title>On the Expressive Power of Ordered Logic.</title><link>http://www.bibsonomy.org/bibtex/2a598345f2f2e25f4736c7445e28f786b/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-09-09T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Buccafurri&#034;&gt;Francesco Buccafurri&lt;/a&gt;, &lt;a href=&#034;/author/Leone&#034;&gt;Nicola Leone&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;AI Commun.&lt;/em&gt; &lt;em&gt;9(1):4-13&lt;/em&gt; (&lt;em&gt;1996&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2a598345f2f2e25f4736c7445e28f786b/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2a598345f2f2e25f4736c7445e28f786b/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/aicom/aicom9.html#BuccafuriLS96"/><swrc:date>Fri Sep 09 00:00:00 CEST 2011</swrc:date><swrc:journal>AI Commun.</swrc:journal><swrc:number>1</swrc:number><swrc:pages>4-13</swrc:pages><swrc:title>On the Expressive Power of Ordered Logic.</swrc:title><swrc:volume>9</swrc:volume><swrc:year>1996</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.3233/AIC-1996-9101" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Francesco Buccafurri"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Nicola Leone"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/249eee11fdea752ed14feed99d56a329b/dblp"><title>Structural Tractability of Constraint Optimization.</title><link>http://www.bibsonomy.org/bibtex/249eee11fdea752ed14feed99d56a329b/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-09-02T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Greco&#034;&gt;Gianluigi Greco&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CP, &lt;/em&gt;&lt;em&gt;volume 6876 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 340-355. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/249eee11fdea752ed14feed99d56a329b/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/249eee11fdea752ed14feed99d56a329b/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/cp/cp2011.html#GrecoS11"/><swrc:date>Fri Sep 02 00:00:00 CEST 2011</swrc:date><swrc:booktitle>CP</swrc:booktitle><swrc:crossref>conf/cp/2011</swrc:crossref><swrc:pages>340-355</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Structural Tractability of Constraint Optimization.</swrc:title><swrc:volume>6876</swrc:volume><swrc:year>2011</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/978-3-642-23786-7_27" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="978-3-642-23785-0" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Gianluigi Greco"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Jimmy Ho-Man Lee"/></rdf:_1></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/25ef3b66df1d09ef39cd9aaf61180910b/dblp"><title>On the Complexity of the Core over Coalition Structures.</title><link>http://www.bibsonomy.org/bibtex/25ef3b66df1d09ef39cd9aaf61180910b/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-08-09T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Greco&#034;&gt;Gianluigi Greco&lt;/a&gt;, &lt;a href=&#034;/author/Malizia&#034;&gt;Enrico Malizia&lt;/a&gt;, &lt;a href=&#034;/author/Palopoli&#034;&gt;Luigi Palopoli&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;IJCAI, &lt;/em&gt;&lt;em&gt;page 216-221. &lt;/em&gt;&lt;em&gt;IJCAI/AAAI, &lt;/em&gt;(&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/25ef3b66df1d09ef39cd9aaf61180910b/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/25ef3b66df1d09ef39cd9aaf61180910b/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/ijcai/ijcai2011.html#GrecoMPS11"/><swrc:date>Tue Aug 09 00:00:00 CEST 2011</swrc:date><swrc:booktitle>IJCAI</swrc:booktitle><swrc:crossref>conf/ijcai/2011</swrc:crossref><swrc:pages>216-221</swrc:pages><swrc:publisher><swrc:Organization swrc:name="IJCAI/AAAI"/></swrc:publisher><swrc:title>On the Complexity of the Core over Coalition Structures.</swrc:title><swrc:year>2011</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://ijcai.org/papers11/Papers/IJCAI11-047.pdf" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="978-1-57735-516-8" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Gianluigi Greco"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Enrico Malizia"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Luigi Palopoli"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_4></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Toby Walsh"/></rdf:_1></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2105ca561cff84d36e576a94975810910/dblp"><title>On the complexity of core, kernel, and bargaining set.</title><link>http://www.bibsonomy.org/bibtex/2105ca561cff84d36e576a94975810910/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-07-08T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Greco&#034;&gt;Gianluigi Greco&lt;/a&gt;, &lt;a href=&#034;/author/Malizia&#034;&gt;Enrico Malizia&lt;/a&gt;, &lt;a href=&#034;/author/Palopoli&#034;&gt;Luigi Palopoli&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Artif. Intell.&lt;/em&gt; &lt;em&gt;175(12-13):1877-1910&lt;/em&gt; (&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2105ca561cff84d36e576a94975810910/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2105ca561cff84d36e576a94975810910/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/ai/ai175.html#GrecoMPS11"/><swrc:date>Fri Jul 08 00:00:00 CEST 2011</swrc:date><swrc:journal>Artif. Intell.</swrc:journal><swrc:number>12-13</swrc:number><swrc:pages>1877-1910</swrc:pages><swrc:title>On the complexity of core, kernel, and bargaining set.</swrc:title><swrc:volume>175</swrc:volume><swrc:year>2011</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1016/j.artint.2011.06.002" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Gianluigi Greco"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Enrico Malizia"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Luigi Palopoli"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/224f0a05f91dce299787f409584faed9e/dblp"><title>Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation.</title><link>http://www.bibsonomy.org/bibtex/224f0a05f91dce299787f409584faed9e/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-07-06T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Leone&#034;&gt;Nicola Leone&lt;/a&gt;, &lt;a href=&#034;/author/Rullo&#034;&gt;Pasquale Rullo&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Inf. Comput.&lt;/em&gt; &lt;em&gt;135(2):69-112&lt;/em&gt; (&lt;em&gt;1997&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/224f0a05f91dce299787f409584faed9e/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/224f0a05f91dce299787f409584faed9e/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/iandc/iandc135.html#LeoneRS97"/><swrc:date>Wed Jul 06 00:00:00 CEST 2011</swrc:date><swrc:journal>Inf. Comput.</swrc:journal><swrc:number>2</swrc:number><swrc:pages>69-112</swrc:pages><swrc:title>Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation.</swrc:title><swrc:volume>135</swrc:volume><swrc:year>1997</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1006/inco.1997.2630" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Nicola Leone"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Pasquale Rullo"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/26cba6f66beca6055c563248e9d67d935/dblp"><title>Improving ASP Instantiators by Join-Ordering Methods.</title><link>http://www.bibsonomy.org/bibtex/26cba6f66beca6055c563248e9d67d935/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-06-28T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Leone&#034;&gt;Nicola Leone&lt;/a&gt;, &lt;a href=&#034;/author/Perri&#034;&gt;Simona Perri&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;LPNMR, &lt;/em&gt;&lt;em&gt;volume 2173 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 280-294. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2001&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/26cba6f66beca6055c563248e9d67d935/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/26cba6f66beca6055c563248e9d67d935/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/lpnmr/lpnmr2001.html#LeonePS01"/><swrc:date>Tue Jun 28 00:00:00 CEST 2011</swrc:date><swrc:booktitle>LPNMR</swrc:booktitle><swrc:crossref>conf/lpnmr/2001</swrc:crossref><swrc:pages>280-294</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Improving ASP Instantiators by Join-Ordering Methods.</swrc:title><swrc:volume>2173</swrc:volume><swrc:year>2001</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/3-540-45402-0_21" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3-540-42593-4" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Nicola Leone"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Simona Perri"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_3></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Thomas Eiter"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Wolfgang Faber"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Miroslaw Truszczynski"/></rdf:_3></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2f4775ad0dbc2548eed8d35b1f6a3fc07/dblp"><title>Census Data Repair: a Challenging Application of Disjunctive Logic Programming.</title><link>http://www.bibsonomy.org/bibtex/2f4775ad0dbc2548eed8d35b1f6a3fc07/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-06-28T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Franconi&#034;&gt;Enrico Franconi&lt;/a&gt;, &lt;a href=&#034;/author/Palma&#034;&gt;Antonio Laureti Palma&lt;/a&gt;, &lt;a href=&#034;/author/Leone&#034;&gt;Nicola Leone&lt;/a&gt;, &lt;a href=&#034;/author/Perri&#034;&gt;Simona Perri&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;LPAR, &lt;/em&gt;&lt;em&gt;volume 2250 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 561-578. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2001&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2f4775ad0dbc2548eed8d35b1f6a3fc07/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2f4775ad0dbc2548eed8d35b1f6a3fc07/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/lpar/lpar2001.html#FranconiPLPS01"/><swrc:date>Tue Jun 28 00:00:00 CEST 2011</swrc:date><swrc:booktitle>LPAR</swrc:booktitle><swrc:crossref>conf/lpar/2001</swrc:crossref><swrc:pages>561-578</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Census Data Repair: a Challenging Application of Disjunctive Logic Programming.</swrc:title><swrc:volume>2250</swrc:volume><swrc:year>2001</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/3-540-45653-8_39" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3-540-42957-3" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Enrico Franconi"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Antonio Laureti Palma"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Nicola Leone"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Simona Perri"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_5></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Robert Nieuwenhuis"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Andrei Voronkov"/></rdf:_2></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/267fea1cfdeaf7f63aad092d791fe9416/dblp"><title>Abduction with Penalization in Logic Programming.</title><link>http://www.bibsonomy.org/bibtex/267fea1cfdeaf7f63aad092d791fe9416/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-06-28T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Leone&#034;&gt;Nicola Leone&lt;/a&gt;, &lt;a href=&#034;/author/Perri&#034;&gt;Simona Perri&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;AI*IA, &lt;/em&gt;&lt;em&gt;volume 2175 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 123-134. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2001&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/267fea1cfdeaf7f63aad092d791fe9416/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/267fea1cfdeaf7f63aad092d791fe9416/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/aiia/aiia2001.html#LeonePS01"/><swrc:date>Tue Jun 28 00:00:00 CEST 2011</swrc:date><swrc:booktitle>AI*IA</swrc:booktitle><swrc:crossref>conf/aiia/2001</swrc:crossref><swrc:pages>123-134</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Abduction with Penalization in Logic Programming.</swrc:title><swrc:volume>2175</swrc:volume><swrc:year>2001</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/3-540-45411-X_14" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3-540-42601-9" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Nicola Leone"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Simona Perri"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_3></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Floriana Esposito"/></rdf:_1></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/252d3efcf7c0f7158e3dcce825f771572/dblp"><title>Hypertree Decompositions: A Survey.</title><link>http://www.bibsonomy.org/bibtex/252d3efcf7c0f7158e3dcce825f771572/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-06-28T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Gottlob&#034;&gt;Georg Gottlob&lt;/a&gt;, &lt;a href=&#034;/author/Leone&#034;&gt;Nicola Leone&lt;/a&gt;,  and &lt;a href=&#034;/author/Scarcello&#034;&gt;Francesco Scarcello&lt;/a&gt; &lt;/span&gt;&lt;em&gt;MFCS, &lt;/em&gt;&lt;em&gt;volume 2136 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 37-57. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2001&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/252d3efcf7c0f7158e3dcce825f771572/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/252d3efcf7c0f7158e3dcce825f771572/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/mfcs/mfcs2001.html#GottlobLS01"/><swrc:date>Tue Jun 28 00:00:00 CEST 2011</swrc:date><swrc:booktitle>MFCS</swrc:booktitle><swrc:crossref>conf/mfcs/2001</swrc:crossref><swrc:pages>37-57</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Hypertree Decompositions: A Survey.</swrc:title><swrc:volume>2136</swrc:volume><swrc:year>2001</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/3-540-44683-4_5" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3-540-42496-2" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Georg Gottlob"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Nicola Leone"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_3></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Jiri Sgall"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Ales Pultr"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Petr Kolman"/></rdf:_3></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item></rdf:RDF>
