Author:
Belov Anton,Marques-Silva Joao
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Biere, A.: Picosat essentials. Journal on Satisfiability, Boolean Modeling and Computation 4, 75–97 (2008)
2. Desrosiers, C., Galinier, P., Hertz, A., Paroz, S.: Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems. J. Comb. Optim. 18(2), 124–150 (2009)
3. Grégoire, É., Mazure, B., Piette, C.: On approaches to explaining infeasibility of sets of Boolean clauses. In: Int’l. Conf. on Tools with Artificial Intelligence, pp. 74–83 (2008)
4. Jain, H., Clarke, E.M.: Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts. In: Proc. of the 46th Annual Design Automation Conference, pp. 563–568 (2009)
5. Järvisalo, M., Le Berre, D., Roussel, O.: Rules of the 2011 SAT Competition (2011), http://www.satcompetition.org/2011/
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献