MaLARea SG1 - Machine Learner for Automated Reasoning with Semantic Guidance
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Semantic subtyping with an SMT solver
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Generating counterexamples for structural inductions by exploiting nonstandard models
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Automated proof compression by invention of new definitions
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
MaLeCoP: machine learning connection prover
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Extending Sledgehammer with SMT solvers
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Sort it out with monotonicity: translating between many-sorted and unsorted first-order logic
CADE'11 Proceedings of the 23rd international conference on Automated deduction
A foundational view on integration problems
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Validating QBF validity in HOL4
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Proving valid quantified Boolean formulas in HOL light
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Automatic proof and disproof in Isabelle/HOL
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Expressing polymorphic types in a many-sorted language
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
A polymorphic intermediate verification language: design and logical encoding
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Validating QBF invalidity in HOL4
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
The CADE-23 Automated Theorem Proving System Competition - CASC-23
AI Communications
Encoding monomorphic and polymorphic types
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Automated reasoning service for HOL light
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Logical relations for a logical framework
ACM Transactions on Computational Logic (TOCL)
Premise Selection for Mathematics by Corpus Analysis and Kernel Methods
Journal of Automated Reasoning
| Hi-index | 0.00 |
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. To integrate interactive provers with automatic ones, one must translate higher-order formulas to first-order form. The translation should ideally be both sound and practical. We have investigated several methods of translating function applications, types, and 驴-abstractions. Omitting some type information improves the success rate but can be unsound, so the interactive prover must verify the proofs. This paper presents experimental data that compares the translations in respect of their success rates for three automatic provers.