BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Belgium
1 × China
1 × Finland
1 × France
1 × Portugal
3 × United Kingdom
5 × USA
Collaborated with:
J.Marques-Silva R.Martins V.M.Manquinho J.P.M.Silva ∅ O.Kullmann J.Argelich A.Cabiscol F.Manyà S.D.Prestwich P.Trezentos A.L.Oliveira L.Baptista M.Neves M.Janota M.N.Mneimneh Z.S.Andraus K.A.Sakallah C.Peschiera L.Pulina A.Tacchella U.Bubeck
Talks about:
sat (8) max (7) algorithm (5) unsatisfi (4) satisfi (3) solver (3) search (3) solv (3) base (3) backtrack (2)

Person: Inês Lynce

DBLP DBLP: Lynce:In=ecirc=s

Contributed to:

SAT 20152015
SAT 20142014
SAT 20132013
CSL 20122012
SAT 20112011
ASE 20102010
SAT 20102010
SAT 20092009
SAT 20082008
SAT 20072007
SAT 20062006
SAT 20052005
SAT 20022002
SAT 20012001

Wrote 18 papers:

SAT-2015-NevesMJLM #satisfiability
Exploiting Resolution-Based Representations for MaxSAT Solving (MN, RM, MJ, IL, VMM), pp. 272–286.
SAT-2014-MartinsML #composition #named #satisfiability
Open-WBO: A Modular MaxSAT Solver, (RM, VMM, IL), pp. 438–445.
SAT-2013-MartinsML #clustering #satisfiability
Community-Based Partitioning for MaxSAT Solving (RM, VMM, IL), pp. 182–191.
CSL-2012-Lynce #named #satisfiability
Satisfiability: where Theory meets Practice (IL), pp. 12–13.
SAT-2011-SilvaL #algorithm #on the
On Improving MUS Extraction Algorithms (JPMS, IL), pp. 159–173.
ASE-2010-TrezentosLO #dependence #named #optimisation #problem #pseudo #using
Apt-pbo: solving the software dependency problem using pseudo-boolean optimization (PT, IL, ALO), pp. 427–436.
SAT-2010-ManquinhoML #algorithm #optimisation #satisfiability
Improving Unsatisfiability-Based Algorithms for Boolean Optimization (VMM, RM, IL), pp. 181–193.
SAT-2010-PeschieraPTBKL #evaluation
The Seventh QBF Solvers Evaluation (QBFEVAL’10) (CP, LP, AT, UB, OK, IL), pp. 237–250.
SAT-2009-ArgelichCLM #encoding #satisfiability
Sequential Encodings from Max-CSP into Partial Max-SAT (JA, AC, IL, FM), pp. 161–166.
SAT-2008-ArgelichCLM #modelling #satisfiability
Modelling Max-CSP as Partial Max-SAT (JA, AC, IL, FM), pp. 1–14.
SAT-2007-LynceM #matrix #modelling #satisfiability #symmetry
Breaking Symmetries in SAT Matrix Models (IL, JPMS), pp. 22–27.
SAT-2006-KullmannLM #agile #categorisation #kernel #normalisation #satisfiability
Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel (OK, IL, JMS), pp. 22–35.
SAT-2006-LynceM #satisfiability #type inference
SAT in Bioinformatics: Making the Case with Haplotype Inference (IL, JMS), pp. 136–141.
SAT-2006-PrestwichL #satisfiability
Local Search for Unsatisfiability (SDP, IL), pp. 283–296.
SAT-2005-MneimnehLASS #algorithm #bound #satisfiability
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas (MNM, IL, ZSA, JPMS, KAS), pp. 467–474.
SAT-2002-LynceM #backtracking #data type #performance #satisfiability
Efficient data structures for backtrack search SAT solvers (IL, JMS), p. 20.
SAT-2002-LynceM1 #algorithm #backtracking #satisfiability #strict
Complete unrestricted backtracking algorithms for satisfiability (IL, JMS), p. 29.
SAT-2001-LynceBM #algorithm #probability #satisfiability
Stochastic Systematic Search Algorithms for Satisfiability (IL, LB, JMS), pp. 190–204.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.