Gilles Audemard

Computational Theory and Mathematics · 2009–2013

A researcher in the Science corpus: 2 papers; trusts 9 researchers and is trusted by 7 researchers here, as inferred from the citation graph.

Subfields

Computational Theory and Mathematics — 11 citations into it; #5,636 of 12,182 by trust here, #9,306 by citations
Artificial Intelligence — 7 citations into it; #17,385 of 35,345 by trust here, #30,347 by citations
Computer Networks and Communications — 6 citations into it

Their strongest outbound trust, strongest first, inferred from their citations.

Ordered by how strongly the researchers Gilles Audemard trusts endorse each paper. Same corpus, a different order for every researcher.

A machine program for theorem-proving (CACM)
Temporal induction by incremental SAT solving (BMC@CAV)
Cha : Engineering an e cient SAT solver (Design Automation Conference)
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems (Journal of automated reasoning)
BerkMin: A fast and robust SAT-solver (Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition)
Efficient conflict driven learning in a Boolean satisfiability solver (IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281))
Effective Preprocessing in SAT Through Variable and Clause Elimination (International Conference on Theory and Applications of Satisfiability Testing)
Predicting Learnt Clauses Quality in Modern SAT Solvers
On Solving the Partial MAX-SAT Problem (International Conference on Theory and Applications of Satisfiability Testing)
An Extensible SAT-solver (International Conference on Theory and Applications of Satisfiability Testing)