1 paper · 1 filter
Dieter Hofbauer, Johannes Waldmann
Automating semantic labelling for termination proofs is a combinatorially hard problem since the number of algebras grows prohibitively large even for small domains. We report on e…