作者: Davide Lanti , Norbert Manthey
DOI: 10.1007/978-3-642-44973-4_6
关键词:
摘要: In this paper we propose a new approach to share information among the computation units of an iterative search partitioning parallel SAT solver by approximating validity. Experimental results show streh approach, against both existing sharing techniques and absence sharing. With improved clause sharing, out 600 instances could solve 13 more than previous techniques.