基于部分安装技术的定理证明

SICE '95. Proceedings of the 34th SICE Annual Conference. International Session Papers Pub Date : 1995-07-26 DOI:10.1109/SICE.1995.526653

M. Yamamoto, T. Ohyanagi, A. Ohuchi

{"title":"基于部分安装技术的定理证明","authors":"M. Yamamoto, T. Ohyanagi, A. Ohuchi","doi":"10.1109/SICE.1995.526653","DOIUrl":null,"url":null,"abstract":"We present a new theorem proving procedure based on the partial instantiation technique, which is developed by Jeroslow. The proposed procedure is applicable to clausal form formulas in the first-order logic, as well as other resolution-based methods. We also show its completeness, i.e., it can verify that a given set of clauses is unsatisfiable if indeed it is unsatisfiable.","PeriodicalId":344374,"journal":{"name":"SICE '95. Proceedings of the 34th SICE Annual Conference. International Session Papers","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Theorem proving based on the partial instatiation technique\",\"authors\":\"M. Yamamoto, T. Ohyanagi, A. Ohuchi\",\"doi\":\"10.1109/SICE.1995.526653\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a new theorem proving procedure based on the partial instantiation technique, which is developed by Jeroslow. The proposed procedure is applicable to clausal form formulas in the first-order logic, as well as other resolution-based methods. We also show its completeness, i.e., it can verify that a given set of clauses is unsatisfiable if indeed it is unsatisfiable.\",\"PeriodicalId\":344374,\"journal\":{\"name\":\"SICE '95. Proceedings of the 34th SICE Annual Conference. International Session Papers\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SICE '95. Proceedings of the 34th SICE Annual Conference. International Session Papers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SICE.1995.526653\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SICE '95. Proceedings of the 34th SICE Annual Conference. International Session Papers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SICE.1995.526653","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文提出了一种新的基于Jeroslow提出的部分实例化技术的定理证明方法。所提出的程序适用于一阶逻辑中的子句形式公式，以及其他基于解析的方法。我们还证明了它的完备性，即，如果一组给定子句确实是不可满足的，它可以证明它是不可满足的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Theorem proving based on the partial instatiation technique

We present a new theorem proving procedure based on the partial instantiation technique, which is developed by Jeroslow. The proposed procedure is applicable to clausal form formulas in the first-order logic, as well as other resolution-based methods. We also show its completeness, i.e., it can verify that a given set of clauses is unsatisfiable if indeed it is unsatisfiable.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

SICE '95. Proceedings of the 34th SICE Annual Conference. International Session Papers

自引率

0.00%

发文量