Felip Manyà (40 publications)
2007
"Inference Rules for High-Order Consistency in Weighted CSP",
Proc. of the 22th AAAI Conference on Artificial Intelligence, AAAI-07, Vancouver, Canada, AAAI Press, pp. 167-172, 2007.
Abstract
"Mapping CSP into Many-Valued SAT",
Lecture Notes in Computer Science, vol. 4501: Springer, pp. 10-15, 2007.
Abstract
"New Inference Rules for Max-SAT",
Journal of Artificial Intelligence Research, vol. 30, pp. 321-359, 2007.
"Regular-SAT: A Many-Valued Approach to Solving Combinatorial Problems",
Discrete Applied Mathematics, vol. 155, no. 12, pp. 1613-1626, 2007.
"Resolution for Max-SAT",
Artificial Intelligence, vol. 171, no. 8-9, pp. 606-618, 2007.
Abstract
"The Logic Behind Weighted CSP",
Future and Trends in Constraint Programming: ISTE, pp. 307-320, 2007.
"The Logic behind Weighted CSP",
Proc. of the 20th International Joint Conference on Artificial Intelligence, IJCAI'07: AAAI Press, pp. 32-37, 2007.
Abstract
2006
"A Complete Calculus for Max-SAT",
Lecture Notes in Computer Science, vol. 4121: Springer-Verlag, pp. 240-251, 2006.
Abstract
"Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT",
Proceedings of the 21st National Conference on Artificial Intelligence, AAAI-2006, Boston/MA, USA, pp. 86-91, 2006.
Abstract
"Exact Max-SAT solvers for over-constrained problems",
Journal of Heuristics, no. 12, pp. 375-392, 2006.
Abstract
"Towards Solving Many-Valued MaxSAT",
Proceedings, 36th International Symposium on Multiple-Valued Logics (ISMVL-2006), Singapore: IEEE CS Press, 2006.
2005
"Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max SAT Solvers",
Lecture Notes in Computer Science, vol. 3571: Springer-Verlag, pp. 403 - 414, 2005.
Abstract
"Improved Exact Solver for Weighted Max-Sat",
Lecture Notes in Computer Science, vol. 3569: Springer, pp. 371 - 377, 2005.
Abstract
"Mapping many-valued CNF Formulas to Boolean CNF Formulas",
Proc. 35th Intern. Symposium on Multiple-Valued logics ISMVL: IEEE, pp. 290 - 295, 2005.
Abstract
"Solving over-constrained problems with SAT technology",
Lecture Notes in Computer Science, no. 3569: Springer-Verlag, pp. 1 - 15, 2005.
Abstract