default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInês Lynce
Person information
- affiliation: University of Lissabon, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j37]Alexandre Lemos, Filipe Gouveia
, Pedro T. Monteiro, Inês Lynce:
Iterative Train Scheduling under Disruption with Maximum Satisfiability. J. Artif. Intell. Res. 79: 1047-1090 (2024)- [j36]Daniel Ramos, Inês Lynce, Vasco Manquinho, Ruben Martins, Claire Le Goues:
BatFix: Repairing language model-based transpilation. ACM Trans. Softw. Eng. Methodol. 33(6): 161 (2024) - [c78]João Cortes, Inês Lynce, Vasco Manquinho:
Slide&Drill, a New Approach for Multi-Objective Combinatorial Optimization. CP 2024: 8:1-8:17 - [c77]Margarida Ferreira, Ranysha Ware, Yash Kothari, Inês Lynce, Ruben Martins, Akshay Narayan, Justine Sherry:
Reverse-Engineering Congestion Control Algorithm Behavior. IMC 2024: 401-414 - 2023
- [j35]Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten, Cristina Bazgan, Inês Lynce, Vasco Manquinho, José Rui Figueira:
Exact and approximate determination of the Pareto front using Minimal Correction Subsets. Comput. Oper. Res. 153: 106153 (2023) - [c76]Daniel Ramos, Hailie Mitchell, Inês Lynce, Vasco Manquinho, Ruben Martins, Claire Le Goues:
MELT: Mining Effective Lightweight Transformations from Pull Requests. ASE 2023: 1516-1528 - [c75]João Cortes, Inês Lynce, Vasco Manquinho:
New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization. TACAS (2) 2023: 55-73 - [i13]Daniel Ramos, Hailie Mitchell, Inês Lynce, Vasco Manquinho, Ruben Martins, Claire Le Goues:
MELT: Mining Effective Lightweight Transformations from Pull Requests. CoRR abs/2308.14687 (2023) - [i12]Marijn J. H. Heule, Inês Lynce, Stefan Szeider, André Schidler:
SAT Encodings and Beyond (Dagstuhl Seminar 23261). Dagstuhl Reports 13(6): 106-122 (2023) - 2022
- [j34]Leonor Silva, Magda Resende, Helena Galhardas, Vasco Manquinho, Inês Lynce:
DeepData: Machine learning in the marine ecosystems. Expert Syst. Appl. 206: 117841 (2022) - [j33]Alexandre Lemos, Pedro T. Monteiro, Inês Lynce:
Introducing UniCorT: an iterative university course timetabling tool with MaxSAT. J. Sched. 25(4): 371-390 (2022) - [i11]Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten, Cristina Bazgan, Inês Lynce, Vasco Manquinho, José Rui Figueira:
Exact and approximate determination of the Pareto set using minimal correction subsets. CoRR abs/2204.06908 (2022) - [i10]João Cortes, Inês Lynce, Vasco Manquinho:
New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization. CoRR abs/2204.10856 (2022) - 2021
- [j32]Alexandre Lemos, Pedro T. Monteiro, Inês Lynce:
Disruptions in timetables: a case study at Universidade de Lisboa. J. Sched. 24(1): 35-48 (2021) - [c74]Margarida Ferreira, Akshay Narayan, Inês Lynce, Ruben Martins, Justine Sherry:
Counterfeiting Congestion Control Algorithms. HotNets 2021: 132-139 - [c73]Ansong Ni, Daniel Ramos, Aidan Z. H. Yang, Inês Lynce, Vasco Manquinho, Ruben Martins, Claire Le Goues:
SOAR: A Synthesis Approach for Data Science API Refactoring. ICSE 2021: 112-124 - [c72]Ansong Ni, Daniel Ramos, Aidan Z. H. Yang, Inês Lynce, Vasco Manquinho, Ruben Martins, Claire Le Goues:
Replication of SOAR: A Synthesis Approach for Data Science API Refactoring. ICSE (Companion Volume) 2021: 190-191 - [c71]Margarida Ferreira, Miguel Terra-Neves, Miguel Ventura, Inês Lynce, Ruben Martins:
FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions. TACAS (1) 2021: 152-169 - [p6]João Marques-Silva, Inês Lynce, Sharad Malik:
Conflict-Driven Clause Learning SAT Solvers. Handbook of Satisfiability 2021: 133-182 - [i9]Ansong Ni, Daniel Ramos, Aidan Z. H. Yang, Inês Lynce, Vasco Manquinho, Ruben Martins, Claire Le Goues:
SOAR: A Synthesis Approach for Data Science API Refactoring. CoRR abs/2102.06726 (2021) - 2020
- [j31]Filipe Gouveia, Inês Lynce, Pedro T. Monteiro:
Revision of Boolean Models of Regulatory Networks Using Stable State Observations. J. Comput. Biol. 27(2): 144-155 (2020) - [c70]Filipe Gouveia, Inês Lynce, Pedro T. Monteiro:
ModRev - Model Revision Tool for Boolean Logical Models of Biological Regulatory Networks. CMSB 2020: 339-348 - [c69]Alexandre Lemos, Pedro T. Monteiro, Inês Lynce:
Minimal Perturbation in University Timetabling with Maximum Satisfiability. CPAIOR 2020: 317-333 - [c68]Daniel Ramos, Jorge Pereira, Inês Lynce, Vasco Manquinho, Ruben Martins:
UNCHARTIT: An Interactive Framework for Program Recovery from Charts. ASE 2020: 175-186 - [i8]Margarida Ferreira, Miguel Terra-Neves, Miguel Ventura, Inês Lynce, Ruben Martins:
FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions. CoRR abs/2012.14235 (2020)
2010 – 2019
- 2019
- [j30]Alexandre Lemos, Inês Lynce, Pedro T. Monteiro:
Repairing Boolean logical models from time-series data using Answer Set Programming. Algorithms Mol. Biol. 14(1): 9:1-9:16 (2019) - [j29]Miguel Terra-Neves, Inês Lynce, Vasco Manquinho:
Virtual machine consolidation using constraint-based multi-objective optimization. J. Heuristics 25(3): 339-375 (2019) - [c67]Miguel Terra-Neves, Nuno Machado, Inês Lynce, Vasco Manquinho:
Concurrency Debugging with MaxSMT. AAAI 2019: 1608-1616 - [c66]Andreia P. Guerreiro, Miguel Terra-Neves, Inês Lynce, José Rui Figueira, Vasco Manquinho:
Constraint-Based Techniques in Stochastic Local Search MaxSAT Solving. CP 2019: 232-250 - [c65]Miguel Terra-Neves, Inês Lynce, Vasco Manquinho:
Integrating Pseudo-Boolean Constraint Reasoning in Multi-Objective Evolutionary Algorithms. IJCAI 2019: 1184-1190 - [c64]Filipe Gouveia, Inês Lynce, Pedro T. Monteiro:
Model Revision of Boolean Regulatory Networks at Stable State. ISBRA 2019: 100-112 - [e3]Mikolás Janota, Inês Lynce:
Theory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings. Lecture Notes in Computer Science 11628, Springer 2019, ISBN 978-3-030-24257-2 [contents] - [i7]Ruben Martins, Saurabh Joshi, Vasco Manquinho, Inês Lynce:
Reflections on "Incremental Cardinality Constraints for MaxSAT". CoRR abs/1910.04643 (2019) - 2018
- [c63]Miguel Terra-Neves, Inês Lynce, Vasco Manquinho:
Enhancing Constraint-Based Multi-Objective Combinatorial Optimization. AAAI 2018: 6649-6656 - [c62]Filipe Gouveia, Inês Lynce, Pedro T. Monteiro:
Model Revision of Logical Regulatory Networks Using Logic-Based Tools. ICLP (Technical Communications) 2018: 23:1-23:10 - [c61]Miguel Terra-Neves, Inês Lynce, Vasco Manquinho:
Stratification for Constraint-Based Multi-Objective Combinatorial Optimization. IJCAI 2018: 1376-1382 - [c60]Miguel Terra-Neves, Inês Lynce, Vasco Manquinho:
Multi-Objective Optimization Through Pareto Minimal Correction Subsets. IJCAI 2018: 5379-5383 - [c59]Pedro L. Varela, Inês Lynce, Vasco Manquinho, Claudine Chaouiya, Pedro T. Monteiro:
Stable States of Boolean Regulatory Networks Composed Over Hexagonal Grids. SASB 2018: 113-130 - [p5]Inês Lynce, Vasco Manquinho, Ruben Martins:
Parallel Maximum Satisfiability. Handbook of Parallel Constraint Reasoning 2018: 61-99 - 2017
- [c58]Filipe Gouveia, Pedro T. Monteiro, Vasco Manquinho, Inês Lynce:
Logic-Based Encodings for Ricochet Robots. EPIA 2017: 657-669 - [c57]Miguel Terra-Neves, Inês Lynce, Vasco Manquinho:
Introducing Pareto Minimal Correction Subsets. SAT 2017: 195-211 - 2016
- [c56]Miguel Terra-Neves, Inês Lynce, Vasco Manquinho:
Non-Portfolio Approaches for Distributed Maximum Satisfiability. ICTAI 2016: 436-443 - 2015
- [j28]Mikolás Janota, Inês Lynce, João Marques-Silva:
Algorithms for computing backbones of propositional formulae. AI Commun. 28(2): 161-177 (2015) - [j27]Ruben Martins, Vasco Manquinho, Inês Lynce:
Deterministic Parallel MaxSAT Solving. Int. J. Artif. Intell. Tools 24(3): 1550005:1-1550005:25 (2015) - [j26]Ruben Martins, Vasco Manquinho, Inês Lynce:
Improving linear search algorithms with model-based approaches for MaxSAT solving. J. Exp. Theor. Artif. Intell. 27(5): 673-701 (2015) - [c55]Miguel Neves, Ruben Martins, Mikolás Janota, Inês Lynce, Vasco Manquinho:
Exploiting Resolution-Based Representations for MaxSAT Solving. SAT 2015: 272-286 - [i6]Miguel Neves, Ruben Martins, Mikolás Janota, Inês Lynce, Vasco Manquinho:
Exploiting Resolution-based Representations for MaxSAT Solving. CoRR abs/1505.02405 (2015) - [i5]Miguel Neves, Inês Lynce, Vasco Manquinho:
DistMS: A Non-Portfolio Distributed Solver for Maximum Satisfiability. CoRR abs/1505.02408 (2015) - 2014
- [j25]Anton Belov, Mikolás Janota, Inês Lynce, João Marques-Silva:
Algorithms for computing minimal equivalent subformulas. Artif. Intell. 216: 309-326 (2014) - [j24]Miguel Miranda, Inês Lynce, Vasco Manquinho:
Inferring phylogenetic trees using pseudo-Boolean optimization. AI Commun. 27(3): 229-243 (2014) - [j23]Rui Camacho, Paulo Carreira, Inês Lynce, Sílvia Resendes:
An ontology-based approach to conflict resolution in Home and Building Automation Systems. Expert Syst. Appl. 41(14): 6161-6173 (2014) - [j22]Ruben Martins, Saurabh Joshi, Vasco Manquinho, Inês Lynce:
On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving. J. Satisf. Boolean Model. Comput. 9(1): 59-81 (2014) - [c54]Ruben Martins, Saurabh Joshi, Vasco Manquinho, Inês Lynce:
Incremental Cardinality Constraints for MaxSAT. CP 2014: 531-548 - [c53]Alexey Ignatiev, António Morgado, Vasco Manquinho, Inês Lynce, João Marques-Silva:
Progression in Maximum Satisfiability. ECAI 2014: 453-458 - [c52]João Marques-Silva, Alexey Ignatiev, António Morgado, Vasco Manquinho, Inês Lynce:
Efficient Autarkies. ECAI 2014: 603-608 - [c51]Ruben Martins, Vasco Manquinho, Inês Lynce:
Open-WBO: A Modular MaxSAT Solver, . SAT 2014: 438-445 - [p4]João Marques-Silva, Inês Lynce:
SAT Solvers. Tractability 2014: 331-349 - [i4]Ruben Martins, Saurabh Joshi, Vasco Manquinho, Inês Lynce:
Incremental Cardinality Constraints for MaxSAT. CoRR abs/1408.4628 (2014) - 2013
- [c50]Ruben Martins, Vasco Manquinho, Inês Lynce:
Community-Based Partitioning for MaxSAT Solving. SAT 2013: 182-191 - 2012
- [j21]Ruben Martins, Vasco 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 Manquinho, Inês Lynce:
An overview of parallel SAT solving. Constraints An Int. J. 17(3): 304-347 (2012) - [j18]Mikolás Janota, Inês Lynce, Vasco Manquinho, João Marques-Silva:
PackUp: Tools for Package Upgradability Solving. J. Satisf. Boolean Model. Comput. 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. J. Multiple Valued Log. Soft Comput. 19(1-3): 3-23 (2012) - [c49]Anton Belov, Mikolás Janota, Inês Lynce, João Marques-Silva:
On Computing Minimal Equivalent Subformulas. CP 2012: 158-174 - [c48]João Guerra, Inês Lynce:
Reasoning over Biological Networks Using Maximum Satisfiability. CP 2012: 941-956 - [c47]Inês Lynce:
Satisfiability: where Theory meets Practice (Invited Talk). CSL 2012: 12-13 - [c46]Ruben Martins, Vasco Manquinho, Inês Lynce:
On Partitioning for Maximum Satisfiability. ECAI 2012: 913-914 - [c45]Ruben Martins, Vasco Manquinho, Inês Lynce:
Clause Sharing in Parallel MaxSAT. LION 2012: 455-460 - [i3]Rui Henriques, Inês Lynce, Vasco 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. Ann. Oper. Res. 184(1): 137-162 (2011) - [j14]Inês Lynce, João Marques-Silva:
Restoring CSP Satisfiability with MaxSAT. Fundam. Informaticae 107(2-3): 249-266 (2011) - [c44]Ruben Martins, Vasco Manquinho, Inês Lynce:
Exploiting Cardinality Encodings in Parallel Maximum Satisfiability. ICTAI 2011: 313-320 - [c43]João Marques-Silva, Inês Lynce:
On Improving MUS Extraction Algorithms. SAT 2011: 159-173 - [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:
Proceedings Second Workshop on Logics for Component Configuration, LoCoCo 2011, Perugia, Italy, 12th September 2011. EPTCS 65, 2011 [contents] - 2010
- [j13]Ana Graça, Inês Lynce, João Marques-Silva, Arlindo L. Oliveira:
Haplotype Inference by Pure Parsimony: A Survey. J. Comput. Biol. 17(8): 969-992 (2010) - [j12]João Delgado, Inês Lynce, Vasco Manquinho:
Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes. J. Comput. Biol. 17(9): 1243-1265 (2010) - [c42]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 - [c41]João Marques-Silva, Josep Argelich, Ana Graça, Inês Lynce:
Boolean Lexicographic Optimization. RCRA@CPAIOR 2010 - [c40]João Marques-Silva, Mikolás Janota, Inês Lynce:
On Computing Backbones of Propositional Theories. ECAI 2010: 15-20 - [c39]Ruben Martins, Vasco Manquinho, Inês Lynce:
Improving Search Space Splitting for Parallel SAT Solving. ICTAI (1) 2010: 336-343 - [c38]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà:
New Insights into Encodings from MaxCSP into Partial MaxSAT. ISMVL 2010: 46-52 - [c37]Paulo Trezentos, Inês Lynce, Arlindo L. Oliveira:
Apt-pbo: solving the software dependency problem using pseudo-boolean optimization. ASE 2010: 427-436 - [c36]Vasco Manquinho, Ruben Martins, Inês Lynce:
Improving Unsatisfiability-Based Algorithms for Boolean Optimization. SAT 2010: 181-193 - [c35]Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, Inês Lynce:
The Seventh QBF Solvers Evaluation (QBFEVAL'10). SAT 2010: 237-250 - [c34]Josep Argelich, Daniel Le Berre, Inês Lynce, João Marques-Silva, Pascal Rapicault:
Solving Linux Upgradeability Problems Using Boolean Optimization. LoCoCo 2010: 11-22 - [e1]Inês Lynce, Ralf Treinen:
Proceedings First International Workshop on Logics for Component Configuration, LoCoCo 2010, Edinburgh, UK, 10th July 2010. EPTCS 29, 2010 [contents]
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 An Int. J. 14(4): 415-442 (2009) - [c33]Inês Lynce, João Marques-Silva:
Restoring CSP Satisfiability with MaxSAT. RCRA@AI*IA 2009 - [c32]Josep Argelich, Inês Lynce, João Marques-Silva:
On Solving Boolean Multilevel Optimization Problemse. IJCAI 2009: 393-398 - [c31]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà:
Regular Encodings from Max-CSP into Partial Max-SAT. ISMVL 2009: 196-202 - [c30]João Delgado, Inês Lynce, Vasco Manquinho:
Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes Using Pseudo-Boolean Optimization. RECOMB-CG 2009: 138-149 - [c29]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà:
Sequential Encodings from Max-CSP into Partial Max-SAT. SAT 2009: 161-166 - [c28]David Pereira, Inês Lynce, Steven D. Prestwich:
On Improving Local Search for Unsatisfiability. LSCS 2009: 41-53 - [p2]João 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 Marques-Silva:
On Solving Boolean Multilevel Optimization Problems. CoRR abs/0904.0019 (2009) - 2008
- [j10]Inês Lynce, João Marques-Silva, Steve Prestwich:
Boosting Haplotype Inference with Local Search. Constraints An Int. J. 13(1-2): 155-179 (2008) - [j9]Inês Lynce, João Marques-Silva:
Haplotype Inference with Boolean Satisfiability. Int. J. Artif. Intell. Tools 17(2): 355-387 (2008) - [c27]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 - [c26]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 - [c25]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà:
Encoding Max-CSP into Partial Max-SAT. ISMVL 2008: 106-111 - [c24]João Marques-Silva, Inês Lynce, Vasco Manquinho:
Symmetry Breaking for Maximum Satisfiability. LPAR 2008: 1-15 - [c23]Josep Argelich, Inês Lynce:
CNF Instances from the Software Package Installation Problem. RCRA 2008 - [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 Manquinho, João Marques-Silva:
Backtracking. Wiley Encyclopedia of Computer Science and Engineering 2008 - [i1]João Marques-Silva, Inês Lynce, Vasco Manquinho:
Symmetry Breaking for Maximum Satisfiability. CoRR abs/0804.0599 (2008) - 2007
- [j8]Ian P. Gent, Christopher Jefferson, Tom W. 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 Mag. 28(4): 135-136 (2007) - [j6]Inês Lynce, João Marques-Silva:
Random backtracking in backtrack search algorithms for satisfiability. Discret. Appl. Math. 155(12): 1604-1612 (2007) - [c21]Steven D. 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 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]Inês Lynce, João Marques-Silva:
Breaking Symmetries in SAT Matrix Models. SAT 2007: 22-27 - 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]Inês Lynce, Joël Ouaknine:
Sudoku as a SAT Problem. AI&M 2006 - [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]Steven D. Prestwich, Inês Lynce:
Local Search for Unsatisfiability. SAT 2006: 283-296 - 2005
- [j4]Inês Lynce, João 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. Reason. 35(1-3): 3-24 (2005) - [c11]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 Formulas. SAT 2005: 467-474 - 2004
- [c10]Inês Lynce, João Marques-Silva:
Hidden Structure in Unsatisfiable Random 3-SAT: An Empirical Study. ICTAI 2004: 246-251 - [c9]Inês Lynce, João Marques-Silva:
On Computing Minimum Unsatisfiable Cores. SAT 2004 - 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 Marques-Silva:
Heuristic-Based Backtracking for Propositional Satisfiability. EPIA 2003: 116-130 - [c7]Inês Lynce, João Marques-Silva:
Probing-Based Preprocessing Techniques for Propositional Satisfiability. ICTAI 2003: 105- - [c6]Ateet Bhalla, Inês Lynce, José T. de Sousa, João Marques-Silva:
Heuristic Backtracking Algorithms for SAT. MTV 2003: 69-74 - 2002
- [c5]Inês Lynce, João 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 Marques-Silva:
Tuning Randomization in Backtrack Search SAT Algorithms. CP 2002: 769 - [c3]Inês Lynce, João Marques-Silva:
Building State-of-the-Art SAT Solvers. ECAI 2002: 166-170 - 2001
- [j1]Inês Lynce, Luís Baptista, João Marques-Silva:
Stochastic Systematic Search Algorithms for Satisfiability. Electron. Notes Discret. Math. 9: 190-204 (2001) - [c2]Inês Lynce, João Marques-Silva:
Improving SAT Algorithms by Using Search Pruning Techniques. CP 2001: 770 - [c1]Inês Lynce, Luís Baptista, João Marques-Silva:
Towards Provably Complete Stochastic Search Algorithms for Satisfiability. EPIA 2001: 363-370
Coauthor Index
[j36] [c78] [j35] [c76] [c75] [i13] [j34] [i11] [i10] [c73] [c72] [i9] [c68] [j29] [c67] [c66] [c65] [i7] [c63] [c61] [c60] [c59] [p5] [c58] [c57] [c56] [j27] [j26] [c55] [i6] [i5] [j24] [j22] [c54] [c53] [c52] [c51] [i4] [c50] [j21] [j19] [j18] [c46] [c45] [i3] [c44] [j12] [c39] [c36] [c30] [c24] [p1] [i1]
João Marques-Silva 0001
aka: João P. Marques Silva
aka: João P. Marques Silva
[p6] [j28] [j25] [c53] [c52] [p4] [j20] [j18] [c49] [j16] [j15] [j14] [c43] [p3] [j13] [c42] [c41] [c40] [c34] [j11] [c33] [c32] [p2] [i2] [j10] [j9] [c27] [c26] [c24] [p1] [i1] [j7] [j6] [c20] [c19] [c18] [c17] [c16] [c14] [c13] [j4] [j3] [c11] [c10] [c9] [j2] [c8] [c7] [c6] [c5] [c4] [c3] [j1] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-05 20:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
