( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Conditional Term Rewriting and First-Order Theorem Proving.

, , , и . CTRS, том 656 из Lecture Notes in Computer Science, стр. 257-271. Springer, (1992)

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.

lin A David

David A Traill

David A Wuttke

David A Lazica

David A M Goslings

 

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

General Algorithms for Permutations in Equational Inference., и . J. Autom. Reason., 26 (3): 223-268 (2001)CLIN-S - A Semantically Guided First-Order Theorem Prover., и . J. Autom. Reason., 18 (2): 183-188 (1997)A Logic for Conditional Term Rewriting Systems.. CTRS, том 308 из Lecture Notes in Computer Science, стр. 212-227. Springer, (1987)An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time., , , , и . J. ACM, 40 (1): 1-16 (1993)Properties and Extensions of Alternating Path Relevance - I.. CoRR, (2019)The Illinois Prover: A General Purpose Resolution Theorem Prover., и . CADE, том 230 из Lecture Notes in Computer Science, стр. 685-687. Springer, (1986)A Simple Non-Termination Test for the Knuth-Bendix Method.. CADE, том 230 из Lecture Notes in Computer Science, стр. 79-88. Springer, (1986)Associative-Commutative Rewriting., , , и . IJCAI, стр. 940-944. William Kaufmann, (1983)Rewriting., и . Handbook of Automated Reasoning, Elsevier and MIT Press, (2001)Logic Programming cum Applicative Programming., и . SLP, стр. 54-66. IEEE-CS, (1985)