Prati
Gilles Audemard
Gilles Audemard
Professor of Computer Science, CRIL, Université d'Artois
Potvrđena adresa e-pošte na cril.fr - Početna stranica
Naslov
Citirano
Citirano
Godina
Predicting Learnt Clauses Quality in Modern SAT Solvers.
G Audemard, L Simon
IJCAI 9, 399-404, 2009
10392009
On the glucose SAT solver
G Audemard, L Simon
International Journal on Artificial Intelligence Tools 27 (01), 1840001, 2018
2512018
A SAT based approach for solving formulas over boolean and linear mathematical propositions
G Audemard, P Bertoli, A Cimatti, A Korniłowicz, R Sebastiani
International Conference on Automated Deduction, 195-210, 2002
2322002
Improving glucose for incremental SAT solving with assumptions: Application to MUS extraction
G Audemard, JM Lagniez, L Simon
International conference on theory and applications of satisfiability …, 2013
1902013
Bounded model checking for timed systems
G Audemard, A Cimatti, A Kornilowicz, R Sebastiani
International Conference on Formal Techniques for Networked and Distributed …, 2002
1662002
Refining restarts strategies for SAT and UNSAT
G Audemard, L Simon
Principles and Practice of Constraint Programming: 18th International …, 2012
1502012
Verifying industrial hybrid systems with MathSAT
G Audemard, M Bozzano, A Cimatti, R Sebastiani
Electronic Notes in Theoretical Computer Science 119 (2), 17-32, 2005
1442005
Glucose: a solver that predicts learnt clauses quality
G Audemard, L Simon
SAT Competition, 7-8, 2009
1102009
Lazy clause exchange policy for parallel SAT solvers
G Audemard, L Simon
International Conference on Theory and Applications of Satisfiability …, 2014
1062014
Impact of community structure on SAT solver performance
Z Newsham, V Ganesh, S Fischmeister, G Audemard, L Simon
Theory and Applications of Satisfiability Testing–SAT 2014: 17th …, 2014
1002014
On tractable XAI queries based on compiled representations
G Audemard, F Koriche, P Marquis
17th International Conference on Principles of Knowledge Representation and …, 2020
972020
On freezing and reactivating learnt clauses
G Audemard, JM Lagniez, B Mazure, L Sais
International Conference on Theory and Applications of Satisfiability …, 2011
962011
A generalized framework for conflict analysis
G Audemard, L Bordeaux, Y Hamadi, S Jabbour, L Sais
International conference on theory and applications of satisfiability …, 2008
922008
A restriction of extended resolution for clause learning SAT solvers
G Audemard, G Katsirelos, L Simon
Proceedings of the AAAI Conference on Artificial Intelligence 24 (1), 15-20, 2010
862010
XCSP3: an integrated format for benchmarking combinatorial constrained problems
F Boussemart, C Lecoutre, G Audemard, C Piette
arXiv preprint arXiv:1611.03398, 2016
782016
Glucose in the SAT 2014 competition
G Audemard, L Simon
Proceedings of SAT Competition 2014, 31, 2014
712014
Revisiting clause exchange in parallel SAT solving
G Audemard, B Hoessen, S Jabbour, JM Lagniez, C Piette
International Conference on Theory and Applications of Satisfiability …, 2012
622012
On the computational intelligibility of boolean classifiers
G Audemard, S Bellart, L Bounia, F Koriche, JM Lagniez, P Marquis
arXiv preprint arXiv:2104.06172, 2021
612021
GUNSAT: A Greedy Local Search Algorithm for Unsatisfiability.
G Audemard, L Simon
IJCAI 7, 2256-2261, 2007
472007
On the explanatory power of Boolean decision trees
G Audemard, S Bellart, L Bounia, F Koriche, JM Lagniez, P Marquis
Data & Knowledge Engineering 142, 102088, 2022
422022
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20