( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Constructing Refinement Operators by Decomposing Logical Implication.

, , и . AI*IA, том 728 из Lecture Notes in Computer Science, стр. 178-189. Springer, (1993)

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)Complexity Dimensions and Learnability., и . ECML, том 667 из Lecture Notes in Computer Science, стр. 348-353. Springer, (1993)Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms., , , и . ILP, том 1634 из Lecture Notes in Computer Science, стр. 245-256. Springer, (1999)Linear Dynamic Kahn Networks Are Deterministic., и . MFCS, том 1113 из Lecture Notes in Computer Science, стр. 242-254. Springer, (1996)Distances and Limits on Herbrand Interpretations.. ILP, том 1446 из Lecture Notes in Computer Science, стр. 250-260. Springer, (1998)Consistent Term Mappings, Term Partitions and Inverse Resolution., и . EWSL, том 482 из Lecture Notes in Computer Science, стр. 361-374. Springer, (1991)Classification and syntax of constraints in binary semantical networks.. Inf. Syst., 15 (5): 497-513 (1990)The Equivalence of the Subsumption Theorem and the Refutation-Completeness for Unconstrained Resolution., и . ASIAN, том 1023 из Lecture Notes in Computer Science, стр. 269-285. Springer, (1995)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)