人工知能学会誌（1986～2013, Print ISSN:0912-8085）
定理証明器A-SATCHMOREの改良の一手法
2000 年 15 巻 6 号 p. 1125-1129
詳細
2000 年 15 巻 6 号 p. 1125-1129
This paper presents an improvement of theorem prover A-SATCHMORE. Considering every consequent atoms of non-Horn clauses in a given clause set are derivable, A-SATCHMORE may suffer from a potential explosion of the search space when some of such consequent atoms are precisely underivable. In this paper, we introduce how to exclude those underivable consequent atoms of non-Horn clauses from our computation.
