( en | de | ru )

 

Disambiguation of "Wrightson, Graham"

Author of the publication

copydeleteadd this publication to your clipboard
Paramodulated Connection Graphs.

, , and . AISB/GI (ECAI), page 105-109. Leeds University, (1978)

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.

Graham Wade

Graham Frost

Noah Graham

Robert Graham

Graham Tebb

 

Other publications of authors with the same name

On the Treatment of Equivalence Connectives in Automated Theorem Proving.. GI Jahrestagung, volume 33 of Informatik-Fachberichte, page 428. Springer, (1980)Regressive Merging in Model Elimination Tableau-Based Theorem Provers., and . Logic Journal of the IGPL, 3 (6): 921-937 (1995)Computer money, and . dpunkt-Verl., Heidelberg, 1. Aufl edition, (1997)An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure., and . Computational Logic: Logic Programming and Beyond, volume 2408 of Lecture Notes in Computer Science, page 231-252. Springer, (2002)On finding short resolution refutations and small unsatisfiable subsets., , and . Theor. Comput. Sci., 351 (3): 351-359 (2006)Nonclassical Logic Theorem Proving.. J. Autom. Reason., 1 (1): 35-37 (1985)A Truncation Technique for Clausal Analytic Tableaux., and . Inf. Process. Lett., 42 (5): 271-281 (1992)Paramodulated Connection Graphs., , and . AISB/GI (ECAI), page 105-109. Leeds University, (1978)Ein methodisch-didaktisches Konzept für Simulationsprogramme im RGU., and . RGU, volume 17 of Lecture Notes in Computer Science, page 63-71. Springer, (1974)On Finding Short Resolution Refutations and Small Unsatisfiable Subsets., , and . IWPEC, volume 3162 of Lecture Notes in Computer Science, page 223-234. Springer, (2004)