Felip Manya
Felip Manya
IIIA-CSIC
No hay ninguna dirección de correo electrónico verificada.
Título
Citado por
Citado por
Año
MaxSAT, Hard and Soft Constraints.
CM Li, F Manya
Handbook of satisfiability 185, 613-631, 2009
1962009
New inference rules for Max-SAT
CM Li, F Manya, J Planes
Journal of Artificial Intelligence Research 30, 321-359, 2007
1872007
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
1032004
Resolution for max-sat
ML Bonet, J Levy, F Manyà
Artificial Intelligence 171 (8-9), 606-618, 2007
922007
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
912005
Exploiting cycle structures in Max-SAT
CM Li, F Manya, N Mohamedou, J Planes
International Conference on Theory and Applications of Satisfiability …, 2009
852009
Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT
CM Li, F Manya, J Planes
AAAI 6, 86-91, 2006
792006
The first and second Max-SAT evaluations
J Argelich, CM Li, F Manya, J Planes
Journal on Satisfiability, Boolean Modeling and Computation 4 (2-4), 251-278, 2008
782008
Transformations between signed and classical clause logic
B Beckert, R Hahnle, F Manya
Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic …, 1999
621999
Solving the round robin problem using propositional logic
R Béjar, F Manya
AAAI/IAAI, 262-266, 2000
592000
Exact algorithms for MAX-SAT
H Zhang, H Shen, F Manya
Electronic Notes in Theoretical Computer Science 86 (1), 190-203, 2003
532003
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
522017
Measuring the Hardness of SAT Instances.
C Ansótegui, ML Bonet, J Levy, F Manya
AAAI 8, 222-228, 2008
502008
Improved branch and bound algorithms for Max-SAT
T Alsinet, F Manya, J Planes
492003
The SAT problem of signed CNF formulas
B Beckert, R Hähnle, F Manya
Labelled Deduction, 59-80, 2000
482000
Resolution-based lower bounds in MaxSAT
CM Li, F Manyà, NO Mohamedou, J Planes
Constraints 15 (4), 456-484, 2010
452010
Optimizing with minimum satisfiability
CM Li, Z Zhu, F Manyà, L Simon
Artificial Intelligence 190, 32-44, 2012
412012
An exact algorithm for the maximum weight clique problem in large graphs
H Jiang, CM Li, F Manya
Thirty-First AAAI Conference on Artificial Intelligence, 2017
402017
Exact Max-SAT solvers for over-constrained problems
J Argelich, F Manyà
Journal of Heuristics 12 (4-5), 375-392, 2006
402006
Improved exact solvers for weighted Max-SAT
T Alsinet, F Manyà, J Planes
International Conference on Theory and Applications of Satisfiability …, 2005
402005
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20