A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Hot is an automated higher-order theorem prover based on HT E, an extensional higher-order tableaux calculus. The rst part of this paper introduces an improved variant of the calculus which closely corresponds to the proof procedure implemented in Hot. The second part discusses Hot's design that can be characterized as a concurrent blackboard architecture. We show the usefulness of the implementation by including benchmark results for over one hundred solved problems from logic and set theory.doi:10.1007/bfb0055140 fatcat:tuxfckgj5bao5awpbid6rhe2ha