The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Shan-Hwei Nienhuys-Cheng: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Shan-Hwei Nienhuys-Cheng, Patrick R. J. van der Laag, Leendert W. N. van der Torre
    Constructing Refinement Operators by Decomposing Logical Implication. [Citation Graph (0, 0)][DBLP]
    AI*IA, 1993, pp:178-189 [Conf]
  2. Shan-Hwei Nienhuys-Cheng, Ronald de Wolf
    The Equivalence of the Subsumption Theorem and the Refutation-Completeness for Unconstrained Resolution. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1995, pp:269-285 [Conf]
  3. Liviu Badea, Shan-Hwei Nienhuys-Cheng
    Refining Concepts in Description Logics. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2000, pp:31-44 [Conf]
  4. Shan-Hwei Nienhuys-Cheng, Ronald de Wolf
    A Complete Method for Program Specialization Based on Unfolding. [Citation Graph (0, 0)][DBLP]
    ECAI, 1996, pp:438-442 [Conf]
  5. Patrick R. J. van der Laag, Shan-Hwei Nienhuys-Cheng
    Subsumption and Refinement in Model Inference. [Citation Graph (0, 0)][DBLP]
    ECML, 1993, pp:95-114 [Conf]
  6. Patrick R. J. van der Laag, Shan-Hwei Nienhuys-Cheng
    Existence and Nonexistence of Complete Refinement Operators. [Citation Graph (0, 0)][DBLP]
    ECML, 1994, pp:307-322 [Conf]
  7. Shan-Hwei Nienhuys-Cheng, Peter A. Flach
    Consistent Term Mappings, Term Partitions and Inverse Resolution. [Citation Graph (0, 0)][DBLP]
    EWSL, 1991, pp:361-374 [Conf]
  8. Shan-Hwei Nienhuys-Cheng, Mark Polman
    Complexity Dimensions and Learnability. [Citation Graph (0, 0)][DBLP]
    ECML, 1993, pp:348-353 [Conf]
  9. Shan-Hwei Nienhuys-Cheng, Mark Polman
    Sample PAC-Learnability in Model Inference. [Citation Graph (0, 0)][DBLP]
    ECML, 1994, pp:217-230 [Conf]
  10. Liviu Badea, Shan-Hwei Nienhuys-Cheng
    A Refinement Operator for Description Logics. [Citation Graph (0, 0)][DBLP]
    ILP, 2000, pp:40-59 [Conf]
  11. Shan-Hwei Nienhuys-Cheng
    Distance Between Herbrand Interpretations: A Measure for Approximations to a Target Concept. [Citation Graph (0, 0)][DBLP]
    ILP, 1997, pp:213-226 [Conf]
  12. Shan-Hwei Nienhuys-Cheng
    Distances and Limits on Herbrand Interpretations. [Citation Graph (0, 0)][DBLP]
    ILP, 1998, pp:250-260 [Conf]
  13. Shan-Hwei Nienhuys-Cheng, Wim Van Laer, Jan Ramon, Luc De Raedt
    Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms. [Citation Graph (0, 0)][DBLP]
    ILP, 1999, pp:245-256 [Conf]
  14. Shan-Hwei Nienhuys-Cheng, Ronald de Wolf
    Least Generalizations under Implication. [Citation Graph (0, 0)][DBLP]
    Inductive Logic Programming Workshop, 1996, pp:285-298 [Conf]
  15. Arie de Bruin, Shan-Hwei Nienhuys-Cheng
    Linear Dynamic Kahn Networks Are Deterministic. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:242-254 [Conf]
  16. Shan-Hwei Nienhuys-Cheng, Arie de Bruin
    Kahn's Fixed-Point Characterization for Linear Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1997, pp:513-522 [Conf]
  17. Shan-Hwei Nienhuys-Cheng, Ronald de Wolf
    Least Generalizations and Greatest Specializations of Sets of Clauses [Citation Graph (0, 0)][DBLP]
    CoRR, 1996, v:0, n:, pp:- [Journal]
  18. Shan-Hwei Nienhuys-Cheng
    Classification and syntax of constraints in binary semantical networks. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 1990, v:15, n:5, pp:497-513 [Journal]
  19. Shan-Hwei Nienhuys-Cheng, Ronald de Wolf
    Least Generalizations and Greatest Specializations of Sets of Clauses. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 1996, v:4, n:, pp:341-363 [Journal]
  20. Patrick R. J. van der Laag, Shan-Hwei Nienhuys-Cheng
    Completeness and Properness of Refinement Operators in Inductive Logic Programming. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1998, v:34, n:3, pp:201-225 [Journal]
  21. Arie de Bruin, Shan-Hwei Nienhuys-Cheng
    Linear Dynamic Kahn Networks are Deterministic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:195, n:1, pp:3-32 [Journal]

Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002