BibSonomy publications for /author/Nienhuys-ChengBibSonomypublrss/author/Nienhuys-ChengBibSonomy RSS feed for /author/Nienhuys-Cheng2012-02-16T22:00:12+01:00Least Generalizations and Greatest Specializations of Sets of Clauseshttp://www.bibsonomy.org/bibtex/250459827e089d79042897bcee74242eb/dblpdblp2011-12-05T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a>, and <a href="/author/de Wolf">Ronald de Wolf</a> </span><em>CoRR</em> (<em>1996</em>)Completeness and Properness of Refinement Operators in Inductive Logic Programming.http://www.bibsonomy.org/bibtex/2cf04558a12fe326f7755f680b74ed8d6/dblpdblp2011-12-01T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/van der Laag">Patrick R. J. van der Laag</a>, and <a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a> </span><em>J. Log. Program.</em> <em>34(3):201-225</em> (<em>1998</em>)Classification and syntax of constraints in binary semantical networks.http://www.bibsonomy.org/bibtex/2d0967518efd6fa3a88c58911f8de3b12/dblpdblp2011-08-25T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a> </span><em>Inf. Syst.</em> <em>15(5):497-513</em> (<em>1990</em>)Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms.http://www.bibsonomy.org/bibtex/271eb828d51b2f7e35dc8d5d88b9bb832/dblpdblp2011-06-17T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a>, <a href="/author/Laer">Wim Van Laer</a>, <a href="/author/Ramon">Jan Ramon</a>, and <a href="/author/Raedt">Luc De Raedt</a> </span><em>ILP, </em><em>volume 1634 of Lecture Notes in Computer Science, </em><em>page 245-256. </em><em>Springer, </em>(<em>1999</em>)Kahn's Fixed-Point Characterization for Linear Dynamic Networks.http://www.bibsonomy.org/bibtex/2610576b6822843756c52c92feb6b6b39/dblpdblp2011-06-16T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a>, and <a href="/author/de Bruin">Arie de Bruin</a> </span><em>SOFSEM, </em><em>volume 1338 of Lecture Notes in Computer Science, </em><em>page 513-522. </em><em>Springer, </em>(<em>1997</em>)Distance Between Herbrand Interpretations: A Measure for Approximations to a Target Concept.http://www.bibsonomy.org/bibtex/2cd06864c98d1aecf40759cde2ca1bd07/dblpdblp2011-06-16T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a> </span><em>ILP, </em><em>volume 1297 of Lecture Notes in Computer Science, </em><em>page 213-226. </em><em>Springer, </em>(<em>1997</em>)Least Generalizations under Implication.http://www.bibsonomy.org/bibtex/29c147f1fd960b94c220dd996ced1e34b/dblpdblp2011-06-16T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a>, and <a href="/author/de Wolf">Ronald de Wolf</a> </span><em>Inductive Logic Programming Workshop, </em><em>volume 1314 of Lecture Notes in Computer Science, </em><em>page 285-298. </em><em>Springer, </em>(<em>1996</em>)Distances and Limits on Herbrand Interpretations.http://www.bibsonomy.org/bibtex/271593608fd761cf339ab05a8ec672504/dblpdblp2011-06-16T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a> </span><em>ILP, </em><em>volume 1446 of Lecture Notes in Computer Science, </em><em>page 250-260. </em><em>Springer, </em>(<em>1998</em>)Least Generalizations and Greatest Specializations of Sets of Clauses.http://www.bibsonomy.org/bibtex/2edd03560d2c76099cdaba2e738edfa67/dblpdblp2010-07-21T15:45:16+02:00dblp <span class="authorEditorList"><a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a>, and <a href="/author/de Wolf">Ronald de Wolf</a> </span><em>J. Artif. Intell. Res. JAIR</em> (<em>1996</em>)Consistent Term Mappings, Term Partitions and Inverse Resolution.http://www.bibsonomy.org/bibtex/21a87cc28015c194619a2f858e9b7918a/dblpdblp2009-10-15T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a>, and <a href="/author/Flach">Peter A. Flach</a> </span><em>EWSL, </em><em>volume 482 of Lecture Notes in Computer Science, </em><em>page 361-374. </em><em>Springer, </em>(<em>1991</em>)dblpSample PAC-Learnability in Model Inference.http://www.bibsonomy.org/bibtex/25686fcf08fa41f5a1e5a268954cd5b51/dblpdblp2009-10-15T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a>, and <a href="/author/Polman">Mark Polman</a> </span><em>ECML, </em><em>volume 784 of Lecture Notes in Computer Science, </em><em>page 217-230. </em><em>Springer, </em>(<em>1994</em>)dblpExistence and Nonexistence of Complete Refinement Operators.http://www.bibsonomy.org/bibtex/2ca00e6638064d504d2b77a14d7bea023/dblpdblp2009-10-15T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/van der Laag">Patrick R. J. van der Laag</a>, and <a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a> </span><em>ECML, </em><em>volume 784 of Lecture Notes in Computer Science, </em><em>page 307-322. </em><em>Springer, </em>(<em>1994</em>)dblpComplexity Dimensions and Learnability.http://www.bibsonomy.org/bibtex/26d5dcbaf736848b28d092292013d6556/dblpdblp2009-10-15T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a>, and <a href="/author/Polman">Mark Polman</a> </span><em>ECML, </em><em>volume 667 of Lecture Notes in Computer Science, </em><em>page 348-353. </em><em>Springer, </em>(<em>1993</em>)dblpSubsumption and Refinement in Model Inference.http://www.bibsonomy.org/bibtex/2a84ed15e47ce7613657a6133140bbca9/dblpdblp2009-10-15T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/van der Laag">Patrick R. J. van der Laag</a>, and <a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a> </span><em>ECML, </em><em>volume 667 of Lecture Notes in Computer Science, </em><em>page 95-114. </em><em>Springer, </em>(<em>1993</em>)dblpLinear Dynamic Kahn Networks Are Deterministic.http://www.bibsonomy.org/bibtex/2c4966b4ee45f8dcde38bc4bcd5f2d180/dblpdblp2009-09-21T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/de Bruin">Arie de Bruin</a>, and <a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a> </span><em>MFCS, </em><em>volume 1113 of Lecture Notes in Computer Science, </em><em>page 242-254. </em><em>Springer, </em>(<em>1996</em>)dblpFoundations of Inductive Logic Programminghttp://www.bibsonomy.org/bibtex/23971995881ef9cc7322d202287533408/emanuelemanuel2009-05-26T17:07:43+02:00book ilp induction inductive_programming logic <span class="authorEditorList"><a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a>, and <a href="/author/de Wolf">Ronald de Wolf</a> </span><em>LNAI </em><em>Springer-Verlag, </em>(<em>1997</em>)Subsumption Theorem and Refutation Completenesshttp://www.bibsonomy.org/bibtex/222a114772cd1b05ef1a7184c01ae093f/emanuelemanuel2009-01-08T12:56:22+01:00ilp logic <span class="authorEditorList"><a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a>, and <a href="/author/de Wolf">Roland de Wolf</a> </span><em>Foundations of Inductive Logic Programming, </em><em>volume 1228 of LNAI, </em><em>chapter 5, </em><em>Springer-Verlag, </em>(<em>1997</em>)Existence and Nonexistence of Complete Refinement Operators.http://www.bibsonomy.org/bibtex/2ca00e6638064d504d2b77a14d7bea023/sebastiansebastian2007-11-02T15:38:49+01:00new refinement <span class="authorEditorList"><a href="/author/van der Laag">Patrick R. J. van der Laag</a>, and <a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a> </span><em>ECML, </em><em>volume 784 of Lecture Notes in Computer Science, </em><em>page 307-322. </em><em>Springer, </em>(<em>1994</em>)A Refinement Operator for Description Logicshttp://www.bibsonomy.org/bibtex/274c80f82f07ab20d0470db24bcc64810/sebastiansebastian2006-12-17T16:44:14+01:00tag <span class="authorEditorList"><a href="/author/Badea">Liviu Badea</a>, and <a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a> </span><em>Lecture Notes in Computer Science</em> (<em>2000</em>)A Refinement Operator for Description Logicshttp://www.bibsonomy.org/bibtex/274c80f82f07ab20d0470db24bcc64810/jensjens2006-10-12T15:52:32+02:00imported concept_learning <span class="authorEditorList"><a href="/author/Badea">Liviu Badea</a>, and <a href="/author/Nienhuys-Cheng">Shan-Hwei Nienhuys-Cheng</a> </span><em>Lecture Notes in Computer Science</em> (<em>2000</em>)