Inês Lynce

From MaRDI portal
Person:421450

Available identifiers

zbMath Open lynce.inesDBLP94/3399WikidataQ85100310 ScholiaQ85100310MaRDI QIDQ421450

List of research outcomes





PublicationDate of PublicationType
New core-guided and hitting set algorithms for multi-objective combinatorial optimization2024-04-05Paper
ModRev -- model revision tool for Boolean logical models of biological regulatory networks2022-12-22Paper
Minimal perturbation in university timetabling with maximum satisfiability2022-12-21Paper
Stable states of Boolean regulatory networks composed over hexagonal grids2022-04-25Paper
On using incremental encodings in unsatisfiability-based MaxSAT solving2021-12-09Paper
Efficient encodings from CSP into SAT, and from MaxCSP into MaxSAT2018-09-03Paper
Introducing Pareto minimal correction subsets2017-11-15Paper
Algorithms for computing backbones of propositional formulae2017-11-07Paper
Progression in maximum satisfiability2017-07-18Paper
Inferring phylogenetic trees using pseudo-Boolean optimization2016-06-10Paper
PackUp: tools for package upgradability solving2016-02-23Paper
Exploiting resolution-based representations for MaxSAT solving2015-11-20Paper
An overview of parallel SAT solving2015-01-22Paper
Algorithms for computing minimal equivalent subformulas2014-10-13Paper
Open-WBO: a modular MaxSAT solver2014-09-26Paper
Community-Based Partitioning for MaxSAT Solving2013-08-05Paper
Satisfiability: where Theory meets Practice (Invited Talk).2012-11-22Paper
Towards efficient MUS extraction2012-10-25Paper
Efficient and accurate haplotype inference by combining parsimony and pedigree information2012-06-08Paper
Boolean lexicographic optimization: algorithms \& applications2012-05-23Paper
Restoring CSP satisfiability with MaxSAT2011-11-22Paper
Haplotype inference with pseudo-Boolean optimization2011-06-22Paper
On improving MUS extraction algorithms2011-06-17Paper
On computing backbones of propositional theories2011-05-11Paper
The seventh QBF solvers evaluation (QBFEVAL'10)2010-09-29Paper
Improving Unsatisfiability-Based Algorithms for Boolean Optimization2010-09-29Paper
A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas2009-11-16Paper
Progress in Artificial Intelligence2009-08-07Paper
Sequential Encodings from Max-CSP into Partial Max-SAT2009-07-07Paper
Symmetry Breaking for Maximum Satisfiability2009-01-27Paper
Towards Robust CNF Encodings of Cardinality Constraints2008-09-02Paper
Boosting haplotype inference with local search2008-09-02Paper
Modelling Max-CSP as Partial Max-SAT2008-05-27Paper
Search in the patience game `Black Hole'2008-01-14Paper
Efficient Haplotype Inference with Pseudo-boolean Optimization2007-11-29Paper
Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel2007-09-04Paper
Local Search for Unsatisfiability2007-09-04Paper
Random backtracking in backtrack search algorithms for satisfiability2007-08-23Paper
Heuristic-based backtracking relaxation for propositional satisfiability2007-01-24Paper
Theory and Applications of Satisfiability Testing2005-12-15Paper
Efficient data structures for backtrack search SAT solvers2005-05-13Paper
https://portal.mardi4nfdi.de/entity/Q44757022004-08-09Paper
https://portal.mardi4nfdi.de/entity/Q47364862004-08-09Paper
https://portal.mardi4nfdi.de/entity/Q44248612003-09-07Paper
An overview of backtrack search satisfiability algorithms2003-03-10Paper
Stochastic systematic search algorithms for satisfiability2001-09-24Paper

Research outcomes over time

This page was built for person: Inês Lynce