Biblio

Export 28 results:
Author Title [ Type(Asc)] Year
Filters: Author is Laurent Simon  [Clear All Filters]
Thesis
L. Simon, “Logique propositionnelle : un langage simple, des problèmes complexes”, Université Paris Sud, 2010.
Journal Article
Z. Zhu, Li, C. Min, Manyi, F., and Simon, L., “Optimizing with Minimum Satisfiability”, Artificial Intelligence, vol. 190, pp. 32-44, 2012.
M. Jarvisalo, Le Berre, D., Roussel, O., and Simon, L., “The International SAT Solver Competition”, Artificial Intelligence Magazine, vol. 33, 2012.
Conference Paper
L. Simon, Audemard, G., and Katsirelos, G., “Une restriction de la résolution étendue pour les démonstrateurs SAT modernes”, in Actes des Journées Francophones de Programmation par Contraintes (JFPC), Orléans France, 2010.
C. Min Li, Zhu, Z., Manya, F., and Simon, L., “Satisfiabilité Minimale et Applications”, in Actes des Journées Francophones de Programmation par Contraintes (JFPC), Lyon, France, 2011.
H. Ibrahim, Dague, P., and Simon, L., “SAT-Based Testing of Diagnosability and Predictability of Centralized and Distributed Discrete Event Systems”, in {8th International Conference on Advances in System Testing and Validation Lifecycle VALID'16}, Rome, Italy, 2016.
L. Simon, Audemard, G., and Katsirelos, G., “A Restriction of Extended Resolution for Clause Learning SAT Solvers”, in Proc. of American Association of Artificial Intelligence Conference (AAAI), Atlanta United States, 2010.
G. Katsirelos, Sabharwal, A., Samulowitz, H., and Simon, L., “Resolution and Parallelizability: Barriers to the Efficient Parallelisation of SAT Solvers”, in Conference on Artificial Intelligence (AAAI), Washington, Etats-Unis, 2013.
G. Audemard and Simon, L., “Refining restarts strategies for SAT and UNSAT formulae”, in Proc. of International Conference on Principles and Practice of Constraint Programming (CP), Québec City, Canada, 2012, pp. 118-126.
G. Audemard and Simon, L., “Predicting Learnt Clauses Quality in Modern SAT Solver”, in Proc. of International Joint Conference on Artificial Intelligence (IJCAI), Pasadena, États-Unis d'Amérique, 2009.
G. Audemard, Modeliar, M. Samy, and Simon, L., “Pourquoi les solveurs SAT modernes se piquent-ils contre des cactus?”, in Actes des Journées Francophones de Programmation par Contraintes (JFPC), Orléans, France, 2009, pp. 245-255.
L. Simon, Li, C. Min, Manya, F., and Zhu, Z., “Minimum Satisfiability and its Applications”, in Proc. of International Joint Conference on Artificial Intelligence (IJCAI), Barcelona, Spain, 2011.
M. Martin, Dague, P., Pérès, S., and Simon, L., “Minimality of Metabolic Flux Modes under Boolean Regulation Constraints”, in {12th International Workshop on Constraint-Based Methods for Bioinformatics WCB'16}, Toulouse, France, 2016.
G. Katsirelos and Simon, L., “Learning Polynomials over GF(2) in a SAT Solver”, in Proc. of International Conference on Theory and Applications of Satisfiability Testing (SAT), Trento, Italie, 2012.
G. Audemard, Lagniez, J. - M., and Simon, L., “Just-in-Time Compilation of Knowledge Bases”, in International Joint Conference on Artificial Intelligence (IJCAI), Pékin, Chine, 2013.
G. Audemard, Lagniez, J. - M., and Simon, L., “Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction”, in Proc. of International Conference on Theory and Applications of Satisfiability Testing (SAT), Helsinki, Finlande, 2013.
G. Audemard and Simon, L., “Glucose 2.1: Aggressive - but Reactive - Clause Database Management, Dynamic Restarts”, in Proc. of International Workshop of Pragmatics of SAT (Affiliated to SAT), Trento, Italie, 2012.
G. Audemard and Simon, L., “Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms”, in Proc. of International Conference on Principles and Practice of Constraint Programming (CP), 2008.
L. Simon and Katsirelos, G., “Eigenvector centrality in industrial SAT instances”, in Proc. of International Conference on Principles and Practice of Constraint Programming (CP), Québec City, Canada, 2012, pp. 348-356.
G. Audemard, Lagniez, J. - M., and Simon, L., “Du Glucose en goutte à goutte pour les coeurs inconsistants”, in Actes des Journées Francophones de Programmation par Contraintes (JFPC), Aix en Provence, France, 2013.
V. Armant, Simon, L., and Dague, P., “Distributed tree decomposition with privacy”, in Proc. of International Conference on Principles and Practice of Constraint Programming (CP), Québec, Canada, 2012, pp. 102-117.
V. Armant, Dague, P., and Simon, L., “Distributed Tree Decomposition by Local Elections with One Token”, in Actes des Journées de l'Intelligence Artificielle Fondamentale, (JIAF), Toulouse, France, 2012.
V. Armant, Dague, P., and Simon, L., “Distributed Consistency-Based Diagnosis without Conflicts”, in Proc. of International Workshop on Principles of Diagnosis (DX), 2008.
V. Armant, Dague, P., and Simon, L., “Distributed Consistency-Based Diagnosis”, in Proc. of International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Doha, Qatar, 2008.
V. Armant, Dague, P., and Simon, L., “Diagnostic Distribué à base de modèles sans calcul préalable des conflits”, in Actes des Journées Francophones de Programmation par Contraintes (JFPC), 2008, pp. 41–48.

Pages