• Corpus ID: 243795582

# Superposition for Higher-Order Logic

@inproceedings{Bentkamp2021SuperpositionFH,
title={Superposition for Higher-Order Logic},
author={Alexander Bentkamp and Jasmin Christian Blanchette and Sophie Tourret and Petar Vukmirovic},
year={2021}
}
• Published 2021
• Philosophy
We recently designed two calculi as stepping stones towards superposition for full higher-order logic: Boolean-free λ-superposition and superposition for first-order logic with interpreted Booleans. Stepping on these stones, we finally reach a sound and refutationally complete calculus for higher-order logic with polymorphism, extensionality, Hilbert choice, and Henkin semantics. In addition to the complexity of combining the calculus’s two predecessors, new challenges arise from the interplay…
1 Citations

## Figures from this paper

### A Comprehensive Framework for Saturation Theorem Proving

A framework for formal refutational completeness proofs of abstract provers that implement saturation calculi, such as ordered resolution or superposition, based on modular extensions of lifted redundancy criteria is presented.

## References

SHOWING 1-10 OF 38 REFERENCES

### Superposition for Full Higher-order Logic

• Philosophy
• 2021
This work aims to reach a sound and refutationally complete calculus for higher-order logic with polymorphism, extensionality, Hilbert choice, and Henkin semantics, and its implementation in Zipperposition outperforms all other higher- order theorem provers.

### Superposition for Lambda-Free Higher-Order Logic

• Computer Science
IJCAR
• 2018
Refutationally complete superposition calculi for intentional and extensional $$\lambda$$-free higher-order logic, two formalisms that allow partial application and applied variables, appear promising as a stepping stone towards complete, efficient automatic theorem provers for full higher- order logic.

### Superposition with First-class Booleans and Inprocessing Clausification

• Computer Science
• 2021
A complete superposition calculus for first-order logic with an interpreted Boolean type to lay the foundation for refutationally complete calculi in more expressive logics with Booleans, and to make superposition work efficiently on problems that would be obfuscated when using clausification as preprocessing.

### Making Higher-Order Superposition Work

• Computer Science
• 2021
Techniques that address issues such as infinitely branching inference rules, new possibilities such as reasoning about formulas, and the need to curb the explosion of specific higher-order rules are described and extensively evaluated in the Zipperposition theorem prover.

### Superposition with Lambdas

• Computer Science
• 2019
A superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans is designed and implemented in the Zipperposition prover and evaluated on TPTP and Isabelle benchmarks.

### The Higher-Order Prover Leo-III

• Computer Science
IJCAR
• 2018
The automated theorem prover Leo-III for classical higher-order logic with Henkin semantics and choice is presented and natively supports almost every normal higher- order modal logic.

### A Combinator-Based Superposition Calculus for Higher-Order Logic

• Mathematics, Computer Science
IJCAR
• 2020
A refutationally complete superposition calculus for a version of higher-order logic based on the combinatory calculus is presented and a novel method of dealing with extensionality is introduced.

### Boolean Reasoning in a Higher-Order Superposition Prover

• Computer Science
PAAR+SC²@IJCAI
• 2020
We present a pragmatic approach to extending a Boolean-free higher-order superposition calculus to support Boolean reasoning. Our approach extends inference rules that have been used only in a

### The computability path ordering

• Computer Science
Log. Methods Comput. Sci.
• 2015
The computability path ordering (CPO), a recursive relation on terms obtained by lifting a precedence on function symbols, is introduced and the well-foundedness proof shows that core CPO captures the essence of computability arguments ^#224, la Tait and Girard, therefore explaining its name.

### A Clausal Normal Form Translation for FOOL

• Computer Science
GCAI
• 2016
A new CNF translation algorithm for FOOL that is friendly and efficient for superposition-based first-order provers, implemented in the Vampire theorem prover and evaluated on a large number of problems coming from formalisation of mathematics and program analysis.