Abstract
Boolean satisfiability (SAT) solvers are used heavily in electronic engineering verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solvers are based on the DPLL algorithm and require the input formula to be in conjunctive normal form (CNF). We represent the vhpform of a given NNF formula in the form of two graphs called vpgraph and hpgraph. The input formula is translated into a 2-dimensional format called vertical-horizontal path form (vhpform). In this form disjuncts (operands of ∨) are arranged orizontally and conjuncts (operands of ∧) are arranged vertically.The formula is satisfiable if and only if there exists a vertical path through this arrangement that does not contain two opposite literals ( l and ¬l). The input formula is not required to be in CNF. This algorithm is very important both for the design of integrated circuit and the development of electronic engineering.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.