Making Higher-Order Superposition Work
2021 ◽
pp. 415-432
Keyword(s):
AbstractSuperposition is among the most successful calculi for first-order logic. Its extension to higher-order logic introduces new challenges 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. We describe techniques that address these issues and extensively evaluate their implementation in the Zipperposition theorem prover. Largely thanks to their use, Zipperposition won the higher-order division of the CASC-J10 competition.
2021 ◽
pp. 396-412
Keyword(s):
2021 ◽
pp. 378-395
Keyword(s):
Keyword(s):
Keyword(s):
2018 ◽
Vol 26
(3)
◽
Keyword(s):
Keyword(s):