Follow
Ines Lynce
Ines Lynce
INESC-ID, Instituto Superior Técnico (IST), Universidade de Lisboa
Verified email at tecnico.ulisboa.pt - Homepage
Title
Cited by
Cited by
Year
Conflict-driven clause learning SAT solvers
J Marques-Silva, I Lynce, S Malik
Handbook of satisfiability, 133-182, 2021
6272021
Open-WBO: A Modular MaxSAT Solver,
R Martins, V Manquinho, I Lynce
Theory and Applications of Satisfiability Testing–SAT 2014: 17th …, 2014
2512014
Sudoku as a SAT Problem.
I Lynce, J Ouaknine
AI&M, 2006
2292006
On computing minimum unsatisfiable cores
I Lynce, JP Marques-Silva
1892004
Towards robust CNF encodings of cardinality constraints
J Marques-Silva, I Lynce
Principles and Practice of Constraint Programming–CP 2007: 13th …, 2007
1492007
Efficient haplotype inference with Boolean satisfiability
I Lynce, J Marques-Silva
National conference on artificial intelligence (AAAI), 2006
1222006
Incremental cardinality constraints for MaxSAT
R Martins, S Joshi, V Manquinho, I Lynce
Principles and Practice of Constraint Programming: 20th International …, 2014
1142014
Boolean lexicographic optimization: algorithms & applications
J Marques-Silva, J Argelich, A Graça, I Lynce
Annals of Mathematics and Artificial Intelligence 62, 317-343, 2011
1112011
Towards efficient MUS extraction
A Belov, I Lynce, J Marques-Silva
AI Communications 25 (2), 97-116, 2012
1082012
Probing-based preprocessing techniques for propositional satisfiability
I Lynce, J Marques-Silva
Proceedings. 15th IEEE International Conference on Tools with Artificial …, 2003
1022003
On improving MUS extraction algorithms
J Marques-Silva, I Lynce
International Conference on Theory and Applications of Satisfiability …, 2011
912011
SAT in bioinformatics: Making the case with haplotype inference
I Lynce, J Marques-Silva
International Conference on Theory and Applications of Satisfiability …, 2006
902006
An overview of parallel SAT solving
R Martins, V Manquinho, I Lynce
Constraints 17, 304-347, 2012
832012
Solving linux upgradeability problems using boolean optimization
J Argelich, DL Berre, I Lynce, J Marques-Silva, P Rapicault
arXiv preprint arXiv:1007.1021, 2010
812010
Algorithms for computing backbones of propositional formulae
M Janota, I Lynce, J Marques-Silva
Ai Communications 28 (2), 161-177, 2015
732015
A branch-and-bound algorithm for extracting smallest minimal unsatisfiable formulas
M Mneimneh, I Lynce, Z Andraus, J Marques-Silva, K Sakallah
Theory and Applications of Satisfiability Testing: 8th International …, 2005
712005
Efficient data structures for backtrack search SAT solvers
I Lynce, J Marques-Silva
Annals of Mathematics and Artificial Intelligence 43, 137-152, 2005
652005
On Computing Backbones of Propositional Theories.
J Marques-Silva, M Janota, I Lynce
ECAI 215, 15-20, 2010
602010
Categorisation of clauses in conjunctive normal forms: Minimally unsatisfiable sub-clause-sets and the lean kernel
O Kullmann, I Lynce, J Marques-Silva
Theory and Applications of Satisfiability Testing-SAT 2006: 9th …, 2006
572006
Local search for unsatisfiability
S Prestwich, I Lynce
International conference on theory and applications of satisfiability …, 2006
512006
The system can't perform the operation now. Try again later.
Articles 1–20