<?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/Nienhuys-Cheng"><title>BibSonomy publications for /author/Nienhuys-Cheng</title><link>BibSonomyburst/author/Nienhuys-Cheng</link><description>BibSonomy RSS feed for /author/Nienhuys-Cheng</description><dc:date>2012-02-16T12:15:05+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/250459827e089d79042897bcee74242eb/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2cf04558a12fe326f7755f680b74ed8d6/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2d0967518efd6fa3a88c58911f8de3b12/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/271eb828d51b2f7e35dc8d5d88b9bb832/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2610576b6822843756c52c92feb6b6b39/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2cd06864c98d1aecf40759cde2ca1bd07/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/29c147f1fd960b94c220dd996ced1e34b/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/271593608fd761cf339ab05a8ec672504/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2edd03560d2c76099cdaba2e738edfa67/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/21a87cc28015c194619a2f858e9b7918a/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25686fcf08fa41f5a1e5a268954cd5b51/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2ca00e6638064d504d2b77a14d7bea023/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/26d5dcbaf736848b28d092292013d6556/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a84ed15e47ce7613657a6133140bbca9/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2c4966b4ee45f8dcde38bc4bcd5f2d180/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23971995881ef9cc7322d202287533408/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/222a114772cd1b05ef1a7184c01ae093f/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2ca00e6638064d504d2b77a14d7bea023/sebastian"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/274c80f82f07ab20d0470db24bcc64810/sebastian"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/274c80f82f07ab20d0470db24bcc64810/jens"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/250459827e089d79042897bcee74242eb/dblp"><title>Least Generalizations and Greatest Specializations of Sets of Clauses</title><link>http://www.bibsonomy.org/bibtex/250459827e089d79042897bcee74242eb/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/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt;,  and &lt;a href=&#034;/author/de Wolf&#034;&gt;Ronald de Wolf&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&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/250459827e089d79042897bcee74242eb/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/250459827e089d79042897bcee74242eb/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr9605.html#cs-AI-9605102"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Least Generalizations and Greatest Specializations of Sets of Clauses</swrc:title><swrc:volume>cs.AI/9605102</swrc:volume><swrc:year>1996</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/cs.AI/9605102" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Ronald de Wolf"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2cf04558a12fe326f7755f680b74ed8d6/dblp"><title>Completeness and Properness of Refinement Operators in Inductive Logic Programming.</title><link>http://www.bibsonomy.org/bibtex/2cf04558a12fe326f7755f680b74ed8d6/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-01T00: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/van der Laag&#034;&gt;Patrick R. J. van der Laag&lt;/a&gt;,  and &lt;a href=&#034;/author/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt; &lt;/span&gt;&lt;em&gt;J. Log. Program.&lt;/em&gt; &lt;em&gt;34(3):201-225&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/2cf04558a12fe326f7755f680b74ed8d6/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2cf04558a12fe326f7755f680b74ed8d6/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/jlp/jlp34.html#LaagN98"/><swrc:date>Thu Dec 01 00:00:00 CET 2011</swrc:date><swrc:journal>J. Log. Program.</swrc:journal><swrc:number>3</swrc:number><swrc:pages>201-225</swrc:pages><swrc:title>Completeness and Properness of Refinement Operators in Inductive Logic Programming.</swrc:title><swrc:volume>34</swrc:volume><swrc:year>1998</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1016/S0743-1066(97)00077-0" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Patrick R. J. van der Laag"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2d0967518efd6fa3a88c58911f8de3b12/dblp"><title>Classification and syntax of constraints in binary semantical networks.</title><link>http://www.bibsonomy.org/bibtex/2d0967518efd6fa3a88c58911f8de3b12/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-08-25T00: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/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Inf. Syst.&lt;/em&gt; &lt;em&gt;15(5):497-513&lt;/em&gt; (&lt;em&gt;1990&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/2d0967518efd6fa3a88c58911f8de3b12/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2d0967518efd6fa3a88c58911f8de3b12/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/is/is15.html#Nienhuys-Cheng90"/><swrc:date>Thu Aug 25 00:00:00 CEST 2011</swrc:date><swrc:journal>Inf. Syst.</swrc:journal><swrc:number>5</swrc:number><swrc:pages>497-513</swrc:pages><swrc:title>Classification and syntax of constraints in binary semantical networks.</swrc:title><swrc:volume>15</swrc:volume><swrc:year>1990</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1016/0306-4379(90)90023-I" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/271eb828d51b2f7e35dc8d5d88b9bb832/dblp"><title>Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms.</title><link>http://www.bibsonomy.org/bibtex/271eb828d51b2f7e35dc8d5d88b9bb832/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-06-17T00: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/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt;, &lt;a href=&#034;/author/Laer&#034;&gt;Wim Van Laer&lt;/a&gt;, &lt;a href=&#034;/author/Ramon&#034;&gt;Jan Ramon&lt;/a&gt;,  and &lt;a href=&#034;/author/Raedt&#034;&gt;Luc De Raedt&lt;/a&gt; &lt;/span&gt;&lt;em&gt;ILP, &lt;/em&gt;&lt;em&gt;volume 1634 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 245-256. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;1999&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/271eb828d51b2f7e35dc8d5d88b9bb832/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/271eb828d51b2f7e35dc8d5d88b9bb832/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/ilp/ilp99.html#Nienhuys-ChengLRR99"/><swrc:date>Fri Jun 17 00:00:00 CEST 2011</swrc:date><swrc:booktitle>ILP</swrc:booktitle><swrc:crossref>conf/ilp/1999</swrc:crossref><swrc:pages>245-256</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms.</swrc:title><swrc:volume>1634</swrc:volume><swrc:year>1999</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/3-540-48751-4_23" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3-540-66109-3" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Wim Van Laer"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Jan Ramon"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Luc De Raedt"/></rdf:_4></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Saso Dzeroski"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Peter A. Flach"/></rdf:_2></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2610576b6822843756c52c92feb6b6b39/dblp"><title>Kahn&#039;s Fixed-Point Characterization for Linear Dynamic Networks.</title><link>http://www.bibsonomy.org/bibtex/2610576b6822843756c52c92feb6b6b39/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-06-16T00: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/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt;,  and &lt;a href=&#034;/author/de Bruin&#034;&gt;Arie de Bruin&lt;/a&gt; &lt;/span&gt;&lt;em&gt;SOFSEM, &lt;/em&gt;&lt;em&gt;volume 1338 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 513-522. &lt;/em&gt;&lt;em&gt;Springer, &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/2610576b6822843756c52c92feb6b6b39/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2610576b6822843756c52c92feb6b6b39/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/sofsem/sofsem1997.html#Nienhuys-ChengB97"/><swrc:date>Thu Jun 16 00:00:00 CEST 2011</swrc:date><swrc:booktitle>SOFSEM</swrc:booktitle><swrc:crossref>conf/sofsem/1997</swrc:crossref><swrc:pages>513-522</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Kahn&#039;s Fixed-Point Characterization for Linear Dynamic Networks.</swrc:title><swrc:volume>1338</swrc:volume><swrc:year>1997</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/3-540-63774-5_133" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3-540-63774-5" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Arie de Bruin"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Frantisek Plasil"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Keith G. Jeffery"/></rdf:_2></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2cd06864c98d1aecf40759cde2ca1bd07/dblp"><title>Distance Between Herbrand Interpretations: A Measure for Approximations to a Target Concept.</title><link>http://www.bibsonomy.org/bibtex/2cd06864c98d1aecf40759cde2ca1bd07/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-06-16T00: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/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt; &lt;/span&gt;&lt;em&gt;ILP, &lt;/em&gt;&lt;em&gt;volume 1297 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 213-226. &lt;/em&gt;&lt;em&gt;Springer, &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/2cd06864c98d1aecf40759cde2ca1bd07/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2cd06864c98d1aecf40759cde2ca1bd07/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/ilp/ilp97.html#Nienhuys-Cheng97"/><swrc:date>Thu Jun 16 00:00:00 CEST 2011</swrc:date><swrc:booktitle>ILP</swrc:booktitle><swrc:crossref>conf/ilp/1997</swrc:crossref><swrc:pages>213-226</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Distance Between Herbrand Interpretations: A Measure for Approximations to a Target Concept.</swrc:title><swrc:volume>1297</swrc:volume><swrc:year>1997</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/3540635149_50" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3-540-63514-9" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_1></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Nada Lavrac"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Saso Dzeroski"/></rdf:_2></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/29c147f1fd960b94c220dd996ced1e34b/dblp"><title>Least Generalizations under Implication.</title><link>http://www.bibsonomy.org/bibtex/29c147f1fd960b94c220dd996ced1e34b/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-06-16T00: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/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt;,  and &lt;a href=&#034;/author/de Wolf&#034;&gt;Ronald de Wolf&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Inductive Logic Programming Workshop, &lt;/em&gt;&lt;em&gt;volume 1314 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 285-298. &lt;/em&gt;&lt;em&gt;Springer, &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/29c147f1fd960b94c220dd996ced1e34b/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/29c147f1fd960b94c220dd996ced1e34b/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/ilp/ilp96.html#Nienhuys-ChengW96"/><swrc:date>Thu Jun 16 00:00:00 CEST 2011</swrc:date><swrc:booktitle>Inductive Logic Programming Workshop</swrc:booktitle><swrc:crossref>conf/ilp/1996</swrc:crossref><swrc:pages>285-298</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Least Generalizations under Implication.</swrc:title><swrc:volume>1314</swrc:volume><swrc:year>1996</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/3-540-63494-0_61" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3-540-63494-0" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Ronald de Wolf"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Stephen Muggleton"/></rdf:_1></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/271593608fd761cf339ab05a8ec672504/dblp"><title>Distances and Limits on Herbrand Interpretations.</title><link>http://www.bibsonomy.org/bibtex/271593608fd761cf339ab05a8ec672504/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-06-16T00: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/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt; &lt;/span&gt;&lt;em&gt;ILP, &lt;/em&gt;&lt;em&gt;volume 1446 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 250-260. &lt;/em&gt;&lt;em&gt;Springer, &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/271593608fd761cf339ab05a8ec672504/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/271593608fd761cf339ab05a8ec672504/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/ilp/ilp98.html#Nienhuys-Cheng98"/><swrc:date>Thu Jun 16 00:00:00 CEST 2011</swrc:date><swrc:booktitle>ILP</swrc:booktitle><swrc:crossref>conf/ilp/1998</swrc:crossref><swrc:pages>250-260</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Distances and Limits on Herbrand Interpretations.</swrc:title><swrc:volume>1446</swrc:volume><swrc:year>1998</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/BFb0027329" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3-540-64738-4" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_1></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="David Page"/></rdf:_1></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2edd03560d2c76099cdaba2e738edfa67/dblp"><title>Least Generalizations and Greatest Specializations of Sets of Clauses.</title><link>http://www.bibsonomy.org/bibtex/2edd03560d2c76099cdaba2e738edfa67/dblp</link><dc:creator>dblp</dc:creator><dc:date>2010-07-21T15:45:16+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt;,  and &lt;a href=&#034;/author/de Wolf&#034;&gt;Ronald de Wolf&lt;/a&gt; &lt;/span&gt;&lt;em&gt;J. Artif. Intell. Res. JAIR&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/2edd03560d2c76099cdaba2e738edfa67/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2edd03560d2c76099cdaba2e738edfa67/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/jair/jair4.html#Nienhuys-ChengW96"/><swrc:date>Wed Jul 21 15:45:16 CEST 2010</swrc:date><swrc:journal>J. Artif. Intell. Res. (JAIR)</swrc:journal><swrc:pages>341-363</swrc:pages><swrc:title>Least Generalizations and Greatest Specializations of Sets of Clauses.</swrc:title><swrc:volume>4</swrc:volume><swrc:year>1996</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1613/jair.259" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2010-06-11" swrc:key="date"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Ronald de Wolf"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/21a87cc28015c194619a2f858e9b7918a/dblp"><title>Consistent Term Mappings, Term Partitions and Inverse Resolution.</title><link>http://www.bibsonomy.org/bibtex/21a87cc28015c194619a2f858e9b7918a/dblp</link><dc:creator>dblp</dc:creator><dc:date>2009-10-15T00: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/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt;,  and &lt;a href=&#034;/author/Flach&#034;&gt;Peter A. Flach&lt;/a&gt; &lt;/span&gt;&lt;em&gt;EWSL, &lt;/em&gt;&lt;em&gt;volume 482 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 361-374. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;1991&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/21a87cc28015c194619a2f858e9b7918a/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/21a87cc28015c194619a2f858e9b7918a/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/ecml/ewsl91.html#Nienhuys-ChengF91"/><swrc:date>Thu Oct 15 00:00:00 CEST 2009</swrc:date><swrc:booktitle>EWSL</swrc:booktitle><swrc:crossref>conf/ecml/1991</swrc:crossref><swrc:pages>361-374</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Consistent Term Mappings, Term Partitions and Inverse Resolution.</swrc:title><swrc:volume>482</swrc:volume><swrc:year>1991</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/BFb0017030" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3-540-53816-X" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2009-10-15" swrc:key="date"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Peter A. Flach"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Yves Kodratoff"/></rdf:_1></rdf:Seq></swrc:editor></rdf:Description></burst:publication><description>dblp</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/25686fcf08fa41f5a1e5a268954cd5b51/dblp"><title>Sample PAC-Learnability in Model Inference.</title><link>http://www.bibsonomy.org/bibtex/25686fcf08fa41f5a1e5a268954cd5b51/dblp</link><dc:creator>dblp</dc:creator><dc:date>2009-10-15T00: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/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt;,  and &lt;a href=&#034;/author/Polman&#034;&gt;Mark Polman&lt;/a&gt; &lt;/span&gt;&lt;em&gt;ECML, &lt;/em&gt;&lt;em&gt;volume 784 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 217-230. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;1994&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/25686fcf08fa41f5a1e5a268954cd5b51/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/25686fcf08fa41f5a1e5a268954cd5b51/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/ecml/ecml94.html#Nienhuys-ChengP94"/><swrc:date>Thu Oct 15 00:00:00 CEST 2009</swrc:date><swrc:booktitle>ECML</swrc:booktitle><swrc:crossref>conf/ecml/1994</swrc:crossref><swrc:pages>217-230</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Sample PAC-Learnability in Model Inference.</swrc:title><swrc:volume>784</swrc:volume><swrc:year>1994</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/3-540-57868-4_60" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3-540-57868-4" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2009-10-15" swrc:key="date"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Mark Polman"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Francesco Bergadano"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Luc De Raedt"/></rdf:_2></rdf:Seq></swrc:editor></rdf:Description></burst:publication><description>dblp</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2ca00e6638064d504d2b77a14d7bea023/dblp"><title>Existence and Nonexistence of Complete Refinement Operators.</title><link>http://www.bibsonomy.org/bibtex/2ca00e6638064d504d2b77a14d7bea023/dblp</link><dc:creator>dblp</dc:creator><dc:date>2009-10-15T00: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/van der Laag&#034;&gt;Patrick R. J. van der Laag&lt;/a&gt;,  and &lt;a href=&#034;/author/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt; &lt;/span&gt;&lt;em&gt;ECML, &lt;/em&gt;&lt;em&gt;volume 784 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 307-322. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;1994&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/2ca00e6638064d504d2b77a14d7bea023/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2ca00e6638064d504d2b77a14d7bea023/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/ecml/ecml94.html#LaagN94"/><swrc:date>Thu Oct 15 00:00:00 CEST 2009</swrc:date><swrc:booktitle>ECML</swrc:booktitle><swrc:crossref>conf/ecml/1994</swrc:crossref><swrc:pages>307-322</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Existence and Nonexistence of Complete Refinement Operators.</swrc:title><swrc:volume>784</swrc:volume><swrc:year>1994</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/3-540-57868-4_66" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3-540-57868-4" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2009-10-15" swrc:key="date"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Patrick R. J. van der Laag"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Francesco Bergadano"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Luc De Raedt"/></rdf:_2></rdf:Seq></swrc:editor></rdf:Description></burst:publication><description>dblp</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/26d5dcbaf736848b28d092292013d6556/dblp"><title>Complexity Dimensions and Learnability.</title><link>http://www.bibsonomy.org/bibtex/26d5dcbaf736848b28d092292013d6556/dblp</link><dc:creator>dblp</dc:creator><dc:date>2009-10-15T00: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/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt;,  and &lt;a href=&#034;/author/Polman&#034;&gt;Mark Polman&lt;/a&gt; &lt;/span&gt;&lt;em&gt;ECML, &lt;/em&gt;&lt;em&gt;volume 667 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 348-353. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;1993&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/26d5dcbaf736848b28d092292013d6556/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/26d5dcbaf736848b28d092292013d6556/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/ecml/ecml93.html#Nienhuys-ChengP93"/><swrc:date>Thu Oct 15 00:00:00 CEST 2009</swrc:date><swrc:booktitle>ECML</swrc:booktitle><swrc:crossref>conf/ecml/1993</swrc:crossref><swrc:pages>348-353</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Complexity Dimensions and Learnability.</swrc:title><swrc:volume>667</swrc:volume><swrc:year>1993</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/3-540-56602-3_149" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3-540-56602-3" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2009-10-15" swrc:key="date"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Mark Polman"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Pavel Brazdil"/></rdf:_1></rdf:Seq></swrc:editor></rdf:Description></burst:publication><description>dblp</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2a84ed15e47ce7613657a6133140bbca9/dblp"><title>Subsumption and Refinement in Model Inference.</title><link>http://www.bibsonomy.org/bibtex/2a84ed15e47ce7613657a6133140bbca9/dblp</link><dc:creator>dblp</dc:creator><dc:date>2009-10-15T00: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/van der Laag&#034;&gt;Patrick R. J. van der Laag&lt;/a&gt;,  and &lt;a href=&#034;/author/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt; &lt;/span&gt;&lt;em&gt;ECML, &lt;/em&gt;&lt;em&gt;volume 667 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 95-114. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;1993&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/2a84ed15e47ce7613657a6133140bbca9/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2a84ed15e47ce7613657a6133140bbca9/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/ecml/ecml93.html#LaagN93"/><swrc:date>Thu Oct 15 00:00:00 CEST 2009</swrc:date><swrc:booktitle>ECML</swrc:booktitle><swrc:crossref>conf/ecml/1993</swrc:crossref><swrc:pages>95-114</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Subsumption and Refinement in Model Inference.</swrc:title><swrc:volume>667</swrc:volume><swrc:year>1993</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/3-540-56602-3_130" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3-540-56602-3" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2009-10-15" swrc:key="date"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Patrick R. J. van der Laag"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Pavel Brazdil"/></rdf:_1></rdf:Seq></swrc:editor></rdf:Description></burst:publication><description>dblp</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2c4966b4ee45f8dcde38bc4bcd5f2d180/dblp"><title>Linear Dynamic Kahn Networks Are Deterministic.</title><link>http://www.bibsonomy.org/bibtex/2c4966b4ee45f8dcde38bc4bcd5f2d180/dblp</link><dc:creator>dblp</dc:creator><dc:date>2009-09-21T00: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/de Bruin&#034;&gt;Arie de Bruin&lt;/a&gt;,  and &lt;a href=&#034;/author/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt; &lt;/span&gt;&lt;em&gt;MFCS, &lt;/em&gt;&lt;em&gt;volume 1113 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 242-254. &lt;/em&gt;&lt;em&gt;Springer, &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/2c4966b4ee45f8dcde38bc4bcd5f2d180/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2c4966b4ee45f8dcde38bc4bcd5f2d180/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/mfcs/mfcs96.html#BruinN96"/><swrc:date>Mon Sep 21 00:00:00 CEST 2009</swrc:date><swrc:booktitle>MFCS</swrc:booktitle><swrc:crossref>conf/mfcs/1996</swrc:crossref><swrc:pages>242-254</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Linear Dynamic Kahn Networks Are Deterministic.</swrc:title><swrc:volume>1113</swrc:volume><swrc:year>1996</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1007/3-540-61550-4_152" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3-540-61550-4" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2009-09-21" swrc:key="date"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Arie de Bruin"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Wojciech Penczek"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Andrzej Szalas"/></rdf:_2></rdf:Seq></swrc:editor></rdf:Description></burst:publication><description>dblp</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/23971995881ef9cc7322d202287533408/emanuel"><title>Foundations of Inductive Logic Programming</title><link>http://www.bibsonomy.org/bibtex/23971995881ef9cc7322d202287533408/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2009-05-26T17:07:43+02:00</dc:date><dc:subject>book ilp induction inductive_programming logic </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt;,  and &lt;a href=&#034;/author/de Wolf&#034;&gt;Ronald de Wolf&lt;/a&gt; &lt;/span&gt;&lt;em&gt;LNAI &lt;/em&gt;&lt;em&gt;Springer-Verlag, &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/book"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ilp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/logic"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/23971995881ef9cc7322d202287533408/emanuel"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/23971995881ef9cc7322d202287533408/emanuel"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Book"/><owl:sameAs rdf:resource="http://portal.acm.org/citation.cfm?id=548817"/><swrc:date>Tue May 26 17:07:43 CEST 2009</swrc:date><swrc:publisher><swrc:Organization swrc:name="Springer-Verlag"/></swrc:publisher><swrc:series>LNAI</swrc:series><swrc:title>Foundations of Inductive Logic Programming</swrc:title><swrc:volume>1228</swrc:volume><swrc:year>1997</swrc:year><swrc:keywords>book ilp induction inductive_programming logic </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="3540629270" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Ronald de Wolf"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/222a114772cd1b05ef1a7184c01ae093f/emanuel"><title>Subsumption Theorem and Refutation Completeness</title><link>http://www.bibsonomy.org/bibtex/222a114772cd1b05ef1a7184c01ae093f/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2009-01-08T12:56:22+01:00</dc:date><dc:subject>ilp logic </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt;,  and &lt;a href=&#034;/author/de Wolf&#034;&gt;Roland de Wolf&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Foundations of Inductive Logic Programming, &lt;/em&gt;&lt;em&gt;volume 1228 of LNAI, &lt;/em&gt;&lt;em&gt;chapter 5, &lt;/em&gt;&lt;em&gt;Springer-Verlag, &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/ilp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/logic"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/222a114772cd1b05ef1a7184c01ae093f/emanuel"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/222a114772cd1b05ef1a7184c01ae093f/emanuel"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InCollection"/><swrc:date>Thu Jan 08 12:56:22 CET 2009</swrc:date><swrc:booktitle>Foundations of Inductive Logic Programming</swrc:booktitle><swrc:chapter>5</swrc:chapter><swrc:publisher><swrc:Organization swrc:name="Springer-Verlag"/></swrc:publisher><swrc:series>LNAI</swrc:series><swrc:title>Subsumption Theorem and Refutation Completeness</swrc:title><swrc:volume>1228</swrc:volume><swrc:year>1997</swrc:year><swrc:keywords>ilp logic </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Roland de Wolf"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2ca00e6638064d504d2b77a14d7bea023/sebastian"><title>Existence and Nonexistence of Complete Refinement Operators.</title><link>http://www.bibsonomy.org/bibtex/2ca00e6638064d504d2b77a14d7bea023/sebastian</link><dc:creator>sebastian</dc:creator><dc:date>2007-11-02T15:38:49+01:00</dc:date><dc:subject>new refinement </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/van der Laag&#034;&gt;Patrick R. J. van der Laag&lt;/a&gt;,  and &lt;a href=&#034;/author/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt; &lt;/span&gt;&lt;em&gt;ECML, &lt;/em&gt;&lt;em&gt;volume 784 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 307-322. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;1994&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/new"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/refinement"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2ca00e6638064d504d2b77a14d7bea023/sebastian"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2ca00e6638064d504d2b77a14d7bea023/sebastian"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/ecml/ecml94.html#LaagN94"/><swrc:date>Fri Nov 02 15:38:49 CET 2007</swrc:date><swrc:booktitle>ECML</swrc:booktitle><swrc:crossref>conf/ecml/1994</swrc:crossref><swrc:pages>307-322</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Existence and Nonexistence of Complete Refinement Operators.</swrc:title><swrc:volume>784</swrc:volume><swrc:year>1994</swrc:year><swrc:keywords>new refinement </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="3-540-57868-4" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2002-02-20" swrc:key="date"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Patrick R. J. van der Laag"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Francesco Bergadano"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Luc De Raedt"/></rdf:_2></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/274c80f82f07ab20d0470db24bcc64810/sebastian"><title>A Refinement Operator for Description Logics</title><link>http://www.bibsonomy.org/bibtex/274c80f82f07ab20d0470db24bcc64810/sebastian</link><dc:creator>sebastian</dc:creator><dc:date>2006-12-17T16:44:14+01:00</dc:date><dc:subject>tag </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Badea&#034;&gt;Liviu Badea&lt;/a&gt;,  and &lt;a href=&#034;/author/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Lecture Notes in Computer Science&lt;/em&gt;  (&lt;em&gt;2000&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tag"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/274c80f82f07ab20d0470db24bcc64810/sebastian"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/274c80f82f07ab20d0470db24bcc64810/sebastian"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://link.springer-ny.com/link/service/series/0558/bibs/1866/18660040.htm;"/><swrc:date>Sun Dec 17 16:44:14 CET 2006</swrc:date><swrc:journal>Lecture Notes in Computer Science</swrc:journal><swrc:pages>40--??</swrc:pages><swrc:title>A Refinement Operator for Description Logics</swrc:title><swrc:volume>1866</swrc:volume><swrc:year>2000</swrc:year><swrc:keywords>tag </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://link.springer-ny.com/link/service/series/0558/tocs/t.htm" swrc:key="bibsource"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="Fri Feb 1 09:16:51 MST 2002" swrc:key="bibdate"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="0302-9743" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="Nelson H. F. Beebe, Center for Scientific
		 Computing, University of Utah, Department of
		 Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake
		 City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1
		 801 581 4148, e-mail: \path|beebe@math.utah.edu|,
		 \path|beebe@acm.org|, \path|beebe@computer.org|,
		 \path|beebe@ieee.org| (Internet), URL:
		 \path|http://www.math.utah.edu/~beebe/|" swrc:key="acknowledgement"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="LNCSD9" swrc:key="coden"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Liviu Badea"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/274c80f82f07ab20d0470db24bcc64810/jens"><title>A Refinement Operator for Description Logics</title><link>http://www.bibsonomy.org/bibtex/274c80f82f07ab20d0470db24bcc64810/jens</link><dc:creator>jens</dc:creator><dc:date>2006-10-12T15:52:32+02:00</dc:date><dc:subject>imported concept_learning </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Badea&#034;&gt;Liviu Badea&lt;/a&gt;,  and &lt;a href=&#034;/author/Nienhuys-Cheng&#034;&gt;Shan-Hwei Nienhuys-Cheng&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Lecture Notes in Computer Science&lt;/em&gt;  (&lt;em&gt;2000&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/concept_learning"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/274c80f82f07ab20d0470db24bcc64810/jens"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/274c80f82f07ab20d0470db24bcc64810/jens"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://link.springer-ny.com/link/service/series/0558/bibs/1866/18660040.htm;"/><swrc:date>Thu Oct 12 15:52:32 CEST 2006</swrc:date><swrc:journal>Lecture Notes in Computer Science</swrc:journal><swrc:pages>40--??</swrc:pages><swrc:title>A Refinement Operator for Description Logics</swrc:title><swrc:volume>1866</swrc:volume><swrc:year>2000</swrc:year><swrc:keywords>imported concept_learning </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://link.springer-ny.com/link/service/series/0558/tocs/t.htm" swrc:key="bibsource"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="Fri Feb 1 09:16:51 MST 2002" swrc:key="bibdate"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="0302-9743" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="Nelson H. F. Beebe, Center for Scientific
		 Computing, University of Utah, Department of
		 Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake
		 City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1
		 801 581 4148, e-mail: \path|beebe@math.utah.edu|,
		 \path|beebe@acm.org|, \path|beebe@computer.org|,
		 \path|beebe@ieee.org| (Internet), URL:
		 \path|http://www.math.utah.edu/~beebe/|" swrc:key="acknowledgement"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="LNCSD9" swrc:key="coden"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Liviu Badea"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Shan-Hwei Nienhuys-Cheng"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item></rdf:RDF>
