Modular and Efficient Divide-and-Conquer SAT Solver on Top of the Painless Framework-Reference-Cited by-同舟云学术

Modular and Efficient Divide-and-Conquer SAT Solver on Top of the Painless Framework

Published:2019 Issue: Volume: Page:135-151
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Le Frioux Ludovic,Baarir Souheib,Sopena Julien,Kordon Fabrice

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-17462-0_8

Reference30 articles.

1. Audemard, G., Hoessen, B., Jabbour, S., Piette, C.: Dolius: a distributed parallel SAT solving framework. In: Pragmatics of SAT International Workshop (POS) at SAT, pp. 1–11. Citeseer (2014)

2. Lecture Notes in Computer Science;G Audemard,2016

3. Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Proceedings of the 21st International Joint Conferences on Artifical Intelligence (IJCAI), pp. 399–404. AAAI Press (2009)

4. Lecture Notes in Computer Science;G Audemard,2014

5. Lecture Notes in Computer Science;T Balyo,2015

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Harnessing Neuron Stability to Improve DNN Verification;Proceedings of the ACM on Software Engineering;2024-07-12

2. Parallel Assembly Synthesis;Lecture Notes in Computer Science;2024

3. ParaQooba: A Fast and Flexible Framework for Parallel and Distributed QBF Solving;Tools and Algorithms for the Construction and Analysis of Systems;2023

4. Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres;Discrete Mathematics;2022-12

5. Proof-Stitch: Proof Combination for Divide-and-Conquer SAT Solvers;Form Comp Aid Design;2022