{"title":"布尔可满足性的新颖、高效和通用方法","authors":"Okoh Ufuoma","doi":"10.9734/jerr/2024/v26i31096","DOIUrl":null,"url":null,"abstract":"One question which has occupied mathematicians, engineers and scientists of this age is the problem of Boolean satisfiability (SAT) which asks whether a given CNF formula has at least a satisfying assignment. The goal of this work is to present a novel, efficient and general method of deciding SAT and finding all the satisfying assignments of CNF formulas. This method is powerful as it employs resolution identities in transforming clauses without a particular variable into clauses with that variable.","PeriodicalId":508164,"journal":{"name":"Journal of Engineering Research and Reports","volume":"36 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Novel, Efficient and Generalised Approach to Boolean Satisfiability\",\"authors\":\"Okoh Ufuoma\",\"doi\":\"10.9734/jerr/2024/v26i31096\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One question which has occupied mathematicians, engineers and scientists of this age is the problem of Boolean satisfiability (SAT) which asks whether a given CNF formula has at least a satisfying assignment. The goal of this work is to present a novel, efficient and general method of deciding SAT and finding all the satisfying assignments of CNF formulas. This method is powerful as it employs resolution identities in transforming clauses without a particular variable into clauses with that variable.\",\"PeriodicalId\":508164,\"journal\":{\"name\":\"Journal of Engineering Research and Reports\",\"volume\":\"36 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Engineering Research and Reports\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.9734/jerr/2024/v26i31096\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Engineering Research and Reports","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9734/jerr/2024/v26i31096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Novel, Efficient and Generalised Approach to Boolean Satisfiability
One question which has occupied mathematicians, engineers and scientists of this age is the problem of Boolean satisfiability (SAT) which asks whether a given CNF formula has at least a satisfying assignment. The goal of this work is to present a novel, efficient and general method of deciding SAT and finding all the satisfying assignments of CNF formulas. This method is powerful as it employs resolution identities in transforming clauses without a particular variable into clauses with that variable.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
