HyperSAT是3-SAT实例的新生成器

Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001 Pub Date : 2001-10-30 DOI:10.1109/ICCIMA.2001.970487

J. Segura-Salazar, J. Torres-Jiménez

{"title":"HyperSAT是3-SAT实例的新生成器","authors":"J. Segura-Salazar, J. Torres-Jiménez","doi":"10.1109/ICCIMA.2001.970487","DOIUrl":null,"url":null,"abstract":"Propositional satisfiability is the problem of determining, given a formula of propositional calculus in CNF (Conjunctive Normal Form), if there is an assignment of truth values for the variables in such a way that the whole formula is true. The SAT problem is one of the most important combinatorial optimization problems, in particular the 3-SAT problem is the,first NP-Complete problem. In order to test sat solving algorithms is necessary to generate hard sat instances, in this paper we address the construction and testing of HyperSAT a sat instance generator based on the concept of hypergraphs.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"HyperSAT a new generator for 3-SAT instances\",\"authors\":\"J. Segura-Salazar, J. Torres-Jiménez\",\"doi\":\"10.1109/ICCIMA.2001.970487\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Propositional satisfiability is the problem of determining, given a formula of propositional calculus in CNF (Conjunctive Normal Form), if there is an assignment of truth values for the variables in such a way that the whole formula is true. The SAT problem is one of the most important combinatorial optimization problems, in particular the 3-SAT problem is the,first NP-Complete problem. In order to test sat solving algorithms is necessary to generate hard sat instances, in this paper we address the construction and testing of HyperSAT a sat instance generator based on the concept of hypergraphs.\",\"PeriodicalId\":232504,\"journal\":{\"name\":\"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIMA.2001.970487\",\"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 Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIMA.2001.970487","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

命题可满足性是在CNF(合取范式)中给定一个命题演算公式，确定变量的真值赋值是否使得整个公式为真。SAT问题是最重要的组合优化问题之一，特别是3-SAT问题是第一个np完全问题。为了验证卫星求解算法生成硬卫星实例的必要性，本文讨论了基于超图概念的卫星实例生成器HyperSAT的构造和测试。

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

查看原文本刊更多论文

HyperSAT a new generator for 3-SAT instances

Propositional satisfiability is the problem of determining, given a formula of propositional calculus in CNF (Conjunctive Normal Form), if there is an assignment of truth values for the variables in such a way that the whole formula is true. The SAT problem is one of the most important combinatorial optimization problems, in particular the 3-SAT problem is the,first NP-Complete problem. In order to test sat solving algorithms is necessary to generate hard sat instances, in this paper we address the construction and testing of HyperSAT a sat instance generator based on the concept of hypergraphs.

求助全文

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

来源期刊

Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001

自引率

0.00%

发文量