default search action
Graham Wrightson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1997
- [b2]Andreas Furche, Graham Wrightson:
Computer Money - Zahlungssysteme im Internet. dpunkt 1997, ISBN 978-3-920993-55-3, pp. I-X, 1-126 - 1996
- [b1]Andreas Furche, Graham Wrightson:
Computer money - a systematic overview of electronic payment systems. dpunkt 1996, ISBN 978-3-920993-54-6, pp. I-XII, 1-108
Journal Articles
- 2006
- [j8]Michael R. Fellows, Stefan Szeider, Graham Wrightson:
On finding short resolution refutations and small unsatisfiable subsets. Theor. Comput. Sci. 351(3): 351-359 (2006) - 2002
- [j7]Jörg H. Siekmann, Graham Wrightson:
An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure. Log. J. IGPL 10(1): 85-103 (2002) - 2001
- [j6]Jörg H. Siekmann, Graham Wrightson:
Erratum: a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution. J. ACM 48(1): 145-147 (2001) - 1998
- [j5]Jo Coldwell, Graham Wrightson:
Analytic Tableaux and Model Elimination. Aust. Comput. J. 30(1): 1-11 (1998) - 1995
- [j4]Kevin Wallace, Graham Wrightson:
Regressive Merging in Model Elimination Tableau-Based Theorem Provers. Log. J. IGPL 3(6): 921-937 (1995) - 1992
- [j3]Graham Wrightson, Jo Coldwell:
A Truncation Technique for Clausal Analytic Tableaux. Inf. Process. Lett. 42(5): 271-281 (1992) - 1985
- [j2]Graham Wrightson:
Nonclassical Logic Theorem Proving. J. Autom. Reason. 1(1): 35-37 (1985) - 1980
- [j1]Jörg H. Siekmann, Graham Wrightson:
Paramodulated Connection Graphs. Acta Informatica 13: 67-86 (1980)
Conference and Workshop Papers
- 2004
- [c9]Michael R. Fellows, Stefan Szeider, Graham Wrightson:
On Finding Short Resolution Refutations and Small Unsatisfiable Subsets. IWPEC 2004: 223-234 - 2002
- [c8]Jörg H. Siekmann, Graham Wrightson:
An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure. Computational Logic: Logic Programming and Beyond 2002: 231-252 - 2000
- [c7]Bruce Davies, Graham Wrightson:
An approach to strategies in concurrent systems. CATS 2000: 33 - 1997
- [c6]Ljiljana Brankovic, Peter Horák, Mirka Miller, Graham Wrightson:
Usability of Compromise-Free Statistical Databases. SSDBM 1997: 144-154 - 1992
- [c5]Graham Wrightson:
Research into Analytic Tableaux. TABLEAUX 1992: 85-87 - 1984
- [c4]Hans Jürgen Ohlbach, Graham Wrightson:
Solving a Problem in Relevance Logic with an Automated Theorem Prover. CADE 1984: 496-508 - 1980
- [c3]Graham Wrightson:
On the Treatment of Equivalence Connectives in Automated Theorem Proving. GI Jahrestagung 1980: 428 - 1978
- [c2]Norbert Eisinger, Jörg H. Siekmann, Graham Wrightson:
Paramodulated Connection Graphs. AISB/GI (ECAI) 1978: 105-109 - 1974
- [c1]Rudolf Peschke, Graham Wrightson:
Ein methodisch-didaktisches Konzept für Simulationsprogramme im RGU. RGU 1974: 63-71
Editorship
- 1992
- [e1]Bertram Fronhöfer, Graham Wrightson:
Parallelization in Inference Systems, International Workshop, Dagstuhl Castle, Germany, December 17-18, 1990, Proceedings. Lecture Notes in Computer Science 590, Springer 1992, ISBN 3-540-55425-4 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint