The SCEAS System
| |||||||

## Search the dblp DataBase
Inês Lynce:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Inês Lynce, João Marques-Silva
**Efficient Haplotype Inference with Boolean Satisfiability.**[Citation Graph (0, 0)][DBLP] AAAI, 2006, pp:- [Conf] - Inês Lynce, João P. Marques Silva
**The Effect of Nogood Recording in DPLL-CBJ SAT Algorithms.**[Citation Graph (0, 0)][DBLP] International Workshop on Constraint Solving and Constraint Logic Programming, 2002, pp:144-158 [Conf] - Inês Lynce, João P. Marques Silva
**Improving SAT Algorithms by Using Search Pruning Techniques.**[Citation Graph (0, 0)][DBLP] CP, 2001, pp:770- [Conf] - Inês Lynce, João P. Marques Silva
**Tuning Randomization in Backtrack Search SAT Algorithms.**[Citation Graph (0, 0)][DBLP] CP, 2002, pp:769- [Conf] - Inês Lynce, João P. Marques Silva
**Building State-of-the-Art SAT Solvers.**[Citation Graph (0, 0)][DBLP] ECAI, 2002, pp:166-170 [Conf] - Ateet Bhalla, Inês Lynce, José T. de Sousa, João P. Marques Silva
**Heuristic-Based Backtracking for Propositional Satisfiability.**[Citation Graph (0, 0)][DBLP] EPIA, 2003, pp:116-130 [Conf] - Inês Lynce, Luís Baptista, João P. Marques Silva
**Towards Provably Complete Stochastic Search Algorithms for Satisfiability.**[Citation Graph (0, 0)][DBLP] EPIA, 2001, pp:363-370 [Conf] - Inês Lynce, João P. Marques Silva
**Hidden Structure in Unsatisfiable Random 3-SAT: An Empirical Study.**[Citation Graph (0, 0)][DBLP] ICTAI, 2004, pp:246-251 [Conf] - Inês Lynce, João P. Marques Silva
**Probing-Based Preprocessing Techniques for Propositional Satisfiability.**[Citation Graph (0, 0)][DBLP] ICTAI, 2003, pp:105-0 [Conf] - Ateet Bhalla, Inês Lynce, José T. de Sousa, João P. Marques Silva
**Heuristic Backtracking Algorithms for SAT.**[Citation Graph (0, 0)][DBLP] MTV, 2003, pp:69-74 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] SAT, 2006, pp:22-35 [Conf] - Inês Lynce, João P. Marques Silva
**On Computing Minimum Unsatisfiable Cores.**[Citation Graph (0, 0)][DBLP] SAT, 2004, pp:- [Conf] - Inês Lynce, João Marques-Silva
**SAT in Bioinformatics: Making the Case with Haplotype Inference.**[Citation Graph (0, 0)][DBLP] SAT, 2006, pp:136-141 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] SAT, 2005, pp:467-474 [Conf] - Steven David Prestwich, Inês Lynce
**Local Search for Unsatisfiability.**[Citation Graph (0, 0)][DBLP] SAT, 2006, pp:283-296 [Conf] - Inês Lynce
**Propositional satisfiability: Techniques, algorithms and applications.**[Citation Graph (0, 0)][DBLP] AI Commun., 2006, v:19, n:2, pp:187-189 [Journal] - Inês Lynce, João P. Marques Silva
**Efficient data structures for backtrack search SAT solvers.**[Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:137-152 [Journal] - Inês Lynce, João P. Marques Silva
**An Overview of Backtrack Search Satisfiability Algorithms.**[Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 2003, v:37, n:3, pp:307-326 [Journal] - Ateet Bhalla, Inês Lynce, José T. de Sousa, João Marques-Silva
**Heuristic-Based Backtracking Relaxation for Propositional Satisfiability.**[Citation Graph (0, 0)][DBLP] J. Autom. Reasoning, 2005, v:35, n:1-3, pp:3-24 [Journal] - Steven David Prestwich, Inês Lynce
**Refutation by Randomised General Resolution.**[Citation Graph (0, 0)][DBLP] AAAI, 2007, pp:1667-1670 [Conf] - João P. Marques Silva, Inês Lynce
**Towards Robust CNF Encodings of Cardinality Constraints.**[Citation Graph (0, 0)][DBLP] CP, 2007, pp:483-497 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] EPIA Workshops, 2007, pp:621-632 [Conf] - Inês Lynce, João P. Marques Silva
**Breaking Symmetries in SAT Matrix Models.**[Citation Graph (0, 0)][DBLP] SAT, 2007, pp:22-27 [Conf] - Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira
**Efficient Haplotype Inference with Pseudo-boolean Optimization.**[Citation Graph (0, 0)][DBLP] AB, 2007, pp:125-139 [Conf] - 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'.**[Citation Graph (0, 0)][DBLP] AI Commun., 2007, v:20, n:3, pp:211-226 [Journal] - Inês Lynce, João P. Marques Silva
**Random backtracking in backtrack search algorithms for satisfiability.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:12, pp:1604-1612 [Journal] **Efficient Haplotype Inference with Combined CP and OR Techniques.**[Citation Graph (, )][DBLP]**On Computing Backbones of Propositional Theories.**[Citation Graph (, )][DBLP]**Haplotype Inference with Boolean Constraint Solving: An Overview.**[Citation Graph (, )][DBLP]**On Solving Boolean Multilevel Optimization Problemse.**[Citation Graph (, )][DBLP]**Encoding Max-CSP into Partial Max-SAT.**[Citation Graph (, )][DBLP]**Regular Encodings from Max-CSP into Partial Max-SAT.**[Citation Graph (, )][DBLP]**New Insights into Encodings from MaxCSP into Partial MaxSAT.**[Citation Graph (, )][DBLP]**Apt-pbo: solving the software dependency problem using pseudo-boolean optimization.**[Citation Graph (, )][DBLP]**Symmetry Breaking for Maximum Satisfiability.**[Citation Graph (, )][DBLP]**Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes Using Pseudo-Boolean Optimization.**[Citation Graph (, )][DBLP]**Sequential Encodings from Max-CSP into Partial Max-SAT.**[Citation Graph (, )][DBLP]**Modelling Max-CSP as Partial Max-SAT.**[Citation Graph (, )][DBLP]**The Seventh QBF Solvers Evaluation (QBFEVAL'10).**[Citation Graph (, )][DBLP]**Improving Unsatisfiability-Based Algorithms for Boolean Optimization.**[Citation Graph (, )][DBLP]**Boosting Haplotype Inference with Local Search.**[Citation Graph (, )][DBLP]**A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas.**[Citation Graph (, )][DBLP]**Symmetry Breaking for Maximum Satisfiability**[Citation Graph (, )][DBLP]**On Solving Boolean Multilevel Optimization Problems**[Citation Graph (, )][DBLP]**On Improving Local Search for Unsatisfiability**[Citation Graph (, )][DBLP]**Proceedings First International Workshop on Logics for Component Configuration**[Citation Graph (, )][DBLP]**Solving Linux Upgradeability Problems Using Boolean Optimization**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |