METEOR - EXPLORING MODEL ELIMINATION THEOREM-PROVING

被引:7
|
作者
ASTRACHAN, O [1 ]
机构
[1] DUKE UNIV,DEPT COMP SCI,DURHAM,NC 27706
关键词
MODEL ELIMINATION; THEOREM PROVING; HIGH-PERFORMANCE COMPUTING;
D O I
10.1007/BF00881946
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we describe the theorem prover METEOR which is a high-performance model elimination prover running in sequential, parallel, and distributed computing environments. METEOR has a very high inference rate. But, as is the case with better chess-playing programs, speed alone is not sufficient when exploring large search spaces; intelligent search is necessary. We describe modifications to traditional iterative deepening search mechanisms whose implementation in METEOR result in performance improvements of several orders of magnitude and that have permitted the discovery of proofs unobtainable by top-down model elimination provers.
引用
收藏
页码:283 / 296
页数:14
相关论文
共 50 条