Author:Geoff Sutcliffe

Publications
GCAI 2020. 6th Global Conference on Artificial Intelligence (GCAI 2020) Gregoire Danoy, Jun Pang and Geoff Sutcliffe (editors) EPiC Series in Computing, volume 72
LPAR-22 Workshop and Short Paper Proceedings Gilles Barthe, Konstantin Korovin, Stephan Schulz, Martin Suda, Geoff Sutcliffe and Margus Veanes (editors) Kalpa Publications in Computing, volume 9
LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning Gilles Barthe, Geoff Sutcliffe and Margus Veanes (editors) EPiC Series in Computing, volume 57
Automated Theorem Proving by Translation to Description Logic Negin Arhami and Geoff Sutcliffe EasyChair Preprint no. 126
IWIL Workshop and LPAR Short Presentations Thomas Eiter, David Sands, Geoff Sutcliffe and Andrei Voronkov (editors) Kalpa Publications in Computing, volume 1
GCAI 2016. 2nd Global Conference on Artificial Intelligence Christoph Benzmüller, Geoff Sutcliffe and Raul Rojas (editors) EPiC Series in Computing, volume 41
The Thousands of Models for Theorem Provers (TMTP) Model Library - First Steps Geoff Sutcliffe and Stephan Schulz In:IWIL-2015. 11th International Workshop on the Implementation of Logics
Things You Can't do With a Vampire Geoff Sutcliffe In:Proceedings of the 1st and 2nd Vampire Workshops
GCAI 2015. Global Conference on Artificial Intelligence Georg Gottlob, Geoff Sutcliffe and Andrei Voronkov (editors) EPiC Series in Computing, volume 36
LPAR-20. 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning - Short Presentations Ansgar Fehnker, Annabelle McIver, Geoff Sutcliffe and Andrei Voronkov (editors) EPiC Series in Computing, volume 35
Automated Theorem Proving by Translation to Description Logic Negin Arhami and Geoff Sutcliffe In:LPAR-20. 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning - Short Presentations
The Efficiency of Automated Theorem Proving by Translation to Less Expressive Logics Negin Arhami and Geoff Sutcliffe In:PAAR-2014. 4th Workshop on Practical Aspects of Automated Reasoning
Automated Theorem Proving using the TPTP Process Instruction Language Muhammad Nassar and Geoff Sutcliffe In:PAAR-2014. 4th Workshop on Practical Aspects of Automated Reasoning
LPAR-19. 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning Kenneth L. McMillan, Aart Middeldorp, Geoff Sutcliffe and Andrei Voronkov (editors) EPiC Series in Computing, volume 26
LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning. Andrei Voronkov, Geoff Sutcliffe, Matthias Baaz and Christian Fermüller (editors) EPiC Series in Computing, volume 13
CASC-J6. The 6th IJCAR ATP System Competition Geoff Sutcliffe (editors) EPiC Series in Computing, volume 11
Proceedings of the 6th IJCAR ATP System Competition (CASC-J6) Geoff Sutcliffe In:CASC-J6. The 6th IJCAR ATP System Competition
Using the TPTP Language for Representing Derivations in Tableau and Connection Calculi Jens Otten and Geoff Sutcliffe In:PAAR-2010: Proceedings of the 2nd Workshop on Practical Aspects of Automated Reasoning
EMSQMS 2010. Workshop on Evaluation Methods for Solvers, and Quality Metrics for Solutions Aaron Stump, Geoff Sutcliffe and Cesare Tinelli (editors) EPiC Series in Computing, volume 6
Different Proofs are Good Proofs Geoff Sutcliffe, Cynthia Chang, Li Ding, Deborah McGuinness and Paulo Pinheiro In:EMSQMS 2010. Workshop on Evaluation Methods for Solvers, and Quality Metrics for Solutions
IWIL 2010. The 8th International Workshop on the Implementation of Logics Geoff Sutcliffe, Stephan Schulz and Eugenia Ternovska (editors) EPiC Series in Computing, volume 2

Keyphrases

automated theorem proving², automated theorem proving process, connection calculus, Description Logics, difference, EPR, first-order logic, interpretation, logics², model, proof, Quality, tableau calculus, theorem proving³, TPTP³, TPTP language, TPTP Process Instruction language, translation², Vampire.