Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Graham Wrightson
@article{DBLP:journals/tcs/FellowsSW06, author = {Michael R. Fellows and Stefan Szeider and Graham Wrightson}, title = {On finding short resolution refutations and small unsatisfiable subsets}, journal = {Theor. Comput. Sci.}, volume = {351}, number = {3}, pages = {351--359}, year = {2006}, url = {https://doi.org/10.1016/j.tcs.2005.10.005}, doi = {10.1016/J.TCS.2005.10.005}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/FellowsSW06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/FellowsSW04, author = {Michael R. Fellows and Stefan Szeider and Graham Wrightson}, editor = {Rodney G. Downey and Michael R. Fellows and Frank K. H. A. Dehne}, title = {On Finding Short Resolution Refutations and Small Unsatisfiable Subsets}, booktitle = {Parameterized and Exact Computation, First International Workshop, {IWPEC} 2004, Bergen, Norway, September 14-17, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3162}, pages = {223--234}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-28639-4\_20}, doi = {10.1007/978-3-540-28639-4\_20}, timestamp = {Tue, 14 May 2019 10:00:45 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/FellowsSW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/igpl/SiekmannW02, author = {J{\"{o}}rg H. Siekmann and Graham Wrightson}, title = {An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure}, journal = {Log. J. {IGPL}}, volume = {10}, number = {1}, pages = {85--103}, year = {2002}, url = {https://doi.org/10.1093/jigpal/10.1.85}, doi = {10.1093/JIGPAL/10.1.85}, timestamp = {Fri, 06 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/igpl/SiekmannW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/birthday/SiekmannW02, author = {J{\"{o}}rg H. Siekmann and Graham Wrightson}, editor = {Antonis C. Kakas and Fariba Sadri}, title = {An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure}, booktitle = {Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {2408}, pages = {231--252}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45632-5\_10}, doi = {10.1007/3-540-45632-5\_10}, timestamp = {Tue, 14 May 2019 10:00:52 +0200}, biburl = {https://dblp.org/rec/conf/birthday/SiekmannW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/SiekmannW01, author = {J{\"{o}}rg H. Siekmann and Graham Wrightson}, title = {Erratum: a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution}, journal = {J. {ACM}}, volume = {48}, number = {1}, pages = {145--147}, year = {2001}, url = {https://doi.org/10.1145/363647.363697}, doi = {10.1145/363647.363697}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/SiekmannW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:journals/tcs/DaviesW00, author = {Bruce Davies and Graham Wrightson}, editor = {David A. Wolfram}, title = {An approach to strategies in concurrent systems}, booktitle = {Computing: the Australasian Theory Symposium, {CATS} 2000, Canberra, Australia, January 1-2, 2000}, series = {Electronic Notes in Theoretical Computer Science}, volume = {31}, pages = {33}, publisher = {Elsevier}, year = {2000}, url = {https://doi.org/10.1016/S1571-0661(05)80328-7}, doi = {10.1016/S1571-0661(05)80328-7}, timestamp = {Fri, 11 Nov 2022 16:02:13 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DaviesW00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acj/ColdwellW98, author = {Jo Coldwell and Graham Wrightson}, title = {Analytic Tableaux and Model Elimination}, journal = {Aust. Comput. J.}, volume = {30}, number = {1}, pages = {1--11}, year = {1998}, timestamp = {Tue, 19 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acj/ColdwellW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/daglib/0085259, author = {Andreas Furche and Graham Wrightson}, title = {Computer Money - Zahlungssysteme im Internet}, publisher = {dpunkt}, year = {1997}, isbn = {978-3-920993-55-3}, timestamp = {Tue, 12 Apr 2011 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/daglib/0085259.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ssdbm/BrankovicNM97, author = {Ljiljana Brankovic and Peter Hor{\'{a}}k and Mirka Miller and Graham Wrightson}, editor = {Yannis E. Ioannidis and David Marshall Hansen}, title = {Usability of Compromise-Free Statistical Databases}, booktitle = {Ninth International Conference on Scientific and Statistical Database Management, Proceedings, August 11-13, 1997, Olympia, Washington, {USA}}, pages = {144--154}, publisher = {{IEEE} Computer Society}, year = {1997}, url = {https://doi.org/10.1109/SSDM.1997.621177}, doi = {10.1109/SSDM.1997.621177}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ssdbm/BrankovicNM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/daglib/0085349, author = {Andreas Furche and Graham Wrightson}, title = {Computer money - a systematic overview of electronic payment systems}, publisher = {dpunkt}, year = {1996}, isbn = {978-3-920993-54-6}, timestamp = {Wed, 27 Apr 2011 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/daglib/0085349.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/igpl/WallaceW95, author = {Kevin Wallace and Graham Wrightson}, title = {Regressive Merging in Model Elimination Tableau-Based Theorem Provers}, journal = {Log. J. {IGPL}}, volume = {3}, number = {6}, pages = {921--937}, year = {1995}, url = {https://doi.org/10.1093/jigpal/3.6.921}, doi = {10.1093/JIGPAL/3.6.921}, timestamp = {Fri, 06 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/igpl/WallaceW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/WrightsonC92, author = {Graham Wrightson and Jo Coldwell}, title = {A Truncation Technique for Clausal Analytic Tableaux}, journal = {Inf. Process. Lett.}, volume = {42}, number = {5}, pages = {271--281}, year = {1992}, url = {https://doi.org/10.1016/0020-0190(92)90036-U}, doi = {10.1016/0020-0190(92)90036-U}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/WrightsonC92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tableaux/Wrightson92, author = {Graham Wrightson}, editor = {Bertram Fronh{\"{o}}fer and Reiner H{\"{a}}hnle and Thomas K{\"{a}}ufl}, title = {Research into Analytic Tableaux}, booktitle = {Workshop Theorem Proving with Analytic Tableaux and Related Methods, Lautenbach. Universit{\"{a}}t Karlsruhe, Fakult{\"{a}}t f{\"{u}}r Informatik, Institut f{\"{u}}r Logik, Komplexit{\"{a}}t und Deduktionssysteme, Interner Bericht 8/92, March 18-20, 1992}, pages = {85--87}, year = {1992}, timestamp = {Tue, 15 May 2012 18:19:31 +0200}, biburl = {https://dblp.org/rec/conf/tableaux/Wrightson92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/dagstuhl/1990pis, editor = {Bertram Fronh{\"{o}}fer and Graham Wrightson}, title = {Parallelization in Inference Systems, International Workshop, Dagstuhl Castle, Germany, December 17-18, 1990, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {590}, publisher = {Springer}, year = {1992}, url = {https://doi.org/10.1007/3-540-55425-4}, doi = {10.1007/3-540-55425-4}, isbn = {3-540-55425-4}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/1990pis.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jar/Wrightson85, author = {Graham Wrightson}, title = {Nonclassical Logic Theorem Proving}, journal = {J. Autom. Reason.}, volume = {1}, number = {1}, pages = {35--37}, year = {1985}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jar/Wrightson85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cade/OhlbachW84, author = {Hans J{\"{u}}rgen Ohlbach and Graham Wrightson}, editor = {Robert E. Shostak}, title = {Solving a Problem in Relevance Logic with an Automated Theorem Prover}, booktitle = {7th International Conference on Automated Deduction, Napa, California, USA, May 14-16, 1984, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {170}, pages = {496--508}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/978-0-387-34768-4\_29}, doi = {10.1007/978-0-387-34768-4\_29}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/cade/OhlbachW84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/SieckmannW80, author = {J{\"{o}}rg H. Siekmann and Graham Wrightson}, title = {Paramodulated Connection Graphs}, journal = {Acta Informatica}, volume = {13}, pages = {67--86}, year = {1980}, url = {https://doi.org/10.1007/BF00288537}, doi = {10.1007/BF00288537}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/SieckmannW80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gi/Wrightson80, author = {Graham Wrightson}, editor = {Reinhard Wilhelm}, title = {On the Treatment of Equivalence Connectives in Automated Theorem Proving}, booktitle = {{GI} - 10. Jahrestagung, Saarbr{\"{u}}cken, 30. September - 2. Oktober 1980, Proceedings}, series = {Informatik-Fachberichte}, volume = {33}, pages = {428}, publisher = {Springer}, year = {1980}, url = {https://doi.org/10.1007/978-3-642-67838-7\_39}, doi = {10.1007/978-3-642-67838-7\_39}, timestamp = {Tue, 23 May 2017 01:10:33 +0200}, biburl = {https://dblp.org/rec/conf/gi/Wrightson80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ecai/EisingerSW78, author = {Norbert Eisinger and J{\"{o}}rg H. Siekmann and Graham Wrightson}, editor = {Derek H. Sleeman}, title = {Paramodulated Connection Graphs}, booktitle = {Proceedings of {AISB/GI} Conference (Proceedings of the 4th European Conference on Artificial Intelligence), Hamburg, Germany, 18-20 July 1978}, pages = {105--109}, publisher = {Leeds University}, year = {1978}, timestamp = {Fri, 26 Jul 2019 09:34:22 +0200}, biburl = {https://dblp.org/rec/conf/ecai/EisingerSW78.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/rgu/PeschkeW74, author = {Rudolf Peschke and Graham Wrightson}, editor = {Klaus Brunnstein and Klaus Haefner and Wolfgang H{\"{a}}ndler}, title = {Ein methodisch-didaktisches Konzept f{\"{u}}r Simulationsprogramme im {RGU}}, booktitle = {Rechner-Gest{\"{u}}tzter Unterricht, {RGU} '74, Fachtagung, Hamburg, 12.-14. August 1974, ACU-Arbeitskreis Rechner-Gest{\"{u}}tzter Unterricht}, series = {Lecture Notes in Computer Science}, volume = {17}, pages = {63--71}, publisher = {Springer}, year = {1974}, url = {https://doi.org/10.1007/3-540-06907-0\_60}, doi = {10.1007/3-540-06907-0\_60}, timestamp = {Tue, 14 May 2019 10:00:38 +0200}, biburl = {https://dblp.org/rec/conf/rgu/PeschkeW74.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.