Automatic Detection Of At-Most-One And Exactly-One Relations For Improved Sat Encodings Of Pseudo-Boolean Constraints

PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2019(2019)

引用 10|浏览48
暂无评分
摘要
Pseudo-Boolean (PB) constraints often have a critical role in constraint satisfaction and optimisation problems. Encoding PB constraints to SAT has proven to be an efficient approach in many applications, however care must be taken to encode them compactly and with good propagation properties. It has been shown that at-most-one (AMO) and exactly-one (EO) relations over subsets of the variables can be exploited in various encodings of PB constraints, improving their compactness and solving performance. In this paper we detect AMO and EO relations completely automatically and exploit them to improve SAT encodings that are based on Multi-Valued Decision Diagrams (MDDs). Our experiments show substantial reductions in encoding size and dramatic improvements in solving time thanks to automatic AMO and EO detection.
更多
查看译文
关键词
Automatic CSP reformulation, SAT, Pseudo-Boolean, At-most-one constraint
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要