The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Graham Wrightson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jörg H. Siekmann, Graham Wrightson
    An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure. [Citation Graph (0, 0)][DBLP]
    Computational Logic: Logic Programming and Beyond, 2002, pp:231-252 [Conf]
  2. Hans Jürgen Ohlbach, Graham Wrightson
    Solving a Problem in Relevance Logic with an Automated Theorem Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1984, pp:496-508 [Conf]
  3. Norbert Eisinger, Jörg H. Siekmann, Graham Wrightson
    Paramodulated Connection Graphs. [Citation Graph (0, 0)][DBLP]
    AISB/GI (ECAI), 1978, pp:105-109 [Conf]
  4. Graham Wrightson
    On the Treatment of Equivalence Connectives in Automated Theorem Proving. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1980, pp:428- [Conf]
  5. Michael R. Fellows, Stefan Szeider, Graham Wrightson
    On Finding Short Resolution Refutations and Small Unsatisfiable Subsets. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:223-234 [Conf]
  6. Rudolf Peschke, Graham Wrightson
    Ein methodisch-didaktisches Konzept für Simulationsprogramme im RGU. [Citation Graph (0, 0)][DBLP]
    RGU, 1974, pp:63-71 [Conf]
  7. Ljiljana Brankovic, Peter Norak, Mirka Miller, Graham Wrightson
    Usability of Compromise-Free Statistical Databases [Citation Graph (0, 5)][DBLP]
    SSDBM, 1997, pp:144-154 [Conf]
  8. Graham Wrightson
    Research into Analytic Tableaux. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1992, pp:85-87 [Conf]
  9. Jo Coldwell, Graham Wrightson
    Analytic Tableaux and Model Elimination. [Citation Graph (0, 0)][DBLP]
    Australian Computer Journal, 1998, v:30, n:1, pp:1-11 [Journal]
  10. Jörg H. Siekmann, Graham Wrightson
    Paramodulated Connection Graphs. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1980, v:13, n:, pp:67-86 [Journal]
  11. Jörg H. Siekmann, Graham Wrightson
    An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2002, v:10, n:1, pp:85-103 [Journal]
  12. Graham Wrightson, Jo Coldwell
    A Truncation Technique for Clausal Analytic Tableaux. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:5, pp:271-281 [Journal]
  13. Jörg H. Siekmann, Graham Wrightson
    Erratum: a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:1, pp:145-147 [Journal]
  14. Graham Wrightson
    Nonclassical Logic Theorem Proving. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1985, v:1, n:1, pp:35-37 [Journal]
  15. Bruce Davies, Graham Wrightson
    An approach to strategies in concurrent systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:31, n:, pp:- [Journal]
  16. Michael R. Fellows, Stefan Szeider, Graham Wrightson
    On finding short resolution refutations and small unsatisfiable subsets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:3, pp:351-359 [Journal]

Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002