Dynamic Polarity Adjustment in a Parallel SAT Solver
Tools with Artificial Intelligence(2011)
摘要
In this paper, a new heuristic for polarity selection is proposed. This heuristic is defined for parallel SAT solvers. The selected polarity is an important component of modern SAT solvers, in particular in portfolio ones. Indeed, these solvers are often based on the cooperation/competition principle. In this case, the polarity can be used to guide the solver in the search space. A criterion based on the intention notion is proposed in order to evaluate whether two solvers are to study the same search space or not. Once this criterion defined, a dynamical heuristic polarity is proposed for tuning the different solvers. Experimental results show that our approach is efficient and provides significant improvements on a range of industrial instances.
更多查看译文
关键词
new heuristic,polarity selection,dynamical heuristic polarity,modern sat solvers,search space,different solvers,parallel sat solver,selected polarity,parallel sat solvers,dynamic polarity adjustment,competition principle,artificial intelligence,sat,databases,lenses,sat solver,space exploration,satisfiability,computability,topology,parallel,polarity,parallel programming
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要