Classification and syntax of constraints in binary semantical networks. - Shan-Hwei Nienhuys-Cheng (Inf. Syst., 1990)

Consistent Term Mappings, Term Partitions and Inverse Resolution. - Shan-Hwei Nienhuys-Cheng; Peter A. Flach (EWSL, 1991)

Constructing Refinement Operators by Decomposing Logical Implication. - Shan-Hwei Nienhuys-Cheng; Patrick R. J. van der Laag; Leendert W. N. van der Torre (AI*IA, 1993)

Subsumption and Refinement in Model Inference. - Patrick R. J. van der Laag; Shan-Hwei Nienhuys-Cheng (ECML, 1993)

Complexity Dimensions and Learnability. - Shan-Hwei Nienhuys-Cheng; Mark Polman (ECML, 1993)

Existence and Nonexistence of Complete Refinement Operators. - Patrick R. J. van der Laag; Shan-Hwei Nienhuys-Cheng (ECML, 1994)

Sample PAC-Learnability in Model Inference. - Shan-Hwei Nienhuys-Cheng; Mark Polman (ECML, 1994)

The Equivalence of the Subsumption Theorem and the Refutation-Completeness for Unconstrained Resolution. - Shan-Hwei Nienhuys-Cheng; Ronald de Wolf (ASIAN, 1995)

A Complete Method for Program Specialization Based on Unfolding. - Shan-Hwei Nienhuys-Cheng; Ronald de Wolf (ECAI, 1996)

Least Generalizations under Implication. - Shan-Hwei Nienhuys-Cheng; Ronald de Wolf (Inductive Logic Programming Workshop, 1996)

Least Generalizations and Greatest Specializations of Sets of Clauses. - Shan-Hwei Nienhuys-Cheng; Ronald de Wolf (J. Artif. Intell. Res., 1996)

Foundations of Inductive Logic Programming - Shan-Hwei Nienhuys-Cheng; Ronald de Wolf (Springer, 1997)

Distance Between Herbrand Interpretations: A Measure for Approximations to a Target Concept. - Shan-Hwei Nienhuys-Cheng (ILP, 1997)

Kahn's Fixed-Point Characterization for Linear Dynamic Networks. - Shan-Hwei Nienhuys-Cheng; Arie de Bruin (SOFSEM, 1997)

Distances and Limits on Herbrand Interpretations. - Shan-Hwei Nienhuys-Cheng (ILP, 1998)

Completeness and Properness of Refinement Operators in Inductive Logic Programming. - Patrick R. J. van der Laag; Shan-Hwei Nienhuys-Cheng (J. Log. Program., 1998)

Linear Dynamic Kahn Networks are Deterministic. - Arie de Bruin; Shan-Hwei Nienhuys-Cheng (Theor. Comput. Sci., 1998)

Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms. - Shan-Hwei Nienhuys-Cheng; Wim Van Laer; Jan Ramon; Luc De Raedt (ILP, 1999)

Refining Concepts in Description Logics. - Liviu Badea; Shan-Hwei Nienhuys-Cheng (Description Logics, 2000)

A Refinement Operator for Description Logics. - Liviu Badea; Shan-Hwei Nienhuys-Cheng (ILP, 2000)