Well, I'm planning my pilgrimage to Glastonbury and the summer hols.
But before I do, a word on THORN.
THORN has it's limits, but one limit it does not have is a large program.
At 580 loc, THORN is very lightweight. It's fairly decent on FOL problems
without equality; so-so on purely algebraic problems and quite bad on
theories that mix the two because of combinatorial problems. Can it be bettered?
Roughly you can split improvements into 2x2 classes.
1. Improvements that involved changing things inside THORN.
2. Improvements that involve putting THORN within something outside THORN.
And this second division.
A. Improvements that improve the compile time behaviour of THORN.
B. Improvements that improve the run time behaviour of THORN.
1A. Includes all forms of equational unification. 2A. includes planners
and heuristic reasoners of all kinds. 1B. would include compilation
for parallel processing and 2B. perhaps combining THORN with 1B.
subsumption testing and maybe JIT compilation. Personally I think
2A. is likely to give the best fast returns.
Mark