( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Existence and Nonexistence of Complete Refinement Operators.

, и . ECML, том 784 из Lecture Notes in Computer Science, стр. 307-322. Springer, (1994)

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.

Kun-Shan Cheng

Shan-Cheng Yuan

Shan-Shan Zhan

Cheng-Yung Cheng

Hwei Ling Khor

 

Другие публикации лиц с тем же именем

Existence and Nonexistence of Complete Refinement Operators., и . ECML, том 784 из Lecture Notes in Computer Science, стр. 307-322. Springer, (1994)Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms., , , и . ILP, том 1634 из Lecture Notes in Computer Science, стр. 245-256. Springer, (1999)Complexity Dimensions and Learnability., и . ECML, том 667 из Lecture Notes in Computer Science, стр. 348-353. Springer, (1993)Linear Dynamic Kahn Networks Are Deterministic., и . MFCS, том 1113 из Lecture Notes in Computer Science, стр. 242-254. Springer, (1996)Distance Between Herbrand Interpretations: A Measure for Approximations to a Target Concept.. ILP, том 1297 из Lecture Notes in Computer Science, стр. 213-226. Springer, (1997)Subsumption and Refinement in Model Inference., и . ECML, том 667 из Lecture Notes in Computer Science, стр. 95-114. Springer, (1993)A Refinement Operator for Description Logics., и . ILP, том 1866 из Lecture Notes in Computer Science, стр. 40-59. Springer, (2000)Classification and syntax of constraints in binary semantical networks.. Inf. Syst., 15 (5): 497-513 (1990)Least Generalizations under Implication., и . Inductive Logic Programming Workshop, том 1314 из Lecture Notes in Computer Science, стр. 285-298. Springer, (1996)Subsumption Theorem and Refutation Completeness, и . Foundations of Inductive Logic Programming, том 1228 из LNAI, глава 5, Springer-Verlag, (1997)