A Combinator-Based Superposition Calculus for Higher-Order Logic
- 24 June 2020
- book chapter
- Published by Springer Nature
- Vol. 12166, 278-296
Abstract
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.Keywords
This publication has 23 references indexed in Scilit:
- A Polymorphic Vampire2020
- A Knuth-Bendix-Like Ordering for Orienting Combinator Equations2020
- A Combinator-Based Superposition Calculus for Higher-Order Logic2020
- Restricted Combinatory Unification2019
- Extending SMT Solvers to Higher-Order Logic2019
- Superposition with Lambdas2019
- Superposition for Lambda-Free Higher-Order Logic2018
- The Higher-Order Prover Leo-IIJournal of Automated Reasoning, 2015
- Rewrite-based Equational Theorem Proving with Selection and SimplificationJournal of Logic and Computation, 1994
- On connections and higher-order logicJournal of Automated Reasoning, 1989