A Combinator-Based Superposition Calculus for Higher-Order Logic

被引:19
|
作者
Bhayat, Ahmed [1 ]
Reger, Giles [1 ]
机构
[1] Univ Manchester, Manchester, Lancs, England
来源
AUTOMATED REASONING, PT I | 2020年 / 12166卷
关键词
D O I
10.1007/978-3-030-51074-9_16
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:278 / 296
页数:19
相关论文
共 50 条