Title: Improving local search for SAT via programming by optimization  

Speaker: Prof. Shaowei Cai (Institute of Software, Chinese Academy of Sciences)

Time: 15:10-18:00, 17, Apr., 2018

Location: Room 105, Teaching Building 1, Peking University

Abstract: This talk introduces two main methods for SAT (Boolean satisfiability problem),  and presents a recent idea for local search for  SAT. Then the main body of the talk focuses on a technique of automatic algorithm design named Programming by Optimization.  I will show how to improve local search algorithm by using this AI technique.

 Key Reference:   Shaowei Cai, Kaile Su: Local search for Boolean Satisfiability with configuration checking and subscore. Artificial Intelligence. 204:75-98 (2013)  

蔡少伟2012和2014分别从北京大学计算机博士毕业（优秀博士论文奖）和Griffith大学应用数学博士毕业（提前毕业），现任中科院软件所计算机科学国家重点实验室研究员，主要研究方向为自动推理，组合优化与算法工程。曾获中国机器人大赛一等奖，获SAT国际比赛和相关其他比赛的多个冠军。发表论文40多篇，包括4篇人工智能顶级期刊Artiticial Intelligence论文。担任IJCAI和AAAI的PC member，以及SCI期刊Frontiers of Computer Science的 Young Associate Editor。个人主页：http://lcs.ios.ac.cn/~caisw/