| 2000 |
|---|
| 22 | EE | Liviu Badea,
Shan-Hwei Nienhuys-Cheng:
Refining Concepts in Description Logics.
Description Logics 2000: 31-44 |
| 21 | EE | Liviu Badea,
Shan-Hwei Nienhuys-Cheng:
A Refinement Operator for Description Logics.
ILP 2000: 40-59 |
| 1999 |
|---|
| 20 | EE | 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 |
|---|
| 19 | | Shan-Hwei Nienhuys-Cheng:
Distances and Limits on Herbrand Interpretations.
ILP 1998: 250-260 |
| 18 | | 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) |
| 17 | EE | Arie de Bruin,
Shan-Hwei Nienhuys-Cheng:
Linear Dynamic Kahn Networks are Deterministic.
Theor. Comput. Sci. 195(1): 3-32 (1998) |
| 1997 |
|---|
| 16 | | Shan-Hwei Nienhuys-Cheng,
Ronald de Wolf:
Foundations of Inductive Logic Programming
Springer 1997 |
| 15 | | Shan-Hwei Nienhuys-Cheng:
Distance Between Herbrand Interpretations: A Measure for Approximations to a Target Concept.
ILP 1997: 213-226 |
| 14 | | Shan-Hwei Nienhuys-Cheng,
Arie de Bruin:
Kahn's Fixed-Point Characterization for Linear Dynamic Networks.
SOFSEM 1997: 513-522 |
| 1996 |
|---|
| 13 | | Shan-Hwei Nienhuys-Cheng,
Ronald de Wolf:
A Complete Method for Program Specialization Based on Unfolding.
ECAI 1996: 438-442 |
| 12 | | Shan-Hwei Nienhuys-Cheng,
Ronald de Wolf:
Least Generalizations under Implication.
Inductive Logic Programming Workshop 1996: 285-298 |
| 11 | | Arie de Bruin,
Shan-Hwei Nienhuys-Cheng:
Linear Dynamic Kahn Networks Are Deterministic.
MFCS 1996: 242-254 |
| 10 | EE | Shan-Hwei Nienhuys-Cheng,
Ronald de Wolf:
Least Generalizations and Greatest Specializations of Sets of Clauses
CoRR cs.AI/9605102: (1996) |
| 9 | | Shan-Hwei Nienhuys-Cheng,
Ronald de Wolf:
Least Generalizations and Greatest Specializations of Sets of Clauses.
J. Artif. Intell. Res. (JAIR) 4: 341-363 (1996) |
| 1995 |
|---|
| 8 | | 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 |
|---|
| 7 | | Shan-Hwei Nienhuys-Cheng,
Mark Polman:
Sample PAC-Learnability in Model Inference.
ECML 1994: 217-230 |
| 6 | | Patrick R. J. van der Laag,
Shan-Hwei Nienhuys-Cheng:
Existence and Nonexistence of Complete Refinement Operators.
ECML 1994: 307-322 |
| 1993 |
|---|
| 5 | | 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 |
| 4 | | Shan-Hwei Nienhuys-Cheng,
Mark Polman:
Complexity Dimensions and Learnability.
ECML 1993: 348-353 |
| 3 | | Patrick R. J. van der Laag,
Shan-Hwei Nienhuys-Cheng:
Subsumption and Refinement in Model Inference.
ECML 1993: 95-114 |
| 1991 |
|---|
| 2 | | Shan-Hwei Nienhuys-Cheng,
Peter A. Flach:
Consistent Term Mappings, Term Partitions and Inverse Resolution.
EWSL 1991: 361-374 |
| 1990 |
|---|
| 1 | | Shan-Hwei Nienhuys-Cheng:
Classification and syntax of constraints in binary semantical networks.
Inf. Syst. 15(5): 497-513 (1990) |
