The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gilles Audemard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani
    Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements. [Citation Graph (0, 0)][DBLP]
    AISC, 2002, pp:231-245 [Conf]
  2. Gilles Audemard, Belaid Benhamou
    Reasoning by Symmetry and Function Ordering in Finite Model Generation. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:226-240 [Conf]
  3. Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani
    A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:195-210 [Conf]
  4. Gilles Audemard, Belaid Benhamou, Laurent Henocque
    Two Techniques to Improve Finite Model Search. [Citation Graph (0, 0)][DBLP]
    CADE, 2000, pp:302-308 [Conf]
  5. Gilles Audemard, Laurent Henocque
    The eXtended Least Number Heuristic. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:427-442 [Conf]
  6. Gilles Audemard, Belaid Benhamou, Pierre Siegel
    AVAL: An Enumerative Method for SAT. [Citation Graph (0, 0)][DBLP]
    Computational Logic, 2000, pp:373-383 [Conf]
  7. Gilles Audemard, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani
    Bounded Model Checking for Timed Systems. [Citation Graph (0, 0)][DBLP]
    FORTE, 2002, pp:243-259 [Conf]
  8. Gilles Audemard, Lakhdar Sais
    SAT Based BDD Solver for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2004, pp:82-89 [Conf]
  9. Gilles Audemard, Laurent Simon
    GUNSAT: A Greedy Local Search Algorithm for Unsatisfiability. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:2256-2261 [Conf]
  10. Gilles Audemard, Saïd Jabbour, Lakhdar Sais
    Symmetry Breaking in Quantified Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:2262-2267 [Conf]
  11. Gilles Audemard, Belaid Benhamou
    Etude des symétries dans les modèles finis. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2001, pp:109-122 [Conf]
  12. Gilles Audemard, Bertrand Mazure, Lakhdar Sais
    Dealing with Symmetries in Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  13. Gilles Audemard, Lakhdar Sais
    A Symbolic Search Based Approach for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:16-30 [Conf]
  14. Gilles Audemard, Marco Bozzano, Alessandro Cimatti, Roberto Sebastiani
    Verifying Industrial Hybrid Systems with MathSAT. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:119, n:2, pp:17-32 [Journal]
  15. Gilles Audemard, Belaid Benhamou, Laurent Henocque
    Predicting and Detecting Symmetries in FOL Finite Model Search. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2006, v:36, n:3, pp:177-212 [Journal]
  16. Gilles Audemard, Lakhdar Sais
    Circuit Based Encoding of CNF Formula. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:16-21 [Conf]

  17. A Restriction of Extended Resolution for Clause Learning SAT Solvers. [Citation Graph (, )][DBLP]


  18. Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms. [Citation Graph (, )][DBLP]


  19. Learning in Local Search. [Citation Graph (, )][DBLP]


  20. Predicting Learnt Clauses Quality in Modern SAT Solvers. [Citation Graph (, )][DBLP]


  21. A Generalized Framework for Conflict Analysis. [Citation Graph (, )][DBLP]


  22. Integrating Conflict Driven Clause Learning to Local Search [Citation Graph (, )][DBLP]


Search in 0.109secs, Finished in 0.110secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002