Abstract
AbstractThe support for higher-order reasoning in the Vampire theorem prover has recently been completely reworked. This rework consists of new theoretical ideas, a new implementation, and a dedicated strategy schedule. The theoretical ideas are still under development, so we discuss them at a high level in this paper. We also describe the implementation of the calculus in the Vampire theorem prover, the strategy schedule construction and several empirical performance statistics.
Publisher
Springer Nature Switzerland
Reference31 articles.
1. Lecture Notes in Computer Science;L Bachmair,1992
2. Bentkamp, A., Blanchette, J., Tourret, S., Vukmirović, P.: Superposition for higher-order logic. J. Autom. Reason. 67(1), 10 (2023)
3. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);A Bentkamp,2019
4. Bhayat, A.: Automated theorem proving in higher-order logic. Ph.D. thesis (2015)
5. Bhayat, A., Korovin, K., Kovács, L., Schoisswohl, J.: Refining unification with abstraction. In: LPAR, pp. 36–47 (2023)