{"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}
引用次数: 0
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
