HOT: A concurrent automated theorem prover based on higher-order tableaux. HOT is an automated higher-order theorem prover based on ℋ𝒯ℰ an extensional higher-order tableaux calculus. The first 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.
Keywords for this software
References in zbMATH (referenced in 5 articles , 1 standard article )
Showing results 1 to 5 of 5.
- Bentkamp, Alexander; Blanchette, Jasmin; Tourret, Sophie; Vukmirović, Petar; Waldmann, Uwe: Superposition with lambdas (2019)
- Andrews, Peter B.; Brown, Chad E.: TPS: A hybrid automatic-interactive system for developing proofs (2006)
- Bonacina, Maria Paola: A taxonomy of parallel strategies for deduction (2000)
- Grundy, Jim (ed.); Newey, Malcolm (ed.): Theorem proving in higher order logics. 11th international conference, TPHOLs ’98. Canberra, Australia, September 27 - October 1, 1998. Proceedings (1998)
- Konrad, Karsten: HOT: A concurrent automated theorem prover based on higher-order tableaux (1998)