Glucose in the Contest 13

Clearly, the contest 2013 was for the Lingeling family and the "in-processing" techniques. However, Glucose performed very well in

Certified UNSAT, when you want a proof for the UNSAT answer;

Hard Combinatorial problems.

A two-words analysis : In processing techniques are indeed harder to implement if you want to be able to produce a trace of your solver, and thus Lingling was not participating this track. However, we think that Glucose is very good at producing some kind of short – and easy to find – proofs. This could explain both good positions of Glucose in the contest 2013 rankings.

I am also associate member of the LRI laboratory in
the University of Orsay Paris 11, in the Artificial
Intelligence and Inference System group (IASI) (I was associate professor in this group before 2013, and happy to formally remember it with this position).

My main research interests are on propositional-based reasoning, SAT solving and
efficient Prime Implicates generation / Knowledge Base Compilation. I'm also
working on decentralized approaches of some of these topics (reasoning
on top of P2P and social networks) and how to push computer science to a real
experimental science (especially search algorithms).
I'm also trying
to apply those decentralized reasoning systems to diagnosis of (intrinsic)
distributed systems.

SAT 2016 In Bordeaux ! Don't miss it!

I'm very pleased to be the local organizer for the SAT 2016 Conference. The Program Chairs are Daniel Le Berre and Nadia Creignou. Do take a look at this very nice web site about SAT 2016 to check the upcoming deadlines and all the associated events. You can also check the social links for this event:

About Glucose Our SAT Solver

Glucose is a SAT solver based on a particular scoring scheme for the
clause learning mechanism, based on the paper Gilles Audemard and I wrote at
IJCAI'09. Solver's name is
a contraction of the concept of "glue clauses", a particular kind of clauses
that glucose detects and preserves during search. Glucose is heavily based on
Minisat, so please do cite Minisat also if you want to cite Glucose.

What is SAT?

SAT is a fundamental problem of computer science that, intuitively, captures all the easiest of the hard problems. Hard problems mean problem that cannot be solved efficiently (you'll need more time than the universe had on large problems!). If you want to read more about it, why not taking your with the Wikipedia page about SAT ?

About SAT Competitions

Those events are very important for the whole SAT community. I was involved in the first cycle of competitions (2002-2009). In 2009, I chosen to act only as an "advisor" to focus on Glucose, on which I had many expectations. I'm now "off" the competition. But I had fun with it! Take a look at the competition web site . In the next few weeks, I'll try to put all the datas I have about past competitions. Stay tuned.