BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × China
1 × Denmark
1 × Finland
1 × Portugal
2 × Italy
2 × USA
2 × United Kingdom
Collaborated with:
L.Saïs B.Benhamou L.Simon L.Henocque J.Lagniez S.Jabbour B.Hoessen C.Piette P.Siegel B.Mazure Z.Newsham V.Ganesh S.Fischmeister L.Bordeaux Y.Hamadi P.Bertoli A.Cimatti A.Kornilowicz R.Sebastiani
Talks about:
sat (6) approach (3) formula (3) claus (3) solv (3) base (3) parallel (2) exchang (2) boolean (2) solver (2)

Person: Gilles Audemard

DBLP DBLP: Audemard:Gilles

Contributed to:

PDP 20142014
SAT 20142014
SAT 20132013
SAT 20122012
SAT 20112011
SAT 20082008
SAT 20072007
SAT 20052005
CADE 20022002
IJCAR 20012001
CADE 20002000
CL 20002000

Wrote 14 papers:

PDP-2014-AudemardHJP #approach #distributed #effectiveness #problem #satisfiability
An Effective Distributed D&C Approach for the Satisfiability Problem (GA, BH, SJ, CP), pp. 183–187.
SAT-2014-AudemardS #lazy evaluation #parallel #policy #satisfiability
Lazy Clause Exchange Policy for Parallel SAT Solvers (GA, LS), pp. 197–205.
SAT-2014-NewshamGFAS #community #performance #satisfiability
Impact of Community Structure on SAT Solver Performance (ZN, VG, SF, GA, LS), pp. 252–268.
SAT-2013-AudemardLS #incremental #satisfiability
Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction (GA, JML, LS), pp. 309–317.
SAT-2012-AudemardHJLP #parallel #satisfiability
Revisiting Clause Exchange in Parallel SAT Solving (GA, BH, SJ, JML, CP), pp. 200–213.
SAT-2011-AudemardLMS #on the
On Freezing and Reactivating Learnt Clauses (GA, JML, BM, LS), pp. 188–200.
SAT-2008-AudemardBHJS #analysis #framework
A Generalized Framework for Conflict Analysis (GA, LB, YH, SJ, LS), pp. 21–27.
SAT-2007-AudemardS #encoding
Circuit Based Encoding of CNF Formula (GA, LS), pp. 16–21.
SAT-2005-AudemardS #approach #quantifier
A Symbolic Search Based Approach for Quantified Boolean Formulas (GA, LS), pp. 16–30.
CADE-2002-AudemardB #finite #generative #reasoning #symmetry
Reasoning by Symmetry and Function Ordering in Finite Model Generation (GA, BB), pp. 226–240.
CADE-2002-AudemardBCKS #approach #linear #satisfiability
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions (GA, PB, AC, AK, RS), pp. 195–210.
IJCAR-2001-AudemardH #heuristic
The eXtended Least Number Heuristic (GA, LH), pp. 427–442.
CADE-2000-AudemardBH #finite
Two Techniques to Improve Finite Model Search (GA, BB, LH), pp. 302–308.
CL-2000-AudemardBS #named #satisfiability
AVAL: An Enumerative Method for SAT (GA, BB, PS), pp. 373–383.

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.