A Genetic-based Local Search Method for SAT Problem

摘要：

　　In this paper,we present a Genetic Local Search algorithm (GLS),for the satisfiability problem (SAT).The main feature of GLS is that a combination of stage focused on a Corrective Clause and Truth Maintenance (CCTV) is improved,Genetic Algorithm (GA) and Tabu Search (TS).We have conducted experiments to evaluate the different components of GLS algorithms.GLS provides very competitive results respectively indicated by our experimental.

关键词： GA Local search SAT

作者: Gakiza Canisius Kalisa Wilson Yuzhang Zhang Yang Chenhui Hong Xin

作者单位: Xiamen University,China

会议类型: 国际会议

会议名称: 2016IEEE第二届信息技术、网络、电子及自动化控制会议

会议地点: 重庆

会议语种:英文

页码: 454-458

在线出版日期: 2016-03-20（万方平台首次上网日期，不代表论文的发表时间）