Felip Manya
Felip Manya
IIIA-CSIC
No hay ninguna dirección de correo electrónico verificada.
TítuloCitado porAño
New inference rules for Max-SAT
CM Li, F Manya, J Planes
Journal of Artificial Intelligence Research 30, 321-359, 2007
1852007
MaxSAT, Hard and Soft Constraints.
CM Li, F Manya
Handbook of satisfiability 185, 613-631, 2009
1772009
Mapping problems with finite-domain variables to problems with boolean variables
C Ansótegui, F Manya
International conference on theory and applications of satisfiability …, 2004
992004
Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers
CM Li, F Manya, J Planes
International conference on principles and practice of constraint …, 2005
902005
Resolution for max-sat
ML Bonet, J Levy, F Manyà
Artificial Intelligence 171 (8-9), 606-618, 2007
882007
Exploiting cycle structures in Max-SAT
CM Li, F Manyà, N Mohamedou, J Planes
International Conference on Theory and Applications of Satisfiability …, 2009
832009
Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT
CM Li, F Manya, J Planes
AAAI 6, 86-91, 2006
782006
The first and second Max-SAT evaluations
J Argelich, CM Li, F Manya, J Planes
Journal on Satisfiability, Boolean Modeling and Computation 4, 251-278, 2008
742008
Transformations between signed and classical clause logic
B Beckert, R Hahnle, F Manya
Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic …, 1999
631999
Solving the round robin problem using propositional logic
R Béjar, F Manya
AAAI/IAAI, 262-266, 2000
572000
Improved branch and bound algorithms for Max-SAT
T Alsinet, F Manya, J Planes
512003
Exact algorithms for MAX-SAT
H Zhang, H Shen, F Manyà Serres
Electronic Notes in Theoretical Computer Science, 2003, vol. 86, núm. 1, p …, 2003
502003
The SAT problem of signed CNF formulas
B Beckert, R Hähnle, F Manya
Labelled Deduction, 59-80, 2000
492000
Measuring the Hardness of SAT Instances.
C Ansótegui, ML Bonet, J Levy, F Manya
AAAI 8, 222-228, 2008
462008
Resolution-based lower bounds in MaxSAT
CM Li, F Manyà, NO Mohamedou, J Planes
Constraints 15 (4), 456-484, 2010
432010
Optimizing with minimum satisfiability
CM Li, Z Zhu, F Manyà, L Simon
Artificial Intelligence 190, 32-44, 2012
402012
Exact Max-SAT solvers for over-constrained problems
J Argelich, F Manyà
Journal of Heuristics 12 (4-5), 375-392, 2006
392006
A modular reduction of regular logic to classical logic
R Béjar, R Hahnle, F Manya
Proceedings 31st IEEE International Symposium on Multiple-Valued Logic, 221-226, 2001
392001
An effective learnt clause minimization approach for CDCL SAT solvers
M Luo, CM Li, F Xiao, F Manya, Z Lü
Proceedings of the 26th International Joint Conference on Artificial …, 2017
372017
A complete calculus for Max-SAT
ML Bonet, J Levy, F Manyà
International Conference on Theory and Applications of Satisfiability …, 2006
362006
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20