Superposition with Lambdas
Logic in Computer Science
2021-02-02 v1 Artificial Intelligence
Abstract
We designed a superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rules work on -equivalence classes of -terms and rely on higher-order unification to achieve refutational completeness. We implemented the calculus in the Zipperposition prover and evaluated it on TPTP and Isabelle benchmarks. The results suggest that superposition is a suitable basis for higher-order reasoning.
Cite
@article{arxiv.2102.00453,
title = {Superposition with Lambdas},
author = {Alexander Bentkamp and Jasmin Blanchette and Sophie Tourret and Petar Vukmirović and Uwe Waldmann},
journal= {arXiv preprint arXiv:2102.00453},
year = {2021}
}