an:01248229
Zbl 0913.68190
Yu, Qingxun; Almulla, Mohammed; Newborn, Monroe
Heuristics used by HERBY for semantic tree theorem proving
EN
Ann. Math. Artif. Intell. 23, No. 3-4, 247-266 (1998).
00052826
1998
j
68T15
HERBY; semantic trees; first-order predicate calculus
Summary: This paper describes a number of heuristics that have been implemented in a program that proves theorems by constructing closed semantic trees. The program is called HERBY. We studied the effectiveness of these heuristics on the Stickel Test Set and found that when HERBY was given two hours to prove each theorem, it was able to prove 78 of the 84 theorems in the set. Constructing semantic trees has been used as a theoretical tool for confirming the unsatisfiability of a set of clauses in first-order predicate calculus; this paper shows that this approach has some practically as well.