Publications

Article(s) de revue(s) internationale(s)

2017 Jean-Marie Lagniez, Pierre Marquis, On Preprocessing Techniques and Their Impact on Propositional Model Counting in Journal of Automated Reasoning (JAR),vol. 58, n° 4, pp. 413-481, 2017.

2016 Éric Grégoire, Jean-Marie Lagniez, A Computational Method for Enforcing Knowledge that Cannot be Subsumed in International Journal on Artificial Intelligence Tools,vol. 25, n° 4, pp. 1-19, 2016.

2016 Éric Grégoire, Jean-Marie Lagniez, RCL: An A. I. Tool for Computing Maximal Consensuses in International Journal on Artificial Intelligence Tools,vol. 25, n° 4, pp. 1-10, 2016.

2015 Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure, On getting rid of the preprocessing minimization step in MUC-finding algorithms in Constraints,vol. 20, Springer US, pp. 414-432, 2015. (Issue 4)

2014 Gilles Audemard, Armin Biere, Jean-Marie Lagniez, Laurent Simon, Améliorer SAT dans le cadre incrémental in Revue d’Intelligence Artificielle,vol. 28, n° 5, pp. 593-614, 2014.

2014 Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure, Boosting MUC extraction in unsatisfiable constraint networks in Applied Intelligence,vol. 41, n° 4, pp. 1012-1023, 2014.

Article(s) de conférence(s) internationale(s)

2017 Jean-Marie Lagniez, Daniel Le Berre, Tiago De Lima, Valentin Montmirail, A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem in Proceedings of the 26th IJCAI International Joint Conference on Artificial Intelligence (IJCAI’2017),août 2017.

2017 Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary, A Distributed Version of Syrup in 20th International Conference on Theory and Applications of Satisfiability Testing (SAT’17),août 2017.

2017 Sébastien Konieczny, Jean-Marie Lagniez, Pierre Marquis, SAT Encodings for Distance-Based Belief Merging Operators in AAAI,pp. 1163-1169, 2017.

2017 Sébastien Konieczny, Jean-Marie Lagniez, Pierre Marquis, Boosting Distance-Based Belief Revision using SAT Encodings in 6th International Conference on Logic, Rationality and Interaction,Springer, 2017. (Lecture Notes in Computer Science 10455)

2017 Jean-Marie Lagniez, Pierre Marquis, An Improved Decision-DNNF Compiler in 26th International Joint Conference on Artificial Intelligence (IJCAI’17),pp. 667-673, 2017.

2017 Jean-Marie Lagniez, Pierre Marquis, Anastasia Paparrizou, Defining and Evaluating Heuristics for the Compilation of Constraint Networks in 23rd International Conference on Principles and Practice of Constraint Programming (CP 2017 ),Springer, pp. 172-188, 2017.

2017 Thomas Caridroit, Jean-Marie Lagniez, Daniel Le Berre, Tiago De Lima, Valentin Montmirail, A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem in Thirty-First AAAI Conference on Artificial Intelligence (AAAI’17),The AAAI Press, pp. 3864-3870, février 2017. [Download]

2016 Éric Grégoire, Jean-Marie Lagniez, Du Zhang, On Computing Non-hypocritical Consensuses in Standard Logic in 27th International Workshop on Database and Expert Systems Applications ( DEXA Workshops’16),IEEE, pp. 97-101, 2016.

2016 Éric Grégoire, Sébastien Konieczny, Jean-Marie Lagniez, On Consensus Extraction in 25th International Joint Conference on Artificial Intelligence (IJCAI’16),pp. 1095-1101, juillet 2016.

2016 Éric Grégoire, Jean-Marie Lagniez, A Computational Approach to Consensus-Finding in 22th European Conference on Artificial Intelligence (ECAI’16),IOS Press, pp. 795-801, août 2016.

2016 Éric Grégoire, Jean-Marie Lagniez, Du Zhang, Logical consensuses for case-based reasoning and for mathematical engineering of AI in 15th IEEE International Conference on Cognitive Informatics & Cognitive Computing (ICCICC’16)*,IEEE, pp. 29-33, août 2016.

