Author:
Abío Ignasi,Deters Morgan,Nieuwenhuis Robert,Stuckey Peter J.
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Ansótegui, C., Bonet, M.L., Levy, J.: Solving (weighted) partial maxsat through satisfiability testing. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 427–440. Springer, Heidelberg (2007)
2. Bailleux, O., Marquis, P.: Some computational aspects of distance-sat. J. Autom. Reasoning 37(4), 231–260 (2006)
3. Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem-Proving. Comm. of the ACM, CACM 5(7), 394–397 (1962)
4. Lecture Notes in Computer Science;N. Eén,2004
5. Goldberg, E., Novikov, Y.: BerkMin: A Fast and Robust SAT-Solver. In: 2002 Conference on Design, Automation, and Test in Europe, DATE 2002, pp. 142–149. IEEE Computer Society, Los Alamitos (2002)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献