A Hybrid Approach to Solve SAT and UNSAT Problems

IEEE Latin America Transactions(2020)

引用 0|浏览6
暂无评分
摘要
This work involves the construction of a hybrid approach to solve SAT and UNSAT problems. The solution combines techniques found in Stalmarck and DPLL algorithms for solving propositional satisfiability problems. We extend the Stalmarck rules in order to reduce computational cost during the deduction phase. We applied our solution to SAT and UNSAT instances. From the results it was found that this...
更多
查看译文
关键词
IEEE transactions,Computational efficiency,Indexes,DNA,Hardware,Software
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要