default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShan-Hwei Nienhuys-Cheng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
[c16]Liviu Badea, Shan-Hwei Nienhuys-Cheng:
Refining Concepts in Description Logics. Description Logics 2000: 31-44- [c15]Liviu Badea, Shan-Hwei Nienhuys-Cheng:
A Refinement Operator for Description Logics. ILP 2000: 40-59
1990 – 1999
- 1999
- [c14]Shan-Hwei Nienhuys-Cheng, Wim Van Laer, Jan Ramon, Luc De Raedt
:
Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms. ILP 1999: 245-256 - 1998
- [j4]Patrick R. J. van der Laag, Shan-Hwei Nienhuys-Cheng:
Completeness and Properness of Refinement Operators in Inductive Logic Programming. J. Log. Program. 34(3): 201-225 (1998) - [j3]Arie de Bruin, Shan-Hwei Nienhuys-Cheng:
Linear Dynamic Kahn Networks are Deterministic. Theor. Comput. Sci. 195(1): 3-32 (1998) - [c13]Shan-Hwei Nienhuys-Cheng:
Distances and Limits on Herbrand Interpretations. ILP 1998: 250-260 - 1997
- [b1]Shan-Hwei Nienhuys-Cheng, Ronald de Wolf:
Foundations of Inductive Logic Programming. Lecture Notes in Computer Science 1228, Springer 1997, ISBN 3-540-62927-0 - [c12]Shan-Hwei Nienhuys-Cheng:
Distance Between Herbrand Interpretations: A Measure for Approximations to a Target Concept. ILP 1997: 213-226 - [c11]Shan-Hwei Nienhuys-Cheng, Arie de Bruin:
Kahn's Fixed-Point Characterization for Linear Dynamic Networks. SOFSEM 1997: 513-522 - 1996
- [j2]Shan-Hwei Nienhuys-Cheng, Ronald de Wolf:
Least Generalizations and Greatest Specializations of Sets of Clauses. J. Artif. Intell. Res. 4: 341-363 (1996) - [c10]Shan-Hwei Nienhuys-Cheng, Ronald de Wolf:
A Complete Method for Program Specialization Based on Unfolding. ECAI 1996: 438-442 - [c9]Shan-Hwei Nienhuys-Cheng, Ronald de Wolf:
Least Generalizations under Implication. Inductive Logic Programming Workshop 1996: 285-298 - [c8]Arie de Bruin, Shan-Hwei Nienhuys-Cheng:
Linear Dynamic Kahn Networks Are Deterministic. MFCS 1996: 242-254 - [i1]Shan-Hwei Nienhuys-Cheng, Ronald de Wolf:
Least Generalizations and Greatest Specializations of Sets of Clauses. CoRR cs.AI/9605102 (1996) - 1995
- [c7]Shan-Hwei Nienhuys-Cheng, Ronald de Wolf:
The Equivalence of the Subsumption Theorem and the Refutation-Completeness for Unconstrained Resolution. ASIAN 1995: 269-285 - 1994
- [c6]Shan-Hwei Nienhuys-Cheng, Mark Polman:
Sample PAC-Learnability in Model Inference. ECML 1994: 217-230 - [c5]Patrick R. J. van der Laag, Shan-Hwei Nienhuys-Cheng:
Existence and Nonexistence of Complete Refinement Operators. ECML 1994: 307-322 - 1993
- [c4]Shan-Hwei Nienhuys-Cheng, Patrick R. J. van der Laag, Leendert W. N. van der Torre:
Constructing Refinement Operators by Decomposing Logical Implication. AI*IA 1993: 178-189 - [c3]Patrick R. J. van der Laag, Shan-Hwei Nienhuys-Cheng:
Subsumption and Refinement in Model Inference. ECML 1993: 95-114 - [c2]Shan-Hwei Nienhuys-Cheng, Mark Polman:
Complexity Dimensions and Learnability. ECML 1993: 348-353 - 1991
- [c1]Shan-Hwei Nienhuys-Cheng, Peter A. Flach:
Consistent Term Mappings, Term Partitions and Inverse Resolution. EWSL 1991: 361-374 - 1990
- [j1]Shan-Hwei Nienhuys-Cheng:
Classification and syntax of constraints in binary semantical networks. Inf. Syst. 15(5): 497-513 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