2016 Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary, An Adaptive SAT Solver in Principles and Practice of Constraint Programming - 22nd International Conference (CP’16),pp. 30-48, septembre 2016.

2016 Jean-Marie Lagniez, Emmanuel Lonca, Pierre Marquis, Improving Model Counting by Leveraging Definability in 25th International Joint Conference on Artificial Intelligence (IJCAI’16),pp. 751-757, juillet 2016. [Download]

2016 Anicet Bart, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, An Improved CNF Encoding Scheme for Probabilistic Inference in 22th European Conference on Artificial Intelligence (ECAI’16),pp. 613-621, 2016.

2016 Éric Grégoire, Yacine Izza, Jean-Marie Lagniez, On the Extraction of One Maximal Information Subset That Does Not Conflict with Multiple Contexts in 30th AAAI Conference on Artificial Intelligence (AAAI’16),pp. 3404-3410, février 2016.

2016 Jean-Marie Lagniez, Daniel Le Berre, Tiago De Lima, Valentin Montmirail, On Checking Kripke Models for Modal Logic K in 5th Workshop on Practical Aspects of Automated Reasoning (PAAR’16),http://ceur-ws.org, juin 2016. [Download]

2015 Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Compiling Constraint Networks into Multivalued Decomposable Decision Graphs in 24th International Joint Conference on Artificial Intelligence (IJCAI’15),pp. 332-338, 2015.

2015 Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly, CoQuiAAS: A Constraint-Based Quick Abstract Argumentation Solver in 27th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’15),IEEE, pp. 928-935, novembre 2015. [Download]

2015 Philippe Besnard, Éric Grégoire, Jean-Marie Lagniez, On Computing Maximal Subsets of Clauses that Must Be Satisfiable with Possibly Mutually-Contradictory Assumptive Contexts in 29th AAAI Conference on Artificial Intelligence (AAAI’15),pp. 3710-3716, janvier 2015.

2015 Éric Grégoire, Jean-Marie Lagniez, On Anti-subsumptive Knowledge Enforcement in 20th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR’15),Springer Berlin Heidelberg, pp. 48-62, novembre 2015. (Lecture Notes in Computer Science, volume 9450)

2014 Anicet Bart, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Knowledge Compilation for Model Counting: Affine Decision Trees in ECAI 2014 - 21st European Conference on Artificial Intelligence (ECAI’14),IOS Press, pp. 51-56, août 2014.

2014 Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure, Enforcing Solutions in Constraint Networks in 21st European Conference on Artificial Intelligence (ECAI’14),pp. 1017-1018, 2014.

2014 Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure, Multiple Contraction through Partial-Max-SAT in 26th International Conference on Tools with Artificial Intelligence (ICTAI’14),pp. 321-327, 2014.

2014 Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure, A General Artificial Intelligence Approach for Skeptical Reasoning in 7th Conference on Artificial General Intelligence (AGI’14),pp. 33-42, 2014.

2014 Anicet Bart, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Symmetry-Driven Decision Diagrams for Knowledge Compilation in ECAI 2014 - 21st European Conference on Artificial Intelligence (ECAI’14),pp. 51-56, 2014.

2014 Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure, An Experimentally Efficient Method for (MSS, CoMSS) Partitioning in 28th Conference on Artificial Intelligence (AAAI’14),pp. 2666-2673, 2014.

2014 Jean-Marie Lagniez, Pierre Marquis, Preprocessing for Propositional Model Counting in AAAI,pp. 2688-2694, 2014.

2014 Anicet Bart, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Symmetry-Driven Decision Diagrams for Knowledge Compilation in ECAI,pp. 51-56, 2014.

2013 Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure, Questioning the Importance of WCORE-like Minimization steps in MUC-finding Algorithms in 25th International Conference on Tools with Artificial Intelligence (ICTAI’13),IEEE Press, pp. 923-930, 2013.

