机械辅助推理中问题的非正式讨论

Matt Kaufmann
{"title":"机械辅助推理中问题的非正式讨论","authors":"Matt Kaufmann","doi":"10.1109/HOL.1991.596297","DOIUrl":null,"url":null,"abstract":"But anyhow, the purpose of this note/@& is to draw attention to a number of features of computer programs that support formal reasoning, and especially to share some observations regarding the importance of these features. My hope is that the occasional consideration of the differences among various such programs, and their ramifications, has beneficial effects on the development and enhancement of such systems. I’ll consider here various mechanized reasoning systems, i.e. computer programs that support formal (or even seemingly formal) reasoning. These can be either what are generally called “proof-checkers’’ or else “theorem provers,” though it seems to me that these terms are just vague descriptions of the amount of automated reasoning and user control allowed by the system. (Note that these are not necessarily opposites! -more on that later.)","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"120 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An Informal Discussion Of Issues In Mechanically-assisted Reasoning\",\"authors\":\"Matt Kaufmann\",\"doi\":\"10.1109/HOL.1991.596297\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"But anyhow, the purpose of this note/@& is to draw attention to a number of features of computer programs that support formal reasoning, and especially to share some observations regarding the importance of these features. My hope is that the occasional consideration of the differences among various such programs, and their ramifications, has beneficial effects on the development and enhancement of such systems. I’ll consider here various mechanized reasoning systems, i.e. computer programs that support formal (or even seemingly formal) reasoning. These can be either what are generally called “proof-checkers’’ or else “theorem provers,” though it seems to me that these terms are just vague descriptions of the amount of automated reasoning and user control allowed by the system. (Note that these are not necessarily opposites! -more on that later.)\",\"PeriodicalId\":213603,\"journal\":{\"name\":\"1991., International Workshop on the HOL Theorem Proving System and Its Applications\",\"volume\":\"120 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1991., International Workshop on the HOL Theorem Proving System and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HOL.1991.596297\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HOL.1991.596297","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

但无论如何,这篇笔记的目的是引起人们对支持形式推理的计算机程序的一些特征的注意,特别是分享一些关于这些特征重要性的观察。我的希望是,偶尔考虑各种这样的程序之间的差异,以及它们的分支,对这样的系统的发展和增强有有益的影响。我将在这里考虑各种机械化推理系统,即支持正式(甚至看似正式)推理的计算机程序。这些可以是通常所说的“证明检查者”或“定理证明者”,尽管在我看来,这些术语只是对系统允许的自动推理和用户控制的数量的模糊描述。(注意,这些不一定是对立的!-稍后会详细介绍。)
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Informal Discussion Of Issues In Mechanically-assisted Reasoning
But anyhow, the purpose of this note/@& is to draw attention to a number of features of computer programs that support formal reasoning, and especially to share some observations regarding the importance of these features. My hope is that the occasional consideration of the differences among various such programs, and their ramifications, has beneficial effects on the development and enhancement of such systems. I’ll consider here various mechanized reasoning systems, i.e. computer programs that support formal (or even seemingly formal) reasoning. These can be either what are generally called “proof-checkers’’ or else “theorem provers,” though it seems to me that these terms are just vague descriptions of the amount of automated reasoning and user control allowed by the system. (Note that these are not necessarily opposites! -more on that later.)
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On The Use Of The HOL System For Protocol Verification Proof Of Program Transformations Introduction To The Hol System PM: A Proof Manager For HOL And Other Provers A Package For Inductive Relation Definitions In HOL
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1