Author:
Hyvärinen Antti E. J.,Junttila Tommi,Niemelä Ilkka
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Asín, R., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E.: Practical algorithms for unsatisfiability proof and core generation in SAT solvers. AI Communications 23(2-3), 145–157 (2010)
2. Biere, A.: Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT race 2010. Technical Report 10/1, Institute for Formal Models and Verification, Johannes Kepler University (2010)
3. Blochinger, W., Sinz, C., Küchlin, W.: Parallel propositional satisfiability checking with distributed dynamic learning. Parallel Computing 29(7), 969–994 (2003)
4. Böhm, M., Speckenmeyer, E.: A fast parallel SAT-solver: Efficient workload balancing. Annals of Mathematics and Artificial Intelligence 17(4-3), 381–400 (1996)
5. Chrabakh, W., Wolski, R.: GridSAT: a system for solving satisfiability problems using a computational grid. Parallel Computing 32(9), 660–687 (2006)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Distributed SAT-Based Framework for Closed Frequent Itemset Mining;Advanced Data Mining and Applications;2022
2. Memory Efficient Parallel SAT Solving with Inprocessing;PROC INT C TOOLS ART;2019
3. Solution Space Adjustable CNF Obfuscation for Privacy-Preserving SAT Solving;2018 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom);2018-12
4. Privacy-Preserving SAT Solving Based on Projection-Equivalence CNF Obfuscation;Cyberspace Safety and Security;2018
5. Cube-and-Conquer for Satisfiability;Handbook of Parallel Constraint Reasoning;2018