2013 Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Samuel Thomas, Knowledge Compilation for Model Counting: Affine Decision Trees in 23rd International Joint Conference on Artificial Intelligence (IJCAI’13),2013.

2013 Gilles Audemard, Jean-Marie Lagniez, Laurent Simon, Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction in 16th International Conference on Theory and Applications of Satisfiability Testing (SAT’13),Springer, Lecture Notes in Computer Science, vol. 7962, pp. 309-317, 2013.

2013 Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Samuel Thomas, Knowledge Compilation for Model Counting: Affine Decision Trees in IJCAI’2013,IJCAI/AAAI, août 2013.

2013 Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure, Preserving Partial Solutions while Relaxing Constraint Networks in 23th International Joint Conference on Artificial Intelligence (IJCAI’13),pp. 552–558, août 2013.

2013 Gilles Audemard, Jean-Marie Lagniez, Laurent Simon, Just-In-Time Compilation of Knowledge Bases in 23th International Joint Conference on Artificial Intelligence (IJCAI’13),pp. 447–453, août 2013. [Download]

2013 Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Samuel Thomas, Knowledge Compilation for Model Counting: Affine Decision Trees in 23rd International Joint Conference on Artificial Intelligence (IJCAI’13),pp. 947-953, 2013.

2013 Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Samuel Thomas, Knowledge Compilation for Model Counting: Affine Decision Trees in 23rd International Joint Conference on Artificial Intelligence (IJCAI’13),IJCAI/AAAI, pp. 947-953, août 2013.

2013 Jean-Marie Lagniez, Armin Biere, Factoring Out Assumptions to Speed Up MUS Extraction in 16th International Conference on Theory and Applications of Satisfiability Testing (SAT’13),Springer, Lecture Notes in Computer Science (LNCS), vol. 7962, pp. 276-292, 2013.

2012 Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Jean-Marie Lagniez, Cédric Piette, PeneLoPe, a Parallel Clause-Freezer Solver in Proceedings of SAT Challenge 2012: Solver and Benchmarks Descriptions,pp. 43–44, mai 2012. (https://helda.helsinki.fi/handle/10138/34218)

2012 Jean-Marie Lagniez, Éric Grégoire, Bertrand Mazure, A Data Structure Boosting The Performance Of Local Search For Csp Solving in International Conference on Metaheuristics and Nature Inspired Computing (META’12),octobre 2012.

2012 Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure, Relax! in 24th International Conference on Tools with Artificial Intelligence (ICTAI’12),IEEE Computer Press, pp. 146–153, novembre 2012.

2012 Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Jean-Marie Lagniez, Cédric Piette, Revisiting Clause Exchange in Parallel SAT Solving in 15th International Conference on Theory and Applications of Satisfiability Testing (SAT’12),Springer, Lecture Notes in Computer Science(LNCS), vol. 7962, pp. 200–213, mai 2012.

2011 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, On freezeing and reactivating learnt clauses in 14th International Conference on Theory and Applications of Satisfiability Testing (SAT’11),Springer, Lecture Notes in Computer Science (LNCS), vol. 6695, pp. 188-200, juin 2011. (Best paper award)

2011 Long Guo, Jean-Marie Lagniez, Dynamic Polarity Adjustment in a Parallel SAT Solver in 23rd International Conference on Tools with Artificial Intelligence (ICTAI’11),IEEE Computer Press, pp. 67-73, 2011.

2011 Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure, A CSP solver focusing on FAC variables in 17th International Conference on Principles and Practice of Constraint Programming (CP’11),Springer, Lecture Notes in Computer Science (LNCS), vol. 6876, pp. 493-507, septembre 2011.

2010 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, Boosting local search thanks to CDCL in 17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR’10),Springer, Lecture Notes in Computer Science (LNCS), vol. 6397, pp. 474–488, octobre 2010.

2009 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, Learning in local search in 21st International Conference on Tools with Artificial Intelligence (ICTAI’09),IEEE Computer Society, pp. 417-424, novembre 2009.

