[Termtools] CPF Format for upcoming competition

[René Thiemann]

Dear all,

for the upcoming termination competition in the certifying categories, some of us might want to integrate new termination techniques. Here, some new items have already been proposed and added to the CPF format (uncurrying and bounds). 

If you have comments on these extensions or like to add more new techniques, please make concrete proposals on cpf at informatik.uibk.ac.at until May 1, so that the format can be fixed soonish afterwards.

Note, that there also has been one non-backwards compatible change in the format: the proofOrigin is now mandatory such that the source of the proofs is clearly visible (changed old elements tool-name and tool-version from optional to mandatory). 

The current version which is under discussion is available both as .xsd and as .pdf at 
http://cl-informatik.uibk.ac.at/software/cpf/#devel

Best regards,
René
-- 
René Thiemann                    mailto:rene.thiemann at uibk.ac.at
Computational Logic Group        http://cl-informatik.uibk.ac.at/~thiemann/
Institute of Computer Science    phone: +43 512 507-6434
University of Innsbruck