Sledovat
Felip Manyà
Felip Manyà
IIIA-CSIC
Žádná ověřená e-mailová adresa
Název
Citace
Citace
Rok
MaxSAT
C Li, F Manya
Handbook of satisfiability 12, 613-631, 2021
339*2021
New inference rules for Max-SAT
CM Li, F Manya, J Planes
Journal of Artificial Intelligence Research 30, 321-359, 2007
2292007
Resolution for max-sat
ML Bonet, J Levy, F Manyà
Artificial Intelligence 171 (8-9), 606-618, 2007
1562007
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
1402004
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
1132017
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
1112005
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
1052008
Exploiting cycle structures in Max-SAT
CM Li, F Manya, N Mohamedou, J Planes
International Conference on Theory and Applications of Satisfiability …, 2009
1022009
Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT
CM Li, F Manya, J Planes
AAAI 6, 86-91, 2006
972006
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
CM Li, H Jiang, F Manyà
Computers & Operations Research 84, 1-15, 2017
912017
An exact algorithm for the maximum weight clique problem in large graphs
H Jiang, CM Li, F Manya
Proceedings of the AAAI conference on artificial intelligence 31 (1), 2017
832017
Transformations between signed and classical clause logic
B Beckert, R Hahnle, F Manya
Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic …, 1999
761999
Measuring the Hardness of SAT Instances.
C Ansótegui, ML Bonet, J Levy, F Manya
AAAI 8, 222-228, 2008
722008
Resolution-based lower bounds in MaxSAT
CM Li, F Manya, NO Mohamedou, J Planes
Constraints 15 (4), 456-484, 2010
692010
Exact algorithms for MAX-SAT
H Zhang, H Shen, F Manyà
Electronic Notes in Theoretical Computer Science 86 (1), 190-203, 2003
672003
Optimizing with minimum satisfiability
CM Li, Z Zhu, F Manyà, L Simon
Artificial Intelligence 190, 32-44, 2012
662012
Solving the round robin problem using propositional logic
R Béjar, F Manya
AAAI/IAAI, 262-266, 2000
662000
The SAT problem of signed CNF formulas
B Beckert, R Hähnle, F Manya
Labelled Deduction, 59-80, 2000
662000
A complete calculus for Max-SAT
ML Bonet, J Levy, F Manyà
Theory and Applications of Satisfiability Testing-SAT 2006: 9th …, 2006
622006
Improved branch and bound algorithms for Max-SAT
T Alsinet
Sixth International Conference on Theory and Applications of Satisfiability …, 2003
582003
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20