BibSLEIGH — Joao_P_Marques

Travelled to:

1 × Canada
1 × France
1 × Italy
1 × Portugal
2 × Germany
2 × United Kingdom
5 × USA

Collaborated with:

K.A.Sakallah V.M.Manquinho I.Lynce M.Janota A.Belov T.Glaß H.Katebi J.Planes F.A.Aloul L.G.e.Silva L.M.Silveira L.Bordeaux P.Marquis A.Morgado P.J.Matos J.Kim J.Whittemore M.N.Mneimneh Z.S.Andraus

Talks about:

algorithm (8) boolean (8) satisfi (7) optim (4) base (4) techniqu (3) pseudo (3) bound (3) use (3) sat (3)

Person: João P. Marques Silva

DBLP: Silva:Jo=atilde=o_P=_Marques

Contributed to:

2012

2011

2009

2007

2006

2005

2004

2000

1999

1994

Wrote 20 papers:

KR-2012-BordeauxJSM #on the #quantifier: On Unit-Refutation Complete Formulae with Existentially Quantified Variables (LB, MJ, JPMS, PM).
SAT-2011-BelovS #satisfiability: Minimally Unsatisfiable Boolean Circuits (AB, JPMS), pp. 145–158.
SAT-2011-JanotaS #algorithm: Abstraction-Based Algorithm for 2QBF (MJ, JPMS), pp. 230–244.
SAT-2011-KatebiSS #empirical #satisfiability: Empirical Study of the Anatomy of Modern Sat Solvers (HK, KAS, JPMS), pp. 343–356.
SAT-2011-SilvaL #algorithm #on the: On Improving MUS Extraction Algorithms (JPMS, IL), pp. 159–173.
SAT-2009-ManquinhoSP #algorithm #optimisation: Algorithms for Weighted Boolean Optimization (VMM, JPMS, JP), pp. 495–508.
SAT-2007-LynceM #matrix #modelling #satisfiability #symmetry: Breaking Symmetries in SAT Matrix Models (IL, JPMS), pp. 22–27.
SAT-2006-MorgadoMMM #integer #modelling: Counting Models in Integer Domains (AM, PJM, VMM, JPMS), pp. 410–423.
DATE-2005-ManquinhoM #bound #effectiveness #optimisation #pseudo: Effective Lower Bounding Techniques for Pseudo-Boolean Optimization (VMM, JPMS), pp. 660–665.
SAT-2005-ManquinhoM #algorithm #on the #optimisation #pseudo: On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization (VMM, JPMS), pp. 451–458.
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-2004-ManquinhoM #bound #optimisation #pseudo #satisfiability #using: Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization (VMM, JPMS), pp. 120–126.
CAV-2000-Marques-SilvaS #algorithm #automation #design #satisfiability #tutorial: Invited Tutorial: Boolean Satisfiability Algorithms and Applications in Electronic Design Automation (JPMS, KAS), p. 3.
DAC-2000-SilvaS #automation #design #satisfiability: Boolean satisfiability in electronic design automation (JPMS, KAS), pp. 675–680.
DATE-2000-KimWSS #fault #incremental #on the #satisfiability #testing: On Applying Incremental Satisfiability to Delay Fault Testing (JK, JW, KAS, JPMS), pp. 380–384.
DATE-2000-ManquinhoS #algorithm #on the #satisfiability #using: On Using Satisfiability-Based Pruning Techniques in Covering Algorithms (VMM, JPMS), pp. 356–363.
DATE-2000-SakallahAS #case study #heuristic #satisfiability: An Experimental Study of Satisfiability Search Heuristics (KAS, FAA, JPMS), p. 745.
DATE-1999-Marques-SilvaG #equivalence #learning #recursion #satisfiability #using: Combinational Equivalence Checking Using Satisfiability and Recursive Learning (JPMS, TG), pp. 145–149.
DATE-1999-SilvaSM #algorithm #satisfiability: Algorithms for Solving Boolean Satisfiability in Combinational Circuits (LGeS, LMS, JPMS), pp. 526–530.
DAC-1994-SilvaS: Dynamic Search-Space Pruning Techniques in Path Sensitization (JPMS, KAS), pp. 705–711.