A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A Combinator-Based Superposition Calculus for Higher-Order Logic
[chapter]
2020
Lecture Notes in Computer Science
We present a refutationally complete superposition calculus for a version of higher-order logic based on the combinatory calculus. We also introduce a novel method of dealing with extensionality. The calculus was implemented in the Vampire theorem prover and we test its performance against other leading higher-order provers. The results suggest that the method is competitive.
doi:10.1007/978-3-030-51074-9_16
fatcat:tw3vp2xhnffo7m7gv5ymma4c2a