{"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}
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.)