2009 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, Integrating Conflict Driven Clause Learning to Local Search in 6th International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS’09),septembre 2009. (dans le cadre de CP’09)

Article(s) de conférence(s) nationale(s)

2017 Thomas Caridroit, Jean-Marie Lagniez, Daniel Le Berre, Tiago De Lima, Valentin Montmirail, Une approche basée sur SAT pour le problème de satisfiabilité en logique modale S5 in Actes des 13es journées Francophones de Programmation par Contraintes (JFPC’17),pp. 45-53, juin 2017. [Download]

2017 Jean-Marie Lagniez, Daniel Le Berre, Tiago De Lima, Valentin Montmirail, Un raccourci récursif pour CEGAR : Application au problème de satisfiabilité en logique modale K in Actes des 11es Journées d?Intelligence Artificielle Fondamentale (JIAF’2017),juillet 2017.

2016 Jean-Marie Lagniez, Emmanuel Lonca, Pierre Marquis, Exploiter les définitions pour le comptage de modèles in 12èmes Journée Francophone de Programmation par Contraintes (JFPC’16),2016.

2016 Jean-Marie Lagniez, Daniel Le Berre, Tiago De Lima, Valentin Montmirail, À propos de la vérification de modèles en logique modale K in Dixièmes Journées de l’Intelligence Artificielle Fondamentale JIAF’2016 (JIAF’16),pp. 10, juin 2016. [Download]

2016 Anicet Bart, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Un schéma d’encodage propositionnel pour l’inférence probabiliste à partir de modèles graphiques in Dixièmes Journées Nationales de l’Intelligence Artificielle Fondamentale (IAF’16),2016.

2015 Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Samuel Thomas, Compilation de réseaux de contraintes en graphes de décision décomposables multivalués in 11èmes Journées Francophones de Programmation par Contraintes (JFPC’15) (JFPC’15),2015.

2015 Jean-Marie Lagniez, Sébastien Tabary, Nicolas Szczepanski, Swarmsat : un solveur sat massivement parallèle. in 11èmes Journées Francophones de Programmation par Contraintes,juin 2015.

2014 Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure, Une méthode expérimentalement efficace de partition d’une CNF en un MSS et un CoMSS in 10ièmes Journées Francophones de Programmation par Contraintes (JFPC’14),pp. 183-192, 2014.

2013 Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Samuel Thomas, Arbres de décision affine pour le comptage de modèles in 7èmes Journées Nationales de l’Intelligence Artificielle Fondamentale (IAF’13),2013. (actes électroniques)

2013 Gilles Audemard, Jean-Marie Lagniez, Laurent Simon, Du glucose en goutte à goutte pour les coeurs insatisfiables in 9ièmes Journées Francophones de Programmation par Contraintes (JFPC’13),pp. 59-66, 2013. [Download]

2012 Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Jean-Marie Lagniez, Cédric Piette, Résolution parallèle de SAT : mieux collaborer pour aller plus loin in 8ièmes Journées Francophones de Programmation par Contraintes (JFPC’12),pp. 35–44, mai 2012.

2010 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Approche hybride pour SAT in 17ième Congrès Francophone sur la Reconnaissance des Formes et Intelligence Artificielle (RFIA’10),pp. 279–286, janvier 2010. [Download]

2009 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, Analyse de conflits dans le cadre de la recherche locale in 5ièmes Journées Francophones de la Programmation par Contraintes (JFPC’09),pp. 215-224, juin 2009. [Download]

Rapport(s) technique(s)

2013 Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Jean-Marie Lagniez, Cédric Piette, PeneLoPe in SAT Competition 2013 Helsinki, mai 2013. [Download]

2010 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, SatHYS: Sat Hybrid Solver Proceedings of SAT Race 2010: Solver and Benchmarks Descriptions, Edinburgh, Scotland, UK, juillet 2010.

2010 Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs, RCL: Reduce learnt clauses Proceedings of SAT Race 2010: Solver and Benchmarks Descriptions, Edinburgh, Scotland, UK, juillet 2010.