Inês Lynce

2009
37	EE	Josep Argelich, Inês Lynce, João P. Marques Silva: On Solving Boolean Multilevel Optimization Problems CoRR abs/0904.0019: (2009)
2008
36	EE	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
35	EE	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
34	EE	Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Encoding Max-CSP into Partial Max-SAT. ISMVL 2008: 106-111
33	EE	João Marques-Silva, Inês Lynce, Vasco M. Manquinho: Symmetry Breaking for Maximum Satisfiability. LPAR 2008: 1-15
32	EE	Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà: Modelling Max-CSP as Partial Max-SAT. SAT 2008: 1-14
31	EE	Inês Lynce, Vasco M. Manquinho, João Marques-Silva: Backtracking. Wiley Encyclopedia of Computer Science and Engineering 2008
30	EE	João Marques-Silva, Inês Lynce, Vasco M. Manquinho: Symmetry Breaking for Maximum Satisfiability CoRR abs/0804.0599: (2008)
29	EE	Inês Lynce, João Marques-Silva, Steven David Prestwich: Boosting Haplotype Inference with Local Search. Constraints 13(1-2): 155-179 (2008)
28	EE	Inês Lynce, João Marques-Silva: Haplotype Inference with Boolean Satisfiability. International Journal on Artificial Intelligence Tools 17(2): 355-387 (2008)
2007
27		Steven David Prestwich, Inês Lynce: Refutation by Randomised General Resolution. AAAI 2007: 1667-1670
26	EE	Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira: Efficient Haplotype Inference with Pseudo-boolean Optimization. AB 2007: 125-139
25	EE	João P. Marques Silva, Inês Lynce: Towards Robust CNF Encodings of Cardinality Constraints. CP 2007: 483-497
24	EE	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
23	EE	Inês Lynce, João P. Marques Silva: Breaking Symmetries in SAT Matrix Models. SAT 2007: 22-27
22	EE	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)
21	EE	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
20		Inês Lynce, João Marques-Silva: Efficient Haplotype Inference with Boolean Satisfiability. AAAI 2006
19	EE	Inês Lynce, João Marques-Silva: SAT in Bioinformatics: Making the Case with Haplotype Inference. SAT 2006: 136-141
18	EE	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	EE	Steven David Prestwich, Inês Lynce: Local Search for Unsatisfiability. SAT 2006: 283-296
16	EE	Inês Lynce: Propositional satisfiability: Techniques, algorithms and applications. AI Commun. 19(2): 187-189 (2006)
2005
15	EE	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	EE	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	EE	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	EE	Inês Lynce, João P. Marques Silva: Hidden Structure in Unsatisfiable Random 3-SAT: An Empirical Study. ICTAI 2004: 246-251
11	EE	Inês Lynce, João P. Marques Silva: On Computing Minimum Unsatisfiable Cores. SAT 2004
2003
10	EE	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	EE	Inês Lynce, João P. Marques Silva: Probing-Based Preprocessing Techniques for Propositional Satisfiability. ICTAI 2003: 105-
8	EE	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	EE	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	EE	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	EE	Inês Lynce, João P. Marques Silva: Improving SAT Algorithms by Using Search Pruning Techniques. CP 2001: 770
2	EE	Inês Lynce, Luís Baptista, João P. Marques Silva: Towards Provably Complete Stochastic Search Algorithms for Satisfiability. EPIA 2001: 363-370
1	EE	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)

Coauthor Index

1	Zaher S. Andraus	[15]
2	Josep Argelich	[32] [34] [37]
3	Luís Baptista	[1] [2]
4	Ateet Bhalla	[8] [10] [13]
5	Alba Cabiscol	[32] [34]
6	Ian P. Gent	[22]
7	Ana Graça	[24] [26] [35] [36]
8	Christopher Jefferson	[22]
9	Tom Kelsey	[22]
10	Oliver Kullmann	[18]
11	Vasco M. Manquinho	[30] [31] [33]
12	Felip Manyà	[32] [34]
13	Ian Miguel	[22]
14	Maher N. Mneimneh	[15]
15	Peter Nightingale	[22]
16	Arlindo L. Oliveira	[24] [26] [35] [36]
17	Steven David Prestwich	[17] [27] [29]
18	Karem A. Sakallah	[15]
19	João P. Marques Silva (João Marques-Silva)	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [18] [19] [20] [21] [23] [24] [25] [26] [28] [29] [30] [31] [33] [35] [36] [37]
20	Barbara M. Smith	[22]
21	José T. de Sousa	[8] [10] [13]
22	Armagan Tarim	[22]