Gilles Audemard

Int. J. Artif. Intell. Tools, 2018

2017

A Distributed Version of Syrup.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

2016

Extreme Cases in SAT Problems.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

An Adaptive Parallel SAT Solver.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2016

2014

Améliorer SAT dans le cadre incrémental.

[BibT_eX]

[DOI]

Rev. d'Intelligence Artif., 2014

Impact of Community Structure on SAT Solver Performance.

[BibT_eX]

[DOI]

Zack Newsham

Vijay Ganesh

Sebastian Fischmeister

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Lazy Clause Exchange Policy for Parallel SAT Solvers.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Dolius: A Distributed Parallel SAT Solving Framework.

[BibT_eX]

[DOI]

Proceedings of the POS-14. Fifth Pragmatics of SAT workshop, 2014

An Effective Distributed D&C Approach for the Satisfiability Problem.

[BibT_eX]

[DOI]

Proceedings of the 22nd Euromicro International Conference on Parallel, 2014

Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem.

[BibT_eX]

[DOI]

Daniel Cosmin Porumbel

Proceedings of the Principles and Practice of Constraint Programming, 2014

2013

Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction.

[BibT_eX]

[DOI]

Jean-Marie Lagniez

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Just-In-Time Compilation of Knowledge Bases.

[BibT_eX]

[DOI]

Jean-Marie Lagniez

Proceedings of the IJCAI 2013, 2013

2012

Revisiting Clause Exchange in Parallel SAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Refining Restarts Strategies for SAT and UNSAT.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

2011

On Freezing and Reactivating Learnt Clauses.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

2010

Boosting Local Search Thanks to cdcl.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

A Restriction of Extended Resolution for Clause Learning SAT Solvers.

[BibT_eX]

[DOI]

George Katsirelos

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Integrating Conflict Driven Clause Learning to Local Search

[BibT_eX]

[DOI]

Proceedings of the Proceedings 6th International Workshop on Local Search Techniques in Constraint Satisfaction, 2009

Predicting Learnt Clauses Quality in Modern SAT Solvers.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

Learning in Local Search.

[BibT_eX]

[DOI]

Proceedings of the ICTAI 2009, 2009

2008

SAT graph-based representation: A new perspective.

[BibT_eX]

[DOI]

Saïd Jabbour

J. Algorithms, 2008

A Generalized Framework for Conflict Analysis.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2008

2007

Circuit Based Encoding of CNF Formula.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

GUNSAT: A Greedy Local Search Algorithm for Unsatisfiability.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2007, 2007

Symmetry Breaking in Quantified Boolean Formulae.

[BibT_eX]

[DOI]

Saïd Jabbour

Proceedings of the IJCAI 2007, 2007

2006

Predicting and Detecting Symmetries in FOL Finite Model Search.

[BibT_eX]

[DOI]

Laurent Henocque

J. Autom. Reason., 2006

2005

A Symbolic Search Based Approach for Quantified Boolean Formulas.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

2004

Verifying Industrial Hybrid Systems with MathSAT.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Workshop on Bounded Model Checking, 2004

Dealing with Symmetries in Quantified Boolean Formulas.

[BibT_eX]

[DOI]

Bertrand Mazure

Proceedings of the SAT 2004, 2004

SAT Based BDD Solver for Quantified Boolean Formulas.

[BibT_eX]

[DOI]

Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004

2002

Bounded Model Checking for Timed Systems.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2002

A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 2002

Reasoning by Symmetry and Function Ordering in Finite Model Generation.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 2002

Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence, 2002

2001

Etude des symétries dans les modèles finis.

[BibT_eX]

Proceedings of the Programmation en logique avec contraintes, Actes des JFPLC'2001, 24 avril, 2001

The eXtended Least Number Heuristic.

[BibT_eX]

[DOI]

Laurent Henocque

Proceedings of the Automated Reasoning, First International Joint Conference, 2001

2000

AVAL: An Enumerative Method for SAT.

[BibT_eX]

[DOI]

Pierre Siegel

Proceedings of the Computational Logic, 2000

Two Techniques to Improve Finite Model Search.

[BibT_eX]

[DOI]