Ines Lynce
Ines Lynce
INESC-ID / IST, Universidade de Lisboa
Dirección de correo verificada de tecnico.ulisboa.pt - Página principal
Título
Citado por
Citado por
Año
Conflict-driven clause learning SAT solvers
J Marques-Silva, I Lynce, S Malik
Handbook of satisfiability, 131-153, 2009
3922009
Sudoku as a SAT Problem.
I Lynce, J Ouaknine
ISAIM, 2006
1802006
Open-WBO: A modular MaxSAT solver
R Martins, V Manquinho, I Lynce
International Conference on Theory and Applications of Satisfiability …, 2014
1652014
On computing minimum unsatisfiable cores
I Lynce, JP Marques-Silva
1652004
Towards robust CNF encodings of cardinality constraints
J Marques-Silva, I Lynce
International Conference on Principles and Practice of Constraint …, 2007
1312007
Efficient haplotype inference with Boolean satisfiability
I Lynce, J Marques-Silva
National Conference on Artificial Intelligence (AAAI), 2006
1042006
Towards efficient MUS extraction
A Belov, I Lynce, J Marques-Silva
AI Communications 25 (2), 97-116, 2012
882012
Probing-based preprocessing techniques for propositional satisfiability
I Lynce, J Marques-Silva
Proceedings. 15th IEEE International Conference on Tools with Artificial …, 2003
882003
Incremental cardinality constraints for MaxSAT
R Martins, S Joshi, V Manquinho, I Lynce
International Conference on Principles and Practice of Constraint …, 2014
752014
On improving MUS extraction algorithms
J Marques-Silva, I Lynce
International Conference on Theory and Applications of Satisfiability …, 2011
752011
SAT in bioinformatics: Making the case with haplotype inference
I Lynce, J Marques-Silva
International Conference on Theory and Applications of Satisfiability …, 2006
742006
An overview of parallel SAT solving
R Martins, V Manquinho, I Lynce
Constraints 17 (3), 304-347, 2012
692012
Boolean lexicographic optimization: algorithms & applications
J Marques-Silva, J Argelich, A Graça, I Lynce
Annals of Mathematics and Artificial Intelligence 62 (3), 317-343, 2011
692011
Solving Linux upgradeability problems using boolean optimization
J Argelich, DL Berre, I Lynce, J Marques-Silva, P Rapicault
arXiv preprint arXiv:1007.1021, 2010
642010
A branch-and-bound algorithm for extracting smallest minimal unsatisfiable formulas
M Mneimneh, I Lynce, Z Andraus, J Marques-Silva, K Sakallah
International Conference on Theory and Applications of Satisfiability …, 2005
642005
Categorisation of clauses in conjunctive normal forms: Minimally unsatisfiable sub-clause-sets and the lean kernel
O Kullmann, I Lynce, J Marques-Silva
International Conference on Theory and Applications of Satisfiability …, 2006
572006
Efficient data structures for backtrack search SAT solvers
I Lynce, J Marques-Silva
Annals of Mathematics and Artificial Intelligence 43 (1), 137-152, 2005
562005
On Computing Backbones of Propositional Theories.
J Marques-Silva, M Janota, I Lynce
ECAI 215, 15-20, 2010
522010
Algorithms for computing backbones of propositional formulae
M Janota, I Lynce, J Marques-Silva
Ai Communications 28 (2), 161-177, 2015
472015
Conflict-driven clause learning sat solvers
A Biere, M Heule, H van Maaren, T Walsh
Handbook of Satisfiability, Frontiers in Artificial Intelligence and …, 2009
472009
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20