Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Inês Lynce
2010 – today
- 2013
[c47]Ruben Martins, Vasco M. Manquinho, Inês Lynce: Community-Based Partitioning for MaxSAT Solving. SAT 2013: 182-191- 2012
- [j21]Ruben Martins, Vasco M. Manquinho, Inês Lynce: Parallel search for maximum satisfiability. AI Commun. 25(2): 75-95 (2012)
- [j20]Anton Belov, Inês Lynce, João Marques-Silva: Towards efficient MUS extraction. AI Commun. 25(2): 97-116 (2012)
- [j19]Ruben Martins, Vasco M. Manquinho, Inês Lynce: An overview of parallel SAT solving. Constraints 17(3): 304-347 (2012)
- [j18]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)
- [j17]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT. Multiple-Valued Logic and Soft Computing 19(1-3): 3-23 (2012)
- [c46]Anton Belov, Mikolás Janota, Inês Lynce, João Marques-Silva: On Computing Minimal Equivalent Subformulas. CP 2012: 158-174
- [c45]João Guerra, Inês Lynce: Reasoning over Biological Networks Using Maximum Satisfiability. CP 2012: 941-956
- [c44]
- [c43]Ruben Martins, Vasco M. Manquinho, Inês Lynce: On Partitioning for Maximum Satisfiability. ECAI 2012: 913-914
- [c42]Ruben Martins, Vasco M. Manquinho, Inês Lynce: Clause Sharing in Parallel MaxSAT. LION 2012: 455-460
- [i3]Rui Henriques, Inês Lynce, Vasco M. Manquinho: On When and How to use SAT to Mine Frequent Itemsets. CoRR abs/1207.6253 (2012)
- 2011
- [j16]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)
- [j15]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)
- [j14]Inês Lynce, João Marques-Silva: Restoring CSP Satisfiability with MaxSAT. Fundam. Inform. 107(2-3): 249-266 (2011)
- [c41]Ruben Martins, Vasco M. Manquinho, Inês Lynce: Exploiting Cardinality Encodings in Parallel Maximum Satisfiability. ICTAI 2011: 313-320
- [c40]
- [p3]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
- [e2]Conrad Drescher, Inês Lynce, Ralf Treinen (Eds.): Proceedings Second Workshop on Logics for Component Configuration. EPTCS 65, 2011
- 2010
- [j13]Ana Graça, Inês Lynce, João Marques-Silva, Arlindo L. Oliveira: Haplotype Inference by Pure Parsimony: A Survey. Journal of Computational Biology 17(8): 969-992 (2010)
- [j12]João Delgado, Inês Lynce, Vasco M. Manquinho: Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes. Journal of Computational Biology 17(9): 1243-1265 (2010)
- [c39]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
- [c38]João Marques-Silva, Mikolás Janota, Inês Lynce: On Computing Backbones of Propositional Theories. ECAI 2010: 15-20
- [c37]Ruben Martins, Vasco M. Manquinho, Inês Lynce: Improving Search Space Splitting for Parallel SAT Solving. ICTAI (1) 2010: 336-343
- [c36]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: New Insights into Encodings from MaxCSP into Partial MaxSAT. ISMVL 2010: 46-52
- [c35]Paulo Trezentos, Inês Lynce, Arlindo L. Oliveira: Apt-pbo: solving the software dependency problem using pseudo-boolean optimization. ASE 2010: 427-436
- [c34]Vasco M. Manquinho, Ruben Martins, Inês Lynce: Improving Unsatisfiability-Based Algorithms for Boolean Optimization. SAT 2010: 181-193
- [c33]Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, Inês Lynce: The Seventh QBF Solvers Evaluation (QBFEVAL'10). SAT 2010: 237-250
- [c32]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
- [e1]Inês Lynce, Ralf Treinen (Eds.): Proceedings First International Workshop on Logics for Component Configuration. EPTCS 29, 2010
2000 – 2009
- 2009
- [j11]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)
- [c31]Josep Argelich, Inês Lynce, João P. Marques Silva: On Solving Boolean Multilevel Optimization Problemse. IJCAI 2009: 393-398
- [c30]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Regular Encodings from Max-CSP into Partial Max-SAT. ISMVL 2009: 196-202
- [c29]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
- [c28]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Sequential Encodings from Max-CSP into Partial Max-SAT. SAT 2009: 161-166
- [c27]David Pereira, Inês Lynce, Steven David Prestwich: On Improving Local Search for Unsatisfiability. LSCS 2009: 41-53
- [p2]João P. Marques Silva, Inês Lynce, Sharad Malik: Conflict-Driven Clause Learning SAT Solvers. Handbook of Satisfiability 2009: 131-153
- [i2]Josep Argelich, Inês Lynce, João P. Marques Silva: On Solving Boolean Multilevel Optimization Problems. CoRR abs/0904.0019 (2009)
- 2008
- [j10]Inês Lynce, João Marques-Silva, Steven David Prestwich: Boosting Haplotype Inference with Local Search. Constraints 13(1-2): 155-179 (2008)
- [j9]Inês Lynce, João Marques-Silva: Haplotype Inference with Boolean Satisfiability. International Journal on Artificial Intelligence Tools 17(2): 355-387 (2008)
- [c26]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
- [c25]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
- [c24]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Encoding Max-CSP into Partial Max-SAT. ISMVL 2008: 106-111
- [c23]João Marques-Silva, Inês Lynce, Vasco M. Manquinho: Symmetry Breaking for Maximum Satisfiability. LPAR 2008: 1-15
- [c22]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Modelling Max-CSP as Partial Max-SAT. SAT 2008: 1-14
- [p1]Inês Lynce, Vasco M. Manquinho, João Marques-Silva: Backtracking. Wiley Encyclopedia of Computer Science and Engineering 2008
- [i1]João Marques-Silva, Inês Lynce, Vasco M. Manquinho: Symmetry Breaking for Maximum Satisfiability. CoRR abs/0804.0599 (2008)
- 2007
- [j8]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)
- [j7]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)
- [j6]Inês Lynce, João P. Marques Silva: Random backtracking in backtrack search algorithms for satisfiability. Discrete Applied Mathematics 155(12): 1604-1612 (2007)
- [c21]Steven David Prestwich, Inês Lynce: Refutation by Randomised General Resolution. AAAI 2007: 1667-1670
- [c20]Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira: Efficient Haplotype Inference with Pseudo-boolean Optimization. AB 2007: 125-139
- [c19]João P. Marques Silva, Inês Lynce: Towards Robust CNF Encodings of Cardinality Constraints. CP 2007: 483-497
- [c18]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
- [c17]
- 2006
- [j5]Inês Lynce: Propositional satisfiability: Techniques, algorithms and applications. AI Commun. 19(2): 187-189 (2006)
- [c16]Inês Lynce, João Marques-Silva: Efficient Haplotype Inference with Boolean Satisfiability. AAAI 2006: 104-109
- [c15]
- [c14]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
- [c13]Inês Lynce, João Marques-Silva: SAT in Bioinformatics: Making the Case with Haplotype Inference. SAT 2006: 136-141
- [c12]
- 2005
- [j4]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)
- [j3]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)
- [c11]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
- 2004
- [c10]Inês Lynce, João P. Marques Silva: Hidden Structure in Unsatisfiable Random 3-SAT: An Empirical Study. ICTAI 2004: 246-251
- [c9]
- 2003
- [j2]Inês Lynce, João P. Marques Silva: An Overview of Backtrack Search Satisfiability Algorithms. Ann. Math. Artif. Intell. 37(3): 307-326 (2003)
- [c8]Ateet Bhalla, Inês Lynce, José T. de Sousa, João P. Marques Silva: Heuristic-Based Backtracking for Propositional Satisfiability. EPIA 2003: 116-130
- [c7]Inês Lynce, João P. Marques Silva: Probing-Based Preprocessing Techniques for Propositional Satisfiability. ICTAI 2003: 105-
- [c6]Ateet Bhalla, Inês Lynce, José T. de Sousa, João P. Marques Silva: Heuristic Backtracking Algorithms for SAT. MTV 2003: 69-74
- 2002
- [c5]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
- [c4]Inês Lynce, João P. Marques Silva: Tuning Randomization in Backtrack Search SAT Algorithms. CP 2002: 769
- [c3]
- 2001
- [j1]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)
- [c2]Inês Lynce, João P. Marques Silva: Improving SAT Algorithms by Using Search Pruning Techniques. CP 2001: 770
- [c1]Inês Lynce, Luís Baptista, João P. Marques Silva: Towards Provably Complete Stochastic Search Algorithms for Satisfiability. EPIA 2001: 363-370
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:15 CEST by the dblp team