arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2306.06294cs.AI
收藏

利用因果推理解释SAT求解过程

Explaining SAT Solving Using Causal Reasoning

National University of Singapore(新加坡国立大学);Chennai Mathematical Institute(金奈数学研究所);IAI, TCG-CREST(TCG-CREST 人工智能研究所)

Jiong Yang, Arijit Shaw, Teodora Baluta, Mate Soos, Kuldeep S. Meel

AI总结:

针对CDCL算法缺乏理论解释、部分场景求解能力存疑的问题,提出CausalSAT方法,通过因果推理构建求解器组件因果图,验证经验法则并解答求解器实现相关问题。

摘要:

过去三十年间,高效SAT(可满足性)求解器的设计取得了显著进展,现代求解器仅需数秒就能求解包含数百万个变量的工业基准测试用例。现代SAT求解器的成功得益于被广泛应用的CDCL(冲突驱动子句学习)算法,但该算法目前仍缺乏全面的理论研究。此外,研究人员观察到CDCL求解器在处理仅包含数百个变量的特定类别基准测试用例时仍存在困难,这与其在实际应用中的广泛普及形成了反差。因此,亟需揭开这些看似能力有限却又功能强大的“黑箱”的内部运行机制。\n 本文提出了名为CausalSAT的方法,作为实现上述目标的第一步,该方法借助因果推理来深入理解现代SAT求解器的运行原理。CausalSAT首先从SAT求解器的执行过程中生成观测数据,学习一个结构化图来表示SAT求解器各组件之间的因果关系。随后,针对诸如“低字面量块距离(LBD)的子句是否具有更高的子句效用”这类查询,CausalSAT会计算LBD对子句效用的因果效应,并给出问题的答案。我们利用CausalSAT定量验证了此前被视为“经验法则”或实证发现的假设,例如上述查询对应的假设。此外,CausalSAT还能解答此前未被探究的问题,比如哪种分支启发式算法能带来更高的子句效用,以此研究分支策略与子句管理之间的关系。使用实际基准测试用例开展的实验评估表明,CausalSAT能有效拟合数据,验证了4条“经验法则”,并解答了3个与现代求解器实现密切相关的问题。

英文摘要:

The past three decades have witnessed notable success in designing efficient SAT solvers, with modern solvers capable of solving industrial benchmarks containing millions of variables in just a few seconds. The success of modern SAT solvers owes to the widely-used CDCL algorithm, which lacks comprehensive theoretical investigation. Furthermore, it has been observed that CDCL solvers still struggle to deal with specific classes of benchmarks comprising only hundreds of variables, which contrasts with their widespread use in real-world applications. Consequently, there is an urgent need to uncover the inner workings of these seemingly weak yet powerful black boxes. In this paper, we present a first step towards this goal by introducing an approach called CausalSAT, which employs causal reasoning to gain insights into the functioning of modern SAT solvers. CausalSAT initially generates observational data from the execution of SAT solvers and learns a structured graph representing the causal relationships between the components of a SAT solver. Subsequently, given a query such as whether a clause with low literals blocks distance (LBD) has a higher clause utility, CausalSAT calculates the causal effect of LBD on clause utility and provides an answer to the question. We use CausalSAT to quantitatively verify hypotheses previously regarded as "rules of thumb" or empirical findings such as the query above. Moreover, CausalSAT can address previously unexplored questions, like which branching heuristic leads to greater clause utility in order to study the relationship between branching and clause management. Experimental evaluations using practical benchmarks demonstrate that CausalSAT effectively fits the data, verifies four "rules of thumb", and provides answers to three questions closely related to implementing modern solvers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