用整数规划计算素数蕴涵

Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence Pub Date : 1996-11-16 DOI:10.1109/TAI.1996.560473

C. Pizzuti

{"title":"用整数规划计算素数蕴涵","authors":"C. Pizzuti","doi":"10.1109/TAI.1996.560473","DOIUrl":null,"url":null,"abstract":"An enumerative approach for selective generation of prime implicants of a theory in conjunctive normal form is presented. The method is based on 0-1 programming. Optimal solutions of the integer linear program associated with the theory correspond to prime implicants. All prime implicants can be obtained by augmenting the integer program with new constraints which discard the already obtained solutions. The method allows to implement preference criteria in the choice of the prime implicants to find.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"41","resultStr":"{\"title\":\"Computing prime implicants by integer programming\",\"authors\":\"C. Pizzuti\",\"doi\":\"10.1109/TAI.1996.560473\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An enumerative approach for selective generation of prime implicants of a theory in conjunctive normal form is presented. The method is based on 0-1 programming. Optimal solutions of the integer linear program associated with the theory correspond to prime implicants. All prime implicants can be obtained by augmenting the integer program with new constraints which discard the already obtained solutions. The method allows to implement preference criteria in the choice of the prime implicants to find.\",\"PeriodicalId\":209171,\"journal\":{\"name\":\"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"41\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TAI.1996.560473\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1996.560473","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 41

摘要

提出了一种选择生成合取范式理论的素数蕴涵的枚举方法。该方法基于0-1规划。与该理论相关的整数线性规划的最优解对应于素数蕴涵。所有素数隐含式都可以通过用新的约束条件对整数规划进行增广而得到，这些约束条件抛弃了已经得到的解。该方法允许在选择要查找的主要蕴涵时实现偏好标准。

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

查看原文本刊更多论文

Computing prime implicants by integer programming

An enumerative approach for selective generation of prime implicants of a theory in conjunctive normal form is presented. The method is based on 0-1 programming. Optimal solutions of the integer linear program associated with the theory correspond to prime implicants. All prime implicants can be obtained by augmenting the integer program with new constraints which discard the already obtained solutions. The method allows to implement preference criteria in the choice of the prime implicants to find.

求助全文

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

来源期刊

Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence

自引率

0.00%

发文量