<?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>BibSonomypublrss/author/Scarcello</link><description>BibSonomy RSS feed for /author/Scarcello</description><dc:date>2012-02-16T06:23:14+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></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></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></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></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></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></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></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></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></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></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></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></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></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></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></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></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></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></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></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></item></rdf:RDF>
