BibSLEIGH — Joao_Marques-Silva

Travelled to:

1 × Austria
1 × China
1 × Finland
1 × India
1 × New Zealand
1 × Russia
2 × France
2 × Germany
2 × Italy
4 × USA

Collaborated with:

A.Belov I.Lynce M.Janota A.Ignatiev A.Previti O.Kullmann C.Mencía A.Morgado H.Chen J.Planes F.Letombe V.M.Manquinho ∅ M.F.Arif M.Heule A.Gurfinkel N.Manthey M.Järvisalo F.Heras L.C.Cordeiro B.Fischer L.Baptista A.Mishchenko A.Ivrii A.Matsliah W.Klieber E.M.Clarke

Talks about:

satisfi (7) sat (7) base (6) algorithm (5) maximum (4) formula (4) effici (4) core (4) mus (4) unsatisfi (3)

Person: João Marques-Silva

DBLP: Marques-Silva:Jo=atilde=o

Facilitated 1 volumes:

Contributed to:

2015

2014

2013

2012

2009

2008

2006

2002

2001

Wrote 29 papers:

SAT-2015-ArifMM #axiom #performance: Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing (MFA, CM, JMS), pp. 324–342.
SAT-2015-IgnatievPM #satisfiability: SAT-Based Formula Simplification (AI, AP, JMS), pp. 287–298.
SAT-2015-KullmannM #query: Computing Maximal Autarkies with Few and Simple Oracle Queries (OK, JMS), pp. 138–155.
SAT-2015-MenciaPM #bound #satisfiability: SAT-Based Horn Least Upper Bounds (CM, AP, JMS), pp. 423–433.
ICSE-2014-IgnatievJM #optimisation #performance #towards: Towards efficient optimization in package management systems (AI, MJ, JMS), pp. 745–755.
SAT-2014-BelovHM #proving #using: MUS Extraction Using Clausal Proofs (AB, MH, JMS), pp. 48–57.
SAT-2014-IgnatievMM #independence #on the #satisfiability #set: On Reducing Maximum Independent Set to Minimum Satisfiability (AI, AM, JMS), pp. 103–120.
SAT-2014-Marques-SilvaP #on the: On Computing Preferred MUSes and MCSes (JMS, AP), pp. 58–74.
TACAS-2014-GurfinkelBM #invariant: Synthesizing Safe Bit-Precise Invariants (AG, AB, JMS), pp. 93–108.
CAV-2013-Marques-SilvaJB #set: Minimal Sets over Monotone Predicates in Boolean Formulae (JMS, MJ, AB), pp. 592–607.
DATE-2013-Belov0MM #abstraction #satisfiability: Core minimization in SAT-based abstraction (AB, HC, AM, JMS), pp. 1411–1416.
SAT-2013-BelovMM #parallel: Parallel MUS Extraction (AB, NM, JMS), pp. 133–149.
SAT-2013-IgnatievJM #approach #quantifier #satisfiability: Quantified Maximum Satisfiability: — A Core-Guided Approach (AI, MJ, JMS), pp. 250–266.
SAT-2013-JanotaM #on the: On Propositional QBF Expansions and Q-Resolution (MJ, JMS), pp. 67–82.
TACAS-2013-BelovJM #preprocessor: Formula Preprocessing in MUS Extraction (AB, MJ, JMS), pp. 108–123.
DATE-2012-ChenJM: QBf-based boolean function bi-decomposition (HC, MJ, JMS), pp. 816–819.
SAT-2012-BelovIMM #on the #performance: On Efficient Computation of Variable MUSes (AB, AI, AM, JMS), pp. 298–311.
SAT-2012-JanotaKMC #refinement: Solving QBF with Counterexample Guided Refinement (MJ, WK, JMS, EMC), pp. 114–128.
SAT-2012-MorgadoHM #satisfiability: Improvements to Core-Guided Binary Search for MaxSAT (AM, FH, JMS), pp. 284–297.
ASE-2009-CordeiroFM #bound #embedded #model checking #smt: SMT-Based Bounded Model Checking for Embedded ANSI-C Software (LCC, BF, JMS), pp. 137–148.
DATE-2008-Marques-SilvaP #algorithm #satisfiability #using: Algorithms for Maximum Satisfiability using Unsatisfiable Cores (JMS, JP), pp. 408–413.
SAT-2008-LetombeM #algorithm #hybrid #incremental #satisfiability: Improvements to Hybrid Incremental SAT Algorithms (FL, JMS), pp. 168–181.
SAT-2008-Marques-SilvaM #algorithm #effectiveness #satisfiability #towards: Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms (JMS, VMM), pp. 225–230.
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-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-2002-Marques-Silva #reasoning #satisfiability: Hypothetical reasoning in propositional satisfiability (JMS), p. 14.
SAT-2001-LynceBM #algorithm #probability #satisfiability: Stochastic Systematic Search Algorithms for Satisfiability (IL, LB, JMS), pp. 190–204.