欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
可满足问题（SAT）是一个NP—Hard问题。提出了一种求解SAT的新算法（FFSAT）。该算法将SAT问题转换为寻找一个可满足的2-SAT子问题。SAT问题虽然是NP完全问题，但是当所有子句长度不大于2时，SAT问题可以在线性时间求解。使用2-SAT算法．BinSat求解2-SAT子问题，当它不满足时，根据赋值选择新的2-SAT子问题。实验结果表明，采用本算法的结果优于UnitWalk。
英文摘要：
Satisfiability （SAT） problem is one of the NP-Hard problems. This paper introduced a new SAT solver called FS- SAT. This SAT solver solved the problem by searching a satisfiable 2-SAT sub problem. SAT was NP-complete, but it can be solved in linear time when the given formula contains only binary clauses （2-SAT）. BinSat （2-SAT solver） was used to solve the 2-SAT sub problem and improved the 2-SAT sub problem according to the truth assignment. The experimental results show that the solver outperforms UnitWalk.
同期刊论文项目
同项目期刊论文
Multiobjective optimization and hybrid evolutionary algorithm to solve constrained optimization prob
Constrained optimization based on hybrid evolutionary algorithm and adaptive constraint-handling tec
期刊信息
位置：