首页> 外文会议>International conference on intelligent computer mathematics >Automating Change of Representation for Proofs in Discrete Mathematics
【24h】

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.
机译:代表性决定了我们如何推理特定问题。有时候,一种表示方式比其他方式更有助于我们找到证明。当前大多数自动推理工具都专注于一种表示形式中的推理。因此,需要开发更好的工具以使表示形式和逻辑上合理的变化机械化和自动化。在本文中,我们研究了离散数学中表示变换的示例,并展示了我们如何使用Isabelle的Transfer工具自动在证明中使用这些变换。我们简要概述了我们认为适合该问题的一般转换理论,并解释了其与Transfer Package的关系。我们展示了我们在开发通用策略方面所取得的进展,该策略将自动搜索表示过程纳入了证明过程。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号