@article{journals/corr/cs-AI-9605102, added-at = {2011-12-05T00:00:00.000+0100}, author = {Nienhuys-Cheng, Shan-Hwei and de Wolf, Ronald}, biburl = {http://www.bibsonomy.org/bibtex/250459827e089d79042897bcee74242eb/dblp}, ee = {http://arxiv.org/abs/cs.AI/9605102}, interhash = {a445a54bbce80d92d57d844e8e1cea0f}, intrahash = {50459827e089d79042897bcee74242eb}, journal = {CoRR}, keywords = {dblp}, title = {Least Generalizations and Greatest Specializations of Sets of Clauses}, url = {http://dblp.uni-trier.de/db/journals/corr/corr9605.html#cs-AI-9605102}, volume = {cs.AI/9605102}, year = 1996 } @article{journals/jlp/LaagN98, added-at = {2011-12-01T00:00:00.000+0100}, author = {van der Laag, Patrick R. J. and Nienhuys-Cheng, Shan-Hwei}, biburl = {http://www.bibsonomy.org/bibtex/2cf04558a12fe326f7755f680b74ed8d6/dblp}, ee = {http://dx.doi.org/10.1016/S0743-1066(97)00077-0}, interhash = {4bd9c90f6e8228bf83ecd41e62bef3a7}, intrahash = {cf04558a12fe326f7755f680b74ed8d6}, journal = {J. Log. Program.}, keywords = {dblp}, number = 3, pages = {201-225}, title = {Completeness and Properness of Refinement Operators in Inductive Logic Programming.}, url = {http://dblp.uni-trier.de/db/journals/jlp/jlp34.html#LaagN98}, volume = 34, year = 1998 } @article{journals/is/Nienhuys-Cheng90, added-at = {2011-08-25T00:00:00.000+0200}, author = {Nienhuys-Cheng, Shan-Hwei}, biburl = {http://www.bibsonomy.org/bibtex/2d0967518efd6fa3a88c58911f8de3b12/dblp}, ee = {http://dx.doi.org/10.1016/0306-4379(90)90023-I}, interhash = {af86add870c7372dc43c29606679bef8}, intrahash = {d0967518efd6fa3a88c58911f8de3b12}, journal = {Inf. Syst.}, keywords = {dblp}, number = 5, pages = {497-513}, title = {Classification and syntax of constraints in binary semantical networks.}, url = {http://dblp.uni-trier.de/db/journals/is/is15.html#Nienhuys-Cheng90}, volume = 15, year = 1990 } @inproceedings{conf/ilp/Nienhuys-ChengLRR99, added-at = {2011-06-17T00:00:00.000+0200}, author = {Nienhuys-Cheng, Shan-Hwei and Laer, Wim Van and Ramon, Jan and Raedt, Luc De}, biburl = {http://www.bibsonomy.org/bibtex/271eb828d51b2f7e35dc8d5d88b9bb832/dblp}, booktitle = {ILP}, crossref = {conf/ilp/1999}, editor = {Dzeroski, Saso and Flach, Peter A.}, ee = {http://dx.doi.org/10.1007/3-540-48751-4_23}, interhash = {3c1e4232f0555afa800f26fefbabf4e4}, intrahash = {71eb828d51b2f7e35dc8d5d88b9bb832}, isbn = {3-540-66109-3}, keywords = {dblp}, pages = {245-256}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms.}, url = {http://dblp.uni-trier.de/db/conf/ilp/ilp99.html#Nienhuys-ChengLRR99}, volume = 1634, year = 1999 } @inproceedings{conf/sofsem/Nienhuys-ChengB97, added-at = {2011-06-16T00:00:00.000+0200}, author = {Nienhuys-Cheng, Shan-Hwei and de Bruin, Arie}, biburl = {http://www.bibsonomy.org/bibtex/2610576b6822843756c52c92feb6b6b39/dblp}, booktitle = {SOFSEM}, crossref = {conf/sofsem/1997}, editor = {Plasil, Frantisek and Jeffery, Keith G.}, ee = {http://dx.doi.org/10.1007/3-540-63774-5_133}, interhash = {c771196f01ac55ae4c8efcace76bfa32}, intrahash = {610576b6822843756c52c92feb6b6b39}, isbn = {3-540-63774-5}, keywords = {dblp}, pages = {513-522}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Kahn's Fixed-Point Characterization for Linear Dynamic Networks.}, url = {http://dblp.uni-trier.de/db/conf/sofsem/sofsem1997.html#Nienhuys-ChengB97}, volume = 1338, year = 1997 } @inproceedings{conf/ilp/Nienhuys-Cheng97, added-at = {2011-06-16T00:00:00.000+0200}, author = {Nienhuys-Cheng, Shan-Hwei}, biburl = {http://www.bibsonomy.org/bibtex/2cd06864c98d1aecf40759cde2ca1bd07/dblp}, booktitle = {ILP}, crossref = {conf/ilp/1997}, editor = {Lavrac, Nada and Dzeroski, Saso}, ee = {http://dx.doi.org/10.1007/3540635149_50}, interhash = {2fde01512b35bd9cf749d52ef83d7778}, intrahash = {cd06864c98d1aecf40759cde2ca1bd07}, isbn = {3-540-63514-9}, keywords = {dblp}, pages = {213-226}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Distance Between Herbrand Interpretations: A Measure for Approximations to a Target Concept.}, url = {http://dblp.uni-trier.de/db/conf/ilp/ilp97.html#Nienhuys-Cheng97}, volume = 1297, year = 1997 } @inproceedings{conf/ilp/Nienhuys-ChengW96, added-at = {2011-06-16T00:00:00.000+0200}, author = {Nienhuys-Cheng, Shan-Hwei and de Wolf, Ronald}, biburl = {http://www.bibsonomy.org/bibtex/29c147f1fd960b94c220dd996ced1e34b/dblp}, booktitle = {Inductive Logic Programming Workshop}, crossref = {conf/ilp/1996}, editor = {Muggleton, Stephen}, ee = {http://dx.doi.org/10.1007/3-540-63494-0_61}, interhash = {27c8ffedb3ee083da8efafa6cef14a50}, intrahash = {9c147f1fd960b94c220dd996ced1e34b}, isbn = {3-540-63494-0}, keywords = {dblp}, pages = {285-298}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Least Generalizations under Implication.}, url = {http://dblp.uni-trier.de/db/conf/ilp/ilp96.html#Nienhuys-ChengW96}, volume = 1314, year = 1996 } @inproceedings{conf/ilp/Nienhuys-Cheng98, added-at = {2011-06-16T00:00:00.000+0200}, author = {Nienhuys-Cheng, Shan-Hwei}, biburl = {http://www.bibsonomy.org/bibtex/271593608fd761cf339ab05a8ec672504/dblp}, booktitle = {ILP}, crossref = {conf/ilp/1998}, editor = {Page, David}, ee = {http://dx.doi.org/10.1007/BFb0027329}, interhash = {5e56890d273390db309c643452d1bc58}, intrahash = {71593608fd761cf339ab05a8ec672504}, isbn = {3-540-64738-4}, keywords = {dblp}, pages = {250-260}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Distances and Limits on Herbrand Interpretations.}, url = {http://dblp.uni-trier.de/db/conf/ilp/ilp98.html#Nienhuys-Cheng98}, volume = 1446, year = 1998 } @article{journals/jair/Nienhuys-ChengW96, added-at = {2010-07-21T15:45:16.000+0200}, author = {Nienhuys-Cheng, Shan-Hwei and de Wolf, Ronald}, biburl = {http://www.bibsonomy.org/bibtex/2edd03560d2c76099cdaba2e738edfa67/dblp}, date = {2010-06-11}, ee = {http://dx.doi.org/10.1613/jair.259}, interhash = {a445a54bbce80d92d57d844e8e1cea0f}, intrahash = {edd03560d2c76099cdaba2e738edfa67}, journal = {J. Artif. Intell. Res. (JAIR)}, keywords = {dblp}, pages = {341-363}, title = {Least Generalizations and Greatest Specializations of Sets of Clauses.}, url = {http://dblp.uni-trier.de/db/journals/jair/jair4.html#Nienhuys-ChengW96}, volume = 4, year = 1996 } @inproceedings{conf/ecml/Nienhuys-ChengF91, added-at = {2009-10-15T00:00:00.000+0200}, author = {Nienhuys-Cheng, Shan-Hwei and Flach, Peter A.}, biburl = {http://www.bibsonomy.org/bibtex/21a87cc28015c194619a2f858e9b7918a/dblp}, booktitle = {EWSL}, crossref = {conf/ecml/1991}, date = {2009-10-15}, description = {dblp}, editor = {Kodratoff, Yves}, ee = {http://dx.doi.org/10.1007/BFb0017030}, interhash = {09e7fcd20295f5d31800de77a4c5d2fc}, intrahash = {1a87cc28015c194619a2f858e9b7918a}, isbn = {3-540-53816-X}, keywords = {dblp}, pages = {361-374}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Consistent Term Mappings, Term Partitions and Inverse Resolution.}, url = {http://dblp.uni-trier.de/db/conf/ecml/ewsl91.html#Nienhuys-ChengF91}, volume = 482, year = 1991 } @inproceedings{conf/ecml/Nienhuys-ChengP94, added-at = {2009-10-15T00:00:00.000+0200}, author = {Nienhuys-Cheng, Shan-Hwei and Polman, Mark}, biburl = {http://www.bibsonomy.org/bibtex/25686fcf08fa41f5a1e5a268954cd5b51/dblp}, booktitle = {ECML}, crossref = {conf/ecml/1994}, date = {2009-10-15}, description = {dblp}, editor = {Bergadano, Francesco and Raedt, Luc De}, ee = {http://dx.doi.org/10.1007/3-540-57868-4_60}, interhash = {381c8339535a415983147054a9a12631}, intrahash = {5686fcf08fa41f5a1e5a268954cd5b51}, isbn = {3-540-57868-4}, keywords = {dblp}, pages = {217-230}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Sample PAC-Learnability in Model Inference.}, url = {http://dblp.uni-trier.de/db/conf/ecml/ecml94.html#Nienhuys-ChengP94}, volume = 784, year = 1994 } @inproceedings{conf/ecml/LaagN94, added-at = {2009-10-15T00:00:00.000+0200}, author = {van der Laag, Patrick R. J. and Nienhuys-Cheng, Shan-Hwei}, biburl = {http://www.bibsonomy.org/bibtex/2ca00e6638064d504d2b77a14d7bea023/dblp}, booktitle = {ECML}, crossref = {conf/ecml/1994}, date = {2009-10-15}, description = {dblp}, editor = {Bergadano, Francesco and Raedt, Luc De}, ee = {http://dx.doi.org/10.1007/3-540-57868-4_66}, interhash = {2407a5674bad1172718f2256fa73df23}, intrahash = {ca00e6638064d504d2b77a14d7bea023}, isbn = {3-540-57868-4}, keywords = {dblp}, pages = {307-322}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Existence and Nonexistence of Complete Refinement Operators.}, url = {http://dblp.uni-trier.de/db/conf/ecml/ecml94.html#LaagN94}, volume = 784, year = 1994 } @inproceedings{conf/ecml/Nienhuys-ChengP93, added-at = {2009-10-15T00:00:00.000+0200}, author = {Nienhuys-Cheng, Shan-Hwei and Polman, Mark}, biburl = {http://www.bibsonomy.org/bibtex/26d5dcbaf736848b28d092292013d6556/dblp}, booktitle = {ECML}, crossref = {conf/ecml/1993}, date = {2009-10-15}, description = {dblp}, editor = {Brazdil, Pavel}, ee = {http://dx.doi.org/10.1007/3-540-56602-3_149}, interhash = {ee93b7a19774b1b90c7028ad59e8b8b3}, intrahash = {6d5dcbaf736848b28d092292013d6556}, isbn = {3-540-56602-3}, keywords = {dblp}, pages = {348-353}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Complexity Dimensions and Learnability.}, url = {http://dblp.uni-trier.de/db/conf/ecml/ecml93.html#Nienhuys-ChengP93}, volume = 667, year = 1993 } @inproceedings{conf/ecml/LaagN93, added-at = {2009-10-15T00:00:00.000+0200}, author = {van der Laag, Patrick R. J. and Nienhuys-Cheng, Shan-Hwei}, biburl = {http://www.bibsonomy.org/bibtex/2a84ed15e47ce7613657a6133140bbca9/dblp}, booktitle = {ECML}, crossref = {conf/ecml/1993}, date = {2009-10-15}, description = {dblp}, editor = {Brazdil, Pavel}, ee = {http://dx.doi.org/10.1007/3-540-56602-3_130}, interhash = {94368fc96c6bb61849086b5c319393c9}, intrahash = {a84ed15e47ce7613657a6133140bbca9}, isbn = {3-540-56602-3}, keywords = {dblp}, pages = {95-114}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Subsumption and Refinement in Model Inference.}, url = {http://dblp.uni-trier.de/db/conf/ecml/ecml93.html#LaagN93}, volume = 667, year = 1993 } @inproceedings{conf/mfcs/BruinN96, added-at = {2009-09-21T00:00:00.000+0200}, author = {de Bruin, Arie and Nienhuys-Cheng, Shan-Hwei}, biburl = {http://www.bibsonomy.org/bibtex/2c4966b4ee45f8dcde38bc4bcd5f2d180/dblp}, booktitle = {MFCS}, crossref = {conf/mfcs/1996}, date = {2009-09-21}, description = {dblp}, editor = {Penczek, Wojciech and Szalas, Andrzej}, ee = {http://dx.doi.org/10.1007/3-540-61550-4_152}, interhash = {53eeb4e7b7694224283fcc83555a3d5a}, intrahash = {c4966b4ee45f8dcde38bc4bcd5f2d180}, isbn = {3-540-61550-4}, keywords = {dblp}, pages = {242-254}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Linear Dynamic Kahn Networks Are Deterministic.}, url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs96.html#BruinN96}, volume = 1113, year = 1996 } @book{Nienhuys-ChengWo97, added-at = {2009-05-26T17:07:43.000+0200}, author = {Nienhuys-Cheng, Shan-Hwei and de Wolf, Ronald}, biburl = {http://www.bibsonomy.org/bibtex/23971995881ef9cc7322d202287533408/emanuel}, interhash = {b499a980841175cd74e10344a8cb575f}, intrahash = {3971995881ef9cc7322d202287533408}, isbn = {3540629270}, keywords = {book ilp induction inductive_programming logic}, publisher = {Springer-Verlag}, series = {LNAI}, title = {Foundations of Inductive Logic Programming}, url = {http://portal.acm.org/citation.cfm?id=548817}, volume = 1228, year = 1997 } @incollection{Nienhuys-ChengWo97subsum, added-at = {2009-01-08T12:56:22.000+0100}, author = {Nienhuys-Cheng, Shan-Hwei and de Wolf, Roland}, biburl = {http://www.bibsonomy.org/bibtex/222a114772cd1b05ef1a7184c01ae093f/emanuel}, booktitle = {Foundations of Inductive Logic Programming}, chapter = 5, interhash = {5ab6e6a9f203c10bd8ddb16329f28424}, intrahash = {22a114772cd1b05ef1a7184c01ae093f}, keywords = {ilp logic}, publisher = {Springer-Verlag}, series = {LNAI}, title = {Subsumption Theorem and Refutation Completeness}, volume = 1228, year = 1997 } @inproceedings{conf/ecml/LaagN94, added-at = {2007-11-02T15:38:49.000+0100}, author = {van der Laag, Patrick R. J. and Nienhuys-Cheng, Shan-Hwei}, biburl = {http://www.bibsonomy.org/bibtex/2ca00e6638064d504d2b77a14d7bea023/sebastian}, booktitle = {ECML}, crossref = {conf/ecml/1994}, date = {2002-02-20}, editor = {Bergadano, Francesco and Raedt, Luc De}, interhash = {2407a5674bad1172718f2256fa73df23}, intrahash = {ca00e6638064d504d2b77a14d7bea023}, isbn = {3-540-57868-4}, keywords = {new refinement}, pages = {307-322}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Existence and Nonexistence of Complete Refinement Operators.}, url = {http://dblp.uni-trier.de/db/conf/ecml/ecml94.html#LaagN94}, volume = 784, year = 1994 } @article{Badea:2000:ROD, acknowledgement = {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/|}, added-at = {2006-12-17T16:44:14.000+0100}, author = {Badea, Liviu and Nienhuys-Cheng, Shan-Hwei}, bibdate = {Fri Feb 1 09:16:51 MST 2002}, bibsource = {http://link.springer-ny.com/link/service/series/0558/tocs/t.htm}, biburl = {http://www.bibsonomy.org/bibtex/274c80f82f07ab20d0470db24bcc64810/sebastian}, coden = {LNCSD9}, interhash = {2eb6d03d9ffeed0c955013e13510d104}, intrahash = {74c80f82f07ab20d0470db24bcc64810}, issn = {0302-9743}, journal = {Lecture Notes in Computer Science}, keywords = {tag}, pages = {40--??}, title = {A Refinement Operator for Description Logics}, url = {http://link.springer-ny.com/link/service/series/0558/bibs/1866/18660040.htm;}, volume = 1866, year = 2000 } @article{Badea:2000:ROD, acknowledgement = {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/|}, added-at = {2006-10-12T15:52:32.000+0200}, author = {Badea, Liviu and Nienhuys-Cheng, Shan-Hwei}, bibdate = {Fri Feb 1 09:16:51 MST 2002}, bibsource = {http://link.springer-ny.com/link/service/series/0558/tocs/t.htm}, biburl = {http://www.bibsonomy.org/bibtex/274c80f82f07ab20d0470db24bcc64810/jens}, coden = {LNCSD9}, interhash = {2eb6d03d9ffeed0c955013e13510d104}, intrahash = {74c80f82f07ab20d0470db24bcc64810}, issn = {0302-9743}, journal = {Lecture Notes in Computer Science}, keywords = {imported concept_learning}, pages = {40--??}, title = {A Refinement Operator for Description Logics}, url = {http://link.springer-ny.com/link/service/series/0558/bibs/1866/18660040.htm;}, volume = 1866, year = 2000 }