Author:
Saouli Sabrine,Baarir Souheib,Dutheillet Claude,Devriendt Jo
Publisher
Springer Nature Switzerland
Reference32 articles.
1. Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Solving difficult sat instances in the presence of symmetry. In: Proceedings 2002 Design Automation Conference (IEEE Cat. No. 02CH37324) pp. 731–736. IEEE (2002)
2. Aloul, F.A., Sakallah, K.A., Markov, I.L.: Efficient symmetry breaking for Boolean satisfiability. IEEE Trans. Comput. 55(5), 549–558 (2006)
3. Atserias, A., Lauria, M., Nordström, J.: Narrow proofs may be maximally long. ACM Trans. Comput. Logic (TOCL) 17(3), 1–30 (2016)
4. Atserias, A., Müller, M., Oliva, S.: Lower bounds for DNF-refutations of a relativized weak pigeonhole principle. J. Symbolic Logic 80(2), 450–476 (2015)
5. Audemard, G., Simon, L.: Predicting learnt clauses quality in modern sat solvers. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009, pp. 399–404 (2009)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献