Extending a brainiac prover to lambda-free higher-order logic

@article{Vukmirovic2019ExtendingAB,
  title={Extending a brainiac prover to lambda-free higher-order logic},
  author={Petar Vukmirovic and Jasmin Christian Blanchette and Simon Cruanes and Stephan Schulz},
  journal={International Journal on Software Tools for Technology Transfer},
  year={2019},
  volume={24},
  pages={67-87}
}
Decades of work have gone into developing efficient proof calculi, data structures, algorithms, and heuristics for first-order automatic theorem proving. Higher-order provers lag behind in terms of efficiency. Instead of developing a new higher-order prover from the ground up, we propose to start with the state-of-the-art superposition prover E and gradually enrich it with higher-order features. We explain how to extend the prover’s data structures, algorithms, and heuristics to $$\lambda… 
Superposition for Lambda-Free Higher-Order Logic
TLDR
Refutationally complete superposition calculi for intentional and extensional \(\lambda \)-free higher-order logic, two formalisms that allow partial application and applied variables, appear promising as a stepping stone towards complete, efficient automatic theorem provers for full higher- order logic.
Extending a High-Performance Prover to Higher-Order Logic
TLDR
This work extends E to full higher-order logic, and finds the resulting prover is the strongest one on benchmarks coming from a proof assistant, and the second strongest on TPTP benchmarks.
Extensional Higher-Order Paramodulation in Leo-III
TLDR
Leo-III is an automated theorem prover for extensional type theory with Henkin semantics and choice that supports reasoning in polymorphic first-order and higher-order logic, in all normal quantified modal logics, as well as in different deontic logics.
Restricted Combinatory Unification
TLDR
A restricted version of Dougherty's algorithm that is incomplete, terminating and does not require polymorphism is presented, including a novel use of a substitution tree as a filtering index for higher-order unification.
Formalizing the metatheory of logical calculi and automatic provers in Isabelle/HOL (invited talk)
TLDR
This paper describes and reflects on three verification subprojects to which I contributed: a first-order resolution prover, an imperative SAT solver, and generalized term orders for λ-free higher-order logic.
Making Higher-Order Superposition Work
TLDR
Techniques that address issues such as infinitely branching inference rules, new possibilities such as reasoning about formulas, and the need to curb the explosion of specific higher-order rules are described and extensively evaluated in the Zipperposition theorem prover.
New Techniques for Higher-Order Superposition
TLDR
Techniques that address the need for new heuristics to curb the explosion of specific higher-order rules in the Zipperposition theorem prover are described.
Superposition with First-class Booleans and Inprocessing Clausification
TLDR
A complete superposition calculus for first-order logic with an interpreted Boolean type to lay the foundation for refutationally complete calculi in more expressive logics with Booleans, and to make superposition work efficiently on problems that would be obfuscated when using clausification as preprocessing.
Extending SMT solvers to Higher-Order Logic ( Technical Report )
TLDR
This work proposes a pragmatic extension of SMT solvers to natively support higher-order reasoning without compromising their performance on FOL problems, thus leveraging the extensive research and implementation efforts dedicated to efficient FOL solving.
Extending SMT Solvers to Higher-Order Logic
TLDR
This work proposes a pragmatic extension for SMT solvers to support HOL reasoning natively without compromising performance on FOL reasoning, thus leveraging the extensive research and implementation efforts dedicated to efficient SMT solving.
...
...

References

SHOWING 1-10 OF 84 REFERENCES
Superposition for Lambda-Free Higher-Order Logic
TLDR
Refutationally complete superposition calculi for intentional and extensional \(\lambda \)-free higher-order logic, two formalisms that allow partial application and applied variables, appear promising as a stepping stone towards complete, efficient automatic theorem provers for full higher- order logic.
Implementation of Lambda-Free Higher-Order Superposition
TLDR
This thesis extends E, a state-of-the-art first-order ATP, to a fragment of HOL that is devoid of lambda abstractions (LFHOL), and devise generalizations of E’s indexing data structures to LFHOL, as well as algorithms like matching and unification to support HOL features in an efficient manner.
A Focused Sequent Calculus for Higher-Order Logic
TLDR
A focused intuitionistic sequent calculus for higher-order logic that has primitive support for equality and mixes λ-term conversion with equality reasoning and is proved sound with respect to Church's simple type theory.
System Description: LEO - A Higher-Order Theorem Prover
TLDR
Leo uses a higher-order Logic based upon Church's simply typed λ-calculus, so that the comprehension axioms are implicitly handled by αβη-equality, and extensionality principles are build in into Leo’s unification, and hence do not have to be axiomatized in order to achieve Henkin completeness.
The Higher-Order Prover Leo-II
TLDR
It is crucial that Leo-II returns proof information in a standardised syntax, so that these proofs can eventually be transformed and verified within proof assistants.
The Higher-Order Prover Leo-III
TLDR
The automated theorem prover Leo-III for classical higher-order logic with Henkin semantics and choice is presented and natively supports almost every normal higher- order modal logic.
Set of Support for Higher-Order Reasoning
TLDR
Limiting how axioms introduced during translation can improve proof search with higher-order problems is shown and heuristics based on the set-of-support strategy for minimising the effects are introduced.
Restricted Combinatory Unification
TLDR
A restricted version of Dougherty's algorithm that is incomplete, terminating and does not require polymorphism is presented, including a novel use of a substitution tree as a filtering index for higher-order unification.
Translating Higher-Order Clauses to First-Order Clauses
TLDR
Experimental data is presented that compares the translations of function applications, types, and λ-abstractions in respect of their success rates for three automatic provers.
Extending SMT Solvers to Higher-Order Logic
TLDR
This work proposes a pragmatic extension for SMT solvers to support HOL reasoning natively without compromising performance on FOL reasoning, thus leveraging the extensive research and implementation efforts dedicated to efficient SMT solving.
...
...