Access the full text.
Sign up today, get DeepDyve free for 14 days.
(2006)
Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, 4130
J. Urban (2006)
Momm - Fast Interreduction and Retrieval in Large Libraries of Formalized MathematicsInt. J. Artif. Intell. Tools, 15
J. Carette, David Aspinall, Christoph Lange (2013)
Intelligent Computer Mathematics: MKM, Calculemus, DML, and Systems and Projects 2013, Held as Part of CICM 2013, Bath, UK, July 8-12, 2013, Proceedings
A. Riazanov, A. Voronkov (2002)
The design and implementation of VAMPIREAI Commun., 15
C. Kaliszyk, J. Urban (2013)
Automated Reasoning Service for HOL Light
R. Petit (1980)
A Tutorial Introduction, 22
L. Kovács, Andrei Voronkov (2013)
First-Order Theorem Proving and Vampire
M. Gordon, T. Melham (1993)
Introduction to HOL: a theorem proving environment for higher order logic
D.P. Murphy, C.J. Merz (1992)
Automated reasoningIEEE Potentials, 11
J. Blanchette, A. Paskevich (2013)
TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism
Krystof Hoder, A. Voronkov (2011)
Sine Qua Non for Large Theory Reasoning
M. Bonacina (2013)
Automated Deduction -- CADE-24: 24th International Conference on Automated Deduction, Lake Placid, NY, USA, June 9-14, 2013, Proceedings
V. Vinge (1992)
A Fire Upon the Deep
Lawrence Paulson, J. Blanchette (2012)
Three years of experience with Sledgehammer, a Practical Link Between Automatic and Interactive Theorem Provers
J. Alama, K. Brink, L. Mamane, J. Urban (2011)
Calculemus/MKM, volume 6824 of LNCS
C. Kaliszyk, J. Urban (2013)
Lemma Mining over HOL Light
J. Urban, G. Sutcliffe, P. Pudlák, J. Vyskočil (2008)
MaLARea SG1- Machine Learner for Automated Reasoning with Semantic Guidance
C. Kaliszyk, Alexander Krauss (2013)
Scalable LCF-Style Proof Translation
(1999)
The SNoW Learning Architecture. Technical Report UIUCDCS-R-99-2101
Jia Meng, Lawrence Paulson (2007)
Translating Higher-Order Clauses to First-Order ClausesJournal of Automated Reasoning, 40
A. Gelder, G. Sutcliffe (2006)
Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation
J. Urban (2013)
BliStr: The Blind Strategymaker
C. Tankink, C. Kaliszyk, J. Urban, H. Geuvers (2013)
Formal Mathematics on Display: A Wiki for Flyspeck
L. Moura, Nikolaj Bjørner (2008)
Z3: An Efficient SMT Solver
J. Harrison (1996)
HOL Light: A Tutorial Introduction
The proof-dependency data extracted in the content encoding from all projects are copied to a special “common” directory
C. Kaliszyk, J. Urban (2013)
MizAR 40 for Mizar 40Journal of Automated Reasoning, 55
L. Worden (2012)
WorkingWiki: a MediaWiki-based platform for collaborative research
each of such “already known” theorems T in P
Whenever a project P is started or modified, we find the intersection of the content-encoded names of the project’s theorems with such names that already exist in other projects/versions
C. Kaliszyk (2007)
Web Interfaces for Proof Assistants
(2011)
Large formal wikis: Issues and solutions
C. Kaliszyk, J. Urban (2013)
PRocH: Proof Reconstruction for HOL Light
C. Kaliszyk, J. Urban (2012)
Learning-Assisted Automated Reasoning with FlyspeckJournal of Automated Reasoning, 53
C. Kaliszyk, F. Wiedijk, Maxim Hendriks, F. Raamsdonk (2007)
Teaching logic using a state-of-the-art proof assistant
L.M. de Moura, N. Bjørner (2008)
TACAS, volume 4963 of LNCS
H. John (1996)
FMCAD, volume 1166 of LNCS
J. Urban (2012)
Parallelizing MizarArXiv, abs/1206.0141
J. Harrison (1996)
Optimizing Proof Search in Model Elimination
G. Sutcliffe, S. Schulz, Koen Claessen, A. Gelder (2006)
Using the TPTP Language for Writing Derivations and Finite Interpretations
K. Hoder, A. Voronkov (2011)
CADE, volume 6803 of LNCS
Jesse Alama, T. Heskes, D. Kühlwein, Evgeni Tsivtsivadze, J. Urban (2011)
Premise Selection for Mathematics by Corpus Analysis and Kernel MethodsJournal of Automated Reasoning, 52
J. Urban, G. Sutcliffe (2010)
Automated reasoning and presentation support for formalizing mathematics in MizarArXiv, abs/1005.4592
(1993)
The HOL logic
S. Schulz (2002)
E - a brainiac theorem proverAI Commun., 15
J. Urban, J. Vyskočil, P. Štěpánek (2011)
MaLeCoP Machine Learning Connection Prover
D. Kühlwein, T. Laarhoven, Evgeni Tsivtsivadze, J. Urban, T. Heskes (2012)
Overview and Evaluation of Premise Selection Techniques for Large Theory Mathematics
Sahibsingh Dudani (1976)
The Distance-Weighted k-Nearest-Neighbor RuleIEEE Transactions on Systems, Man, and Cybernetics, SMC-6
Lawrence Paulson, Kong Susanto (2007)
Source-Level Proof Reconstruction for Interactive Theorem Proving
J. Urban, P. Rudnicki, G. Sutcliffe (2011)
ATP and Presentation Service for Mizar FormalizationsJournal of Automated Reasoning, 50
D. Kühlwein, T. van Laarhoven, E. Tsivtsivadze, J. Urban, T. Heskes (2012)
IJCAR, volume 7364 of LNCS
(1999)
Leonardo Mendonça de Moura and Nikolaj Bjørner . Z 3 : An Efficient SMT Solver
Behzad Akbarpour, Lawrence Paulson (2010)
MetiTarski: An Automatic Theorem Prover for Real-Valued Special FunctionsJournal of Automated Reasoning, 44
J. Urban (2011)
An Overview of Methods for Large-Theory Automated Theorem Proving
Hales . Introduction to the Flyspeck project . In Thierry Coquand , Henri Lombardi , and Marie - Françoise Roy , editors ,
L.C. Paulson, K.W. Susanto (2007)
TPHOLs, volume 4732 of LNCS
T. Hales (2005)
Introduction to the Flyspeck Project
J. Blanchette, S. Böhme, A. Popescu, Nicholas Smallbone (2013)
Encoding Monomorphic and Polymorphic Types
C. Kaliszyk, J. Urban (2013)
Stronger Automation for Flyspeck by Feature Weighting and Strategy Evolution
J. Urban (2011)
Content-based encoding of mathematical and code libraries
HOL(y)Hammer is an online AI/ATP service for formal (computer-understandable) mathematics encoded in the HOL Light system. The service allows its users to upload and automatically process an arbitrary formal development (project) based on HOL Light, and to attack arbitrary conjectures that use the concepts defined in some of the uploaded projects. For that, the service uses several automated reasoning systems combined with several premise selection methods trained on all the project proofs. The projects that are readily available on the server for such query answering include the recent versions of the Flyspeck, Multivariate Analysis and Complex Analysis libraries. The service runs on a 48-CPU server, currently employing in parallel for each task 7 AI/ATP combinations and 4 decision procedures that contribute to its overall performance. The system is also available for local installation by interested users, who can customize it for their own proof development. An Emacs interface allowing parallel asynchronous queries to the service is also provided. The overall structure of the service is outlined, problems that arise and their solutions are discussed, and an initial account of using the system is given.
Mathematics in Computer Science – Springer Journals
Published: Jun 28, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.