Author:
Laitinen Tero,Junttila Tommi,Niemelä Ilkka
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Handbook of Satisfiability. IOS Press (2009)
2. Tseitin, G.S.: On the complexity of derivations in the propositional calculus. Studies in Mathematics and Mathematical Logic Part II, 115–125 (1968)
3. Urquhart, A.: Hard examples for resolution. Journal of the ACM 34(1), 209–219 (1987)
4. Pipatsrisawat, K., Darwiche, A.: On the power of clause-learning SAT solvers as resolution engines. Artificial Intelligence 175(2), 512–525 (2011)
5. Li, C.M.: Integrating equivalency reasoning into Davis-Putnam procedure. In: Proc. AAAI/IAAI 2000, pp. 291–296. AAAI Press (2000)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On SAT Representations of XOR Constraints;Language and Automata Theory and Applications;2014