Author:
Bofill Miquel,Busquets Dídac,Muñoz Víctor,Villaret Mateu
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference35 articles.
1. Abío, I., Deters, M., Nieuwenhuis, R., Stuckey, P.J. (2011). Reducing chaos in SAT-like search: Finding solutions close to a given one. In 14th international conference on theory and applications of satisfiability testing, SAT 2011, LNCS (Vol. 6695, pp. 273–286). Springer.
2. Ansótegui, C., Bonet, M.L., Levy, J. (2009). Solving (weighted) partial MaxSAT through satisfiability testing. In 12th international conference on theory and applications of satisfiability testing, SAT 2009, LNCS (Vol. 5584, pp. 427–440). Springer.
3. Argelich, J., Cabiscol, A., Lynce, I., Manyà, F. (2008). Modelling Max-CSP as partial Max-SAT. In 11th international conference on theory and applications of satisfiability testing, SAT 2008, LNCS (Vol. 4996, pp. 1–14). Springer.
4. Argelich, J., Li, C.M., Manyà, F., Planes, J. (2008). The first and second Max-SAT evaluations. Journal on Satisfiability, Boolean Modeling and Computation, 4(2–4), 251–278.
5. Argelich, J., Lynce, I., Marques-Silva, J.P. (2009). On solving boolean multilevel optimization problems. In: 21st international joint conference on artificial intelligence, IJCAI 2009 (pp. 393–398).
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献