( en | de | ru )

 

Disambiguation of "Nienhuys-Cheng, Shan-Hwei"

Author of the publication

copydeleteadd this publication to your clipboard
Linear Dynamic Kahn Networks Are Deterministic.

, and . MFCS, volume 1113 of Lecture Notes in Computer Science, page 242-254. Springer, (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kun-Shan Cheng

Shan-Cheng Yuan

Shan-Shan Zhan

Cheng-Yung Cheng

Hwei Ling Khor

 

Other publications of authors with the same name

Existence and Nonexistence of Complete Refinement Operators., and . ECML, volume 784 of Lecture Notes in Computer Science, page 307-322. Springer, (1994)Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms., , , and . ILP, volume 1634 of Lecture Notes in Computer Science, page 245-256. Springer, (1999)Complexity Dimensions and Learnability., and . ECML, volume 667 of Lecture Notes in Computer Science, page 348-353. Springer, (1993)Linear Dynamic Kahn Networks Are Deterministic., and . MFCS, volume 1113 of Lecture Notes in Computer Science, page 242-254. Springer, (1996)Distances and Limits on Herbrand Interpretations.. ILP, volume 1446 of Lecture Notes in Computer Science, page 250-260. Springer, (1998)The Equivalence of the Subsumption Theorem and the Refutation-Completeness for Unconstrained Resolution., and . ASIAN, volume 1023 of Lecture Notes in Computer Science, page 269-285. Springer, (1995)Consistent Term Mappings, Term Partitions and Inverse Resolution., and . EWSL, volume 482 of Lecture Notes in Computer Science, page 361-374. Springer, (1991)Classification and syntax of constraints in binary semantical networks.. Inf. Syst., 15 (5): 497-513 (1990)Subsumption Theorem and Refutation Completeness, and . Foundations of Inductive Logic Programming, volume 1228 of LNAI, chapter 5, Springer-Verlag, (1997)Least Generalizations under Implication., and . Inductive Logic Programming Workshop, volume 1314 of Lecture Notes in Computer Science, page 285-298. Springer, (1996)