Publisher
Springer Nature Switzerland
Reference76 articles.
1. Lecture Notes in Computer Science;M Abseher,2017
2. Achlioptas, D., Moore, C.: The asymptotic order of the random k-SAT threshold. In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16–19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 779–788. IEEE Computer Society (2002). https://doi.org/10.1109/SFCS.2002.1182003
3. Ansótegui, C., Bonet, M.L., Levy, J.: Towards industrial-like random SAT instances. In: Boutilier, C. (ed.) IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, 11–17 July 2009, pp. 387–392 (2009). http://ijcai.org/Proceedings/09/Papers/072.pdf
4. Atserias, A., Fichte, J.K., Thurley, M.: Clause-learning algorithms with many restarts and bounded-width resolution. J. Artif. Intell. Res. 40, 353–373 (2011). https://doi.org/10.1613/jair.3152
5. Bacchus, F., Dalmao, S., Pitassi, T.: Solving #SAT and Bayesian inference with backtracking search. J. Artif. Intell. Res. 34, 391–442 (2009). https://doi.org/10.1613/jair.2648