| 2012 | ||
|---|---|---|
| 63 | Mikolás Janota, Inês Lynce, Vasco M. Manquinho, João Marques-Silva: PackUp: Tools for Package Upgradability Solving. JSAT 8(1/2): 89-94 (2012) | |
| 2011 | ||
| 62 | Conrad Drescher, Inês Lynce, Ralf Treinen: Proceedings Second Workshop on Logics for Component Configuration LoCoCo 2011 | |
| 61 | Ruben Martins, Vasco M. Manquinho, Inês Lynce: Exploiting Cardinality Encodings in Parallel Maximum Satisfiability. ICTAI 2011: 313-320 | |
| 60 | João P. Marques Silva, Inês Lynce: On Improving MUS Extraction Algorithms. SAT 2011: 159-173 | |
| 59 | Ana Graça, João Marques-Silva, Inês Lynce: Haplotype Inference Using Propositional Satisfiability. Mathematical Approaches to Polymer Sequence Analysis and Related Problems 2011: 127-147 | |
| 58 | João Marques-Silva, Josep Argelich, Ana Graça, Inês Lynce: Boolean lexicographic optimization: algorithms & applications. Ann. Math. Artif. Intell. 62(3-4): 317-343 (2011) | |
| 57 | Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira: Haplotype inference with pseudo-Boolean optimization. Annals OR 184(1): 137-162 (2011) | |
| 56 | Inês Lynce, João Marques-Silva: Restoring CSP Satisfiability with MaxSAT. Fundam. Inform. 107(2-3): 249-266 (2011) | |
| 2010 | ||
| 55 | Inês Lynce, Ralf Treinen: Proceedings First International Workshop on Logics for Component Configuration LoCoCo 2010 | |
| 54 | Ana Graça, Inês Lynce, João Marques-Silva, Arlindo L. Oliveira: Efficient and Accurate Haplotype Inference by Combining Parsimony and Pedigree Information. ANB 2010: 38-56 | |
| 53 | Paulo Trezentos, Inês Lynce, Arlindo L. Oliveira: Apt-pbo: solving the software dependency problem using pseudo-boolean optimization. ASE 2010: 427-436 | |
| 52 | João Marques-Silva, Mikolás Janota, Inês Lynce: On Computing Backbones of Propositional Theories. ECAI 2010: 15-20 | |
| 51 | Ruben Martins, Vasco M. Manquinho, Inês Lynce: Improving Search Space Splitting for Parallel SAT Solving. ICTAI (1) 2010: 336-343 | |
| 50 | Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: New Insights into Encodings from MaxCSP into Partial MaxSAT. ISMVL 2010: 46-52 | |
| 49 | Josep Argelich, Daniel Le Berre, Inês Lynce, João P. Marques Silva, Pascal Rapicault: Solving Linux Upgradeability Problems Using Boolean Optimization LoCoCo 2010: 11-22 | |
| 48 | Vasco M. Manquinho, Ruben Martins, Inês Lynce: Improving Unsatisfiability-Based Algorithms for Boolean Optimization. SAT 2010: 181-193 | |
| 47 | Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, Inês Lynce: The Seventh QBF Solvers Evaluation (QBFEVAL'10). SAT 2010: 237-250 | |
| 2009 | ||
| 46 | Josep Argelich, Inês Lynce, João P. Marques Silva: On Solving Boolean Multilevel Optimization Problemse. IJCAI 2009: 393-398 | |
| 45 | Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Regular Encodings from Max-CSP into Partial Max-SAT. ISMVL 2009: 196-202 | |
| 44 | David Pereira, Inês Lynce, Steven David Prestwich: On Improving Local Search for Unsatisfiability LSCS 2009: 41-53 | |
| 43 | João Delgado, Inês Lynce, Vasco M. Manquinho: Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes Using Pseudo-Boolean Optimization. RECOMB-CG 2009: 138-149 | |
| 42 | Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Sequential Encodings from Max-CSP into Partial Max-SAT. SAT 2009: 161-166 | |
| 41 | João P. Marques Silva, Inês Lynce, Sharad Malik: Conflict-Driven Clause Learning SAT Solvers. Handbook of Satisfiability 2009: 131-153 | |
| 40 | Josep Argelich, Inês Lynce, João P. Marques Silva: On Solving Boolean Multilevel Optimization Problems CoRR abs/0904.0019: (2009) | |
| 39 | Mark H. Liffiton, Maher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João Marques-Silva, Karem A. Sakallah: A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas. Constraints 14(4): 415-442 (2009) | |
| 2008 | ||
| 38 | Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira: Efficient Haplotype Inference with Combined CP and OR Techniques. CPAIOR 2008: 308-312 | |
| 37 | Inês Lynce, Ana Graça, João Marques-Silva, Arlindo L. Oliveira: Haplotype Inference with Boolean Constraint Solving: An Overview. ICTAI (1) 2008: 92-100 | |
| 36 | Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Encoding Max-CSP into Partial Max-SAT. ISMVL 2008: 106-111 | |
| 35 | João Marques-Silva, Inês Lynce, Vasco M. Manquinho: Symmetry Breaking for Maximum Satisfiability. LPAR 2008: 1-15 | |
| 34 | Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Modelling Max-CSP as Partial Max-SAT. SAT 2008: 1-14 | |
| 33 | Inês Lynce, Vasco M. Manquinho, João Marques-Silva: Backtracking. Wiley Encyclopedia of Computer Science and Engineering 2008 | |
| 32 | João Marques-Silva, Inês Lynce, Vasco M. Manquinho: Symmetry Breaking for Maximum Satisfiability CoRR abs/0804.0599: (2008) | |
| 31 | Inês Lynce, João Marques-Silva, Steven David Prestwich: Boosting Haplotype Inference with Local Search. Constraints 13(1-2): 155-179 (2008) | |
| 30 | Inês Lynce, João Marques-Silva: Haplotype Inference with Boolean Satisfiability. International Journal on Artificial Intelligence Tools 17(2): 355-387 (2008) | |
| 2007 | ||
| 29 | Steven David Prestwich, Inês Lynce: Refutation by Randomised General Resolution. AAAI 2007: 1667-1670 | |
| 28 | Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira: Efficient Haplotype Inference with Pseudo-boolean Optimization. AB 2007: 125-139 | |
| 27 | João P. Marques Silva, Inês Lynce: Towards Robust CNF Encodings of Cardinality Constraints. CP 2007: 483-497 | |
| 26 | João Marques-Silva, Inês Lynce, Ana Graça, Arlindo L. Oliveira: Efficient and Tight Upper Bounds for Haplotype Inference by Pure Parsimony Using Delayed Haplotype Selection. EPIA Workshops 2007: 621-632 | |
| 25 | Inês Lynce, João P. Marques Silva: Breaking Symmetries in SAT Matrix Models. SAT 2007: 22-27 | |
| 24 | Ian P. Gent, Christopher Jefferson, Tom Kelsey, Inês Lynce, Ian Miguel, Peter Nightingale, Barbara M. Smith, Armagan Tarim: Search in the patience game 'Black Hole'. AI Commun. 20(3): 211-226 (2007) | |
| 23 | João Marques-Silva, Karem A. Sakallah, Inês Lynce: Report on the SAT 2007 Conference on Theory and Applications of Satisfiability Testing. AI Magazine 28(4): 135-136 (2007) | |
| 22 | Inês Lynce, João P. Marques Silva: Random backtracking in backtrack search algorithms for satisfiability. Discrete Applied Mathematics 155(12): 1604-1612 (2007) | |
| 2006 | ||
| 21 | Inês Lynce, João Marques-Silva: Efficient Haplotype Inference with Boolean Satisfiability. AAAI 2006: 104-109 | |
| 20 | Inês Lynce, Joël Ouaknine: Sudoku as a SAT Problem. ISAIM 2006 | |
| 19 | Inês Lynce, João Marques-Silva: SAT in Bioinformatics: Making the Case with Haplotype Inference. SAT 2006: 136-141 | |
| 18 | Oliver Kullmann, Inês Lynce, João Marques-Silva: Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel. SAT 2006: 22-35 | |
| 17 | Steven David Prestwich, Inês Lynce: Local Search for Unsatisfiability. SAT 2006: 283-296 | |
| 16 | Inês Lynce: Propositional satisfiability: Techniques, algorithms and applications. AI Commun. 19(2): 187-189 (2006) | |
| 2005 | ||
| 15 | Maher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João P. Marques Silva, Karem A. Sakallah: A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas. SAT 2005: 467-474 | |
| 14 | Inês Lynce, João P. Marques Silva: Efficient data structures for backtrack search SAT solvers. Ann. Math. Artif. Intell. 43(1): 137-152 (2005) | |
| 13 | Ateet Bhalla, Inês Lynce, José T. de Sousa, João Marques-Silva: Heuristic-Based Backtracking Relaxation for Propositional Satisfiability. J. Autom. Reasoning 35(1-3): 3-24 (2005) | |
| 2004 | ||
| 12 | Inês Lynce, João P. Marques Silva: Hidden Structure in Unsatisfiable Random 3-SAT: An Empirical Study. ICTAI 2004: 246-251 | |
| 11 | Inês Lynce, João P. Marques Silva: On Computing Minimum Unsatisfiable Cores. SAT 2004 | |
| 2003 | ||
| 10 | Ateet Bhalla, Inês Lynce, José T. de Sousa, João P. Marques Silva: Heuristic-Based Backtracking for Propositional Satisfiability. EPIA 2003: 116-130 | |
| 9 | Inês Lynce, João P. Marques Silva: Probing-Based Preprocessing Techniques for Propositional Satisfiability. ICTAI 2003: 105- | |
| 8 | Ateet Bhalla, Inês Lynce, José T. de Sousa, João P. Marques Silva: Heuristic Backtracking Algorithms for SAT. MTV 2003: 69-74 | |
| 7 | Inês Lynce, João P. Marques Silva: An Overview of Backtrack Search Satisfiability Algorithms. Ann. Math. Artif. Intell. 37(3): 307-326 (2003) | |
| 2002 | ||
| 6 | Inês Lynce, João P. Marques Silva: Tuning Randomization in Backtrack Search SAT Algorithms. CP 2002: 769 | |
| 5 | Inês Lynce, João P. Marques Silva: Building State-of-the-Art SAT Solvers. ECAI 2002: 166-170 | |
| 4 | Inês Lynce, João P. Marques Silva: The Effect of Nogood Recording in DPLL-CBJ SAT Algorithms. International Workshop on Constraint Solving and Constraint Logic Programming 2002: 144-158 | |
| 2001 | ||
| 3 | Inês Lynce, João P. Marques Silva: Improving SAT Algorithms by Using Search Pruning Techniques. CP 2001: 770 | |
| 2 | Inês Lynce, Luís Baptista, João P. Marques Silva: Towards Provably Complete Stochastic Search Algorithms for Satisfiability. EPIA 2001: 363-370 | |
| 1 | Inês Lynce, Luís Baptista, João Marques-Silva: Stochastic Systematic Search Algorithms for Satisfiability. Electronic Notes in Discrete Mathematics 9: 190-204 (2001) | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page