Automating Change of Representation for Proofs in Discrete Mathematics
Representation determines how we can reason about a specific problem. Sometimes one representation helps us find a proof more easily than others. Most current automated reasoning tools focus on reasoning within one representation. There is, therefore, a need for the development of better tools to mechanise and automate formal and logically sound changes of representation.
In this paper we look at examples of representational transformations in discrete mathematics, and show how we have used Isabelle’s Transfer tool to automate the use of these transformations in proofs. We give a brief overview of a general theory of transformations that we consider appropriate for thinking about the matter, and we explain how it relates to the Transfer package. We show our progress towards developing a general tactic that incorporates the automatic search for representation within the proving process.
KeywordsChange of representation Transformation Automated reasoning Isabelle proof assistant
- 3.Farmer, W.M., Guttman, J.D., Thayer, F.J.: Little theories. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 567–581. Springer, Heidelberg (1992) Google Scholar
- 7.Hurd, J.: System description: the Metis proof tactic. In: ESHOC, pp. 103–104 (2005)Google Scholar
- 10.Paulson, L.C., Blanchette, J.C.: Three years of experience with sledgehammer, a practical link between automatic and interactive theorem provers. Practical Aspects of Automated Reasoning (PAAR), 5th International Joint Conference on Automated Reasoning (IJCAR) (2010)Google Scholar