Ein methodisch-didaktisches Konzept für Simulationsprogramme im RGU. - Rudolf Peschke; Graham Wrightson (RGU, 1974)

Paramodulated Connection Graphs. - Norbert Eisinger; Jörg H. Siekmann; Graham Wrightson (AISB/GI (ECAI), 1978)

On the Treatment of Equivalence Connectives in Automated Theorem Proving. - Graham Wrightson (GI Jahrestagung, 1980)

Paramodulated Connection Graphs. - Jörg H. Siekmann; Graham Wrightson (Acta Informatica, 1980)

Solving a Problem in Relevance Logic with an Automated Theorem Prover. - Hans Jürgen Ohlbach; Graham Wrightson (CADE, 1984)

Nonclassical Logic Theorem Proving. - Graham Wrightson (J. Autom. Reason., 1985)

Research into Analytic Tableaux. - Graham Wrightson (TABLEAUX, 1992)

A Truncation Technique for Clausal Analytic Tableaux. - Graham Wrightson; Jo Coldwell (Inf. Process. Lett., 1992)

Regressive Merging in Model Elimination Tableau-Based Theorem Provers. - Kevin Wallace; Graham Wrightson (Log. J. IGPL, 1995)

Computer money - a systematic overview of electronic payment systems. - Andreas Furche; Graham Wrightson (dpunkt, 1996)

Computer Money - Zahlungssysteme im Internet. - Andreas Furche; Graham Wrightson (dpunkt, 1997)

Usability of Compromise-Free Statistical Databases - Ljiljana Brankovic; Peter Horák; Mirka Miller; Graham Wrightson (SSDBM, 1997)

Analytic Tableaux and Model Elimination. - Jo Coldwell; Graham Wrightson (Aust. Comput. J., 1998)

An approach to strategies in concurrent systems. - Bruce Davies; Graham Wrightson (CATS, 2000)

Erratum: a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution. - Jörg H. Siekmann; Graham Wrightson (J. ACM, 2001)

An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure. - Jörg H. Siekmann; Graham Wrightson (Log. J. IGPL, 2002)

On finding short resolution refutations and small unsatisfiable subsets. - Michael R. Fellows; Stefan Szeider; Graham Wrightson (Theor. Comput. Sci., 2006)