AUTO2, a saturation-based heuristic prover for higher-order logic
From MaRDI portal
Abstract: We introduce a new theorem prover for classical higher-order logic named auto2. The prover is designed to make use of human-specified heuristics when searching for proofs. The core algorithm is a best-first search through the space of propositions derivable from the initial assumptions, where new propositions are added by user-defined functions called proof steps. We implemented the prover in Isabelle/HOL, and applied it to several formalization projects in mathematics and computer science, demonstrating the high level of automation it can provide in a variety of possible proof tasks.
Recommendations
Cites work
- A comparison of Mizar and Isar
- A fully automatic theorem prover with human-style output
- A heuristic prover for real inequalities
- Efficient E-Matching for SMT Solvers
- scientific article; zbMATH DE number 3702108 (Why is no real title available?)
- scientific article; zbMATH DE number 1543300 (Why is no real title available?)
- Imperative Functional Programming with Isabelle/HOL
- Sledgehammer: judgement day
Cited in
(8)- A verified proof checker for higher-order logic
- On the use of autarkies for satisfiability decision
- The higher-order prover \textsc{Leo}-II
- Satallax: An Automatic Higher-Order Prover
- AUTO2
- scientific article; zbMATH DE number 1341622 (Why is no real title available?)
- Itauto: An Extensible Intuitionistic SAT Solver
- Verifying programs with logic and extended proof rules: deep embedding vs. shallow embedding
This page was built for publication: AUTO2, a saturation-based heuristic prover for higher-order logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829278)