We present a new string SMT solver, Z3str3, that is faster than its competitors Z3str2, Norn, CVC4, S3, and S3P over a majority of three industrial-strength benchmarks, namely Kaluza, PISA, and IBM AppScan. Z3str3 supports string equations, linear arithmetic over length function, and regular language membership predicate. The key algorithmic innovation behind the efficiency of Z3str3 is a technique we call theory-aware branching, wherein we modify Z3's branching heuristic to take into account the structure of theory literals to compute branching activities. In the traditional DPLL(T) architecture, the structure of theory literals is hidden from the DPLL(T) SAT solver because of the Boolean abstraction constructed over the input theory formula. By contrast, the theory-aware technique presented in this paper exposes the structure of theory literals to the DPLL(T) SAT solver's branching heuristic, thus enabling it to make much smarter decisions during its search than otherwise. As a consequence, Z3str3 has better performance than its competitors.
Learning to Rank the Initial Branching Order of SAT Solvers
KTH Royal Institute of Technology(皇家理工学院);Kempner Institute at Harvard University(哈佛大学肯普纳研究所);Mohamed Bin Zayed University of Artificial Intelligence(穆罕默德·本·扎耶德人工智能大学)
Learning Branching Heuristics for Propositional Model Counting
University of Toronto(多伦多大学);UC Berkeley(加州大学伯克利分校);Vector Institute(向量研究所)
命题模型计数(Propositional Model Counting),或#SAT,是计算布尔公式的满意赋值的数量的问题。来自不同应用领域的许多问题,包括许多离散概率推理问题,可以转化为模型计数问题,由#SAT求解器来解决。然而,精确的#SAT求解器通常不能扩展到工业规模的实例。在本文中,我们提出了Neuro#,一种用于学习分支算法的方法,以提高给定问题族实例上的精确SAT求解器的性能。我们的实验表明,我们的方法减少了类似的分布式举行了实例的步骤数,并推广到更大的实例,从同一个问题的家庭。它是能够实现这些结果对一些不同的问题家庭具有非常不同的结构。除了步数改进之外,Neuro#还可以在某些问题族中的较大实例上实现比vanilla求解器高出几个数量级的挂钟加速,尽管查询模型的运行时开销很大。
String Solving with Stabilization and Transducers (Technical Report)
Faculty of Information Technology, Brno University of Technology(布尔诺理工大学信息技术学院);The Technical Faculty of IT and Design, Aalborg University(奥尔堡大学IT与设计技术学院)