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.
Explaining Outcomes of Multi-Party Dialogues using Causal Learning
Tata Consultancy Services Limited(塔塔咨询服务有限公司);Indian Institute of Technology Kharagpur(印度理工学院卡哈拉格普尔分校);Aristotle University of Thessaloniki(塞萨洛尼基亚里士多德大学)
Explaining the Behavior of Black-Box Prediction Algorithms with Causal Learning
Sani Analytics;Department of Biostatistics, Columbia University(生物统计学系,哥伦比亚大学);Department of Computer Science, Johns Hopkins University(计算机科学系,约翰霍普金斯大学)
From Images to Insights: Explainable Biodiversity Monitoring with Plain Language Habitat Explanations
Leibniz Centre for Agricultural Landscape Research (ZALF)(莱比锡农业景观研究中心(ZALF));Brandenburg University of Technology Cottbus–Senftenberg(勃兰登堡技术大学科特博斯-森芬根堡)