( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Tutorial Notes: Reasoning about Logic Programs.

. Logic Programming Summer School, том 636 из Lecture Notes in Computer Science, стр. 252-277. 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.

Franz Bundy

Bogáta Dóra Bundy

Safwat Alani

Maia Alandjiyska

Yilmaz Alan

 

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

A Proposal for Automating Diagrammatic Reasoning in Continuous Domains., , и . Diagrams, том 1889 из Lecture Notes in Computer Science, стр. 286-299. Springer, (2000)Psychological Validity of Schematic Proofs., и . Mechanizing Mathematical Reasoning, том 2605 из Lecture Notes in Computer Science, стр. 321-341. Springer, (2005)A Framework for the Flexible Integration of a Class of Decision Procedures into Theorem Provers., , и . CADE, том 1632 из Lecture Notes in Computer Science, стр. 127-141. Springer, (1999)Meta-Level Inference and Program Verification., и . CADE, том 138 из Lecture Notes in Computer Science, стр. 144-150. Springer, (1982)The Use of Proof Plans to Sum Series., , и . CADE, том 607 из Lecture Notes in Computer Science, стр. 325-339. Springer, (1992)Dr.Doodle: A Diagrammatic Theorem Prover., , и . IJCAR, том 3097 из Lecture Notes in Computer Science, стр. 331-335. Springer, (2004)Tutorial Notes: Reasoning about Logic Programs.. Logic Programming Summer School, том 636 из Lecture Notes in Computer Science, стр. 252-277. Springer, (1992)A Single-Significant-Digit Calculus for Semi-Automated Guesstimation., , , и . IJCAR, том 6173 из Lecture Notes in Computer Science, стр. 354-368. Springer, (2010)Automatic Concept Formation in Pure Mathematics., , и . IJCAI, стр. 786-793. Morgan Kaufmann, (1999)Analysing Mathematical Proofs (Or Reading Between the Lines).. IJCAI, стр. 22-28. (1975)