Ufuoma, Okoh (2024) A Novel, Efficient and Generalised Approach to Boolean Satisfiability. Journal of Engineering Research and Reports, 26 (3). pp. 91-103. ISSN 2582-2926
![[thumbnail of Ufuoma2632023JERR110430.pdf]](http://open.journal4submit.com/style/images/fileicons/text.png)
Text
Ufuoma2632023JERR110430.pdf - Published Version
Download (257kB)
Official URL: https://doi.org/10.9734/jerr/2024/v26i31096
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.
| Item Type: | Article |
|---|---|
| Subjects: | STM Library > Engineering |
| Depositing User: | Managing Editor |
| Date Deposited: | 01 Mar 2024 12:16 |
| Last Modified: | 01 Mar 2024 12:16 |
| URI: | http://open.journal4submit.com/id/eprint/3742 |
Actions (login required)
- View Item