Publications

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

2015 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, Mining Top-k motifs with a SAT-based framework in Artificial Intelligence (AIJ),2015. [Download]

2012 Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Learning from Conflicts in Propositional Satisfiability in A Quarterly Journal of Operations Research (4OR),vol. 1, n° 10, pp. 15-32, 2012.

2011 Youssef Hamadi, Saïd Jabbour, Cédric Piette, Lakhdar Saïs, Deterministic Parallel DPLL in Journal on Satisfiability, Boolean Modeling and Computation (JSAT),vol. 7, n° 4, pp. 127-132, 2011. [Download]

2010 Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Learning for Dynamic Subsumption in International Journal on Artificial Intelligence Tools (IJAIT),vol. 19, n° 4, pp. 511-529, 2010.

2010 Saïd Jabbour, Learning from successes in International Journal on Artificial Intelligence Tools (IJAIT),vol. 19, n° 4, pp. 373-391, 2010.

2009 Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, ManySAT: a parallel SAT solver. in Journal on Satisfiability, Boolean Modeling and Computation (JSAT),vol. 6, IOS Press, pp. 245-262, 2009.

2008 Gilles Audemard, Saïd Jabbour, Lakhdar Saïs, SAT Graph-Based Representation: A New Perspective in Journal of Algorithms,vol. 63, pp. 17–33, 2008. [Download]

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

2016 Abdelhamid Boudane, Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, A SAT-based Approach for Mining Association Rules in International Joint Conference on Artificial Intelligence (IJCAI-16),juillet 2016.

2016 Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Saïs, Yakoub Salhi, A MIS Partition Based Framework for Measuring Inconsistency in 15th International Conference on Principles of Knowledge Representation and Reasoning (KR’16),AAAI Press, pp. 84-93, 2016.

2016 Saïd Jabbour, Badran Raddaoui, Lakhdar Saïs, Yakoub Salhi, On the Computation of Top-k Extensions in Abstract Argumentation Frameworks in 22th European Conference on Artificial Intelligence (ECAI’16),août 2016.

2015 Saïd Jabbour, Stéphanie Roussel, Lakhdar Saïs, Yakoub Salhi, Mining to Compress Table Constraints in 27th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’15),IEEE Computer Society, pp. 405-412, 2015.

2015 Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Saïs, Yakoub Salhi, On Structure-Based Inconsistency Measures and Their Computations via Closed Set Packing in AAMAS,pp. 1749-1750, 2015.

2015 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, Decomposition Based SAT Encodings for Itemset Mining Problems in PAKDD (2),pp. 662-674, 2015.

2014 Saïd Jabbour, Joao Marques-Silva, Lakhdar Saïs, Yakoub Salhi, Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form in JELIA,pp. 152-165, 2014.

2014 Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Cédric Piette, An Effective Distributed D&C Approach for the Satis?ability Problem in 22nd International Conference on Parallel, Distributed and Network-Based Computing (PDP’14),pp. 183-187, février 2014.

2014 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Yakoub Salhi, Extending Modern SAT Solvers for Models Enumeration in 11th IEEE International Conference on Information Reuse and Integration (IRI’14),IEEE Computer Society, pp. 803-810, 2014.

2014 Belaid Benhamou, Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, A Generic and Declarative Method for Symmetry Breaking in Itemset Mining in Knowledge Discovery, Knowledge Engineering and Knowledge Management - 6th International Joint Conference (IC3K),Springer, pp. 143-160, 2014. (Selected paper)

2014 Long Guo, Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, A Portfolio Based Parallel SAT Solver with Multiple Deletion Strategies in 4th Workshop on Parallel Methods for Constraint Solving (ParSearchOpt’14),juillet 2014.

2014 Long Guo, Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Diversification by Clauses Deletion Strategies in Portfolio Parallel SAT Solving in 26th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’14),pp. (to appear), 2014.

2014 Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Cédric Piette, Dolius: A Distributed Parallel SAT Solving Framework in Pragmatics of SAT 2014 (POS’14),juillet 2014.

2014 Belaid Benhamou, Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, Symmetry Breaking in Itemset Mining in KDIR,pp. 86-96, 2014.

2013 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Adding New Bi-Asserting Clauses For Faster Search in Modern SAT Solvers in 10th Symposium on Abstraction, Reformulation, and Approximation (SARA’13),AAAI Press, pp. 66-72, juillet 2013.

2013 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, Top-k Frequent Closed Itemset Mining Using Top-k SAT Problem in European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD’13),Springer, vol. 146, pp. 131-140, 2013.

2013 Yakoub Salhi, Saïd Jabbour, Lakhdar Saïs, Graded Modal Logic GS5 and Itemset Support Satisfiability in Information Search, Integration and Personalization (ISIP’13),Springer, Communications in Computer and Information Science, pp. 131-140, 2013.

2013 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, A Pigeon-Hole Based Encoding of Cardinality Constraints in 29th International Conference on Logic Programming (ICLP’13),2013.

2013 Saïd Jabbour, Mehdi Khiari, Lakhdar Saïs, Yakoub Salhi, Karim Tabia, Symmetry-Based Pruning in Itemset Mining in 25th International Conference on Tools with Artificial Intelligence (ICTAI’13),IEEE Computer Society, novembre 2013.

2013 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, Boolean Satisfiability for Sequence Mining in 22nd International Conference on Information and Knowledge Management (CIKM’13),ACM Press, pp. 649-658, octobre 2013.

2013 Saïd Jabbour, Badran Raddaoui, Measuring Inconsistency Through Minimal Proofs in 12th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU’13),Springer, Lecture Notes in Computer Science, vol. 7958, pp. 290-301, 2013. (runner-up as best student paper)

2013 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, Takeaki Uno, Mining-Based Compression Approach of Propositional Formulae in 22nd International Conference on Information and Knowledge Management (CIKM’13),ACM Press, pp. 289-298, octobre 2013.

2012 Saïd Jabbour, , Nadjib Lazaar, Youssef Hamadi, Michelle Sebag, Cooperation control in Parallel SAT Solving: a Multi-armed Bandit Approach in Workshop on Bayesian Optimization and Decision Making,decembre 2012. (dans le cadre de NIPS’12)

2012 Emmanuel Coquery, Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, A SAT-Based Approach for Discovering Frequent, Closed and Maximal Patterns in a Sequence in 20th European Conference on Artificial Intelligence (ECAI’12),IOS Press, pp. 258-263, 2012.

2012 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Intensification Search in Modern SAT Solvers in 15th International Conference on Theory and Applications of Satisfiability Testing (SAT’12),Springer, Lecture Notes in Computer Science(LNCS), vol. 7962, pp. 491-492, 2012.

2012 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Extending Resolution by Dynamic Substitution of Boolean Functions in 24th International Conference on Tools with Artificial Intelligence (ICTAI’12),IEEE Computer Press, pp. 1029-1034, 2012.

2012 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, Karim Tabia, Symmetries in Itemset Mining in 20th European Conference on Artificial Intelligence (ECAI ‘12),IOS Press, pp. 432-437, août 2012.

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 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 Emmanuel Coquery, Saïd Jabbour, Lakhdar Saïs, A Constraint Programming Approach for Enumerating Motifs in a Sequence in International Workshop on Declarative Pattern Mining (DPM’11),pp. 1091-1097, 2011.

2011 Youssef Hamadi, Saïd Jabbour, Cédric Piette, Lakhdar Saïs, Deterministic Parallel DPLL: System Description in Pragmatics of SAT (POS’11),pp. 127-132, juin 2011. (dans le cadre de SAT’11)

2010 Long Guo, Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Diversification and Intensification in Parallel SAT Solving in 16th International Conference on Principles and Practice of Constraint Programming (CP’10),Springer, Lecture Notes in Computer Science (LNCS), vol. 6308, pp. 252-265, septembre 2010.

2009 Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Learning for Dynamic Subsumption in 21st International Conference on Tools with Artificial Intelligence (ICTAI’09),IEEE Computer Society, pp. 328-335, novembre 2009. (Best paper award)

2009 Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Control-Based Clause Sharing in Parallel SAT Solving in 21st International Joint Conference on Artificial Intelligence (IJCAI’09),pp. 499-504, juillet 2009.

2009 Saïd Jabbour, Learning for Dynamic Assignments Reordering in 21st International Conference on Tools with Artificial Intelligence (ICTAI’09),IEEE Computer Society, pp. 336-343, novembre 2009.

2008 Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, A generalized Framework For Conflict Analysis in 11th International Conference on Theory and Applications of Satisfiability Testing (SAT’08),Springer, Lecture Notes in Computer Science (LNCS), vol. 4996, pp. 21–27, mai 2008.

2007 Gilles Audemard, Saïd Jabbour, Lakhdar Saïs, Symmetry Breaking in Quantified Boolean Formulae in International Joint Conference on Artificial Intelligence (IJCAI’2007),pp. 2262–2267, janvier 2007. [Download]

2007 Gilles Audemard, Saïd Jabbour, Lakhdar Saïs, Using SAT-Graph representation to derive hard instances in 14th RCRA workshop Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA’07),juillet 2007.

2007 Gilles Audemard, Saïd Jabbour, Lakhdar Saïs, Efficient Symmetry breaking Predicates for quantified boolean formulae in Workshop on Symmetry and Constraint Satisfaction Problems - Affiliated to CP (SymCon),septembre 2007.

Article(s) de revue(s) nationale(s)

2014 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Clémentin Tayou Djamegni, Resolution Etendue par Substitution Dynamique des Fonctions Booleennes in Revue d’intelligence artificielle (RIA),2014. (to appear)

2011 Saïd Jabbour, Lakhdar Saïs, Symétries et QBF in Revue d’Intelligence Artificielle (RIA),vol. 26, n° 1-2, Hermes, pp. 813-835, 2011.

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

2014 Saïd Jabbour, Mehdi Khiari, Lakhdar Saïs, Yakoub Salhi, Karim Tabia, Symétries et Extraction de Motifs Ensemblistes in EGC,pp. 407-418, 2014.

2014 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Yakoub Salhi, Autours des Strategies de Reduction de la Base de Clauses Apprises. in 10èmes Journées Francophones de Programmation par Contraintes (JFPC’14),juin 2014.

2014 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Nouvelles Clauses Bi-Assertives et leurs Int?gration dans les Solveurs SAT Modernes in 10èmes Journées Francophones de Programmation par Contraintes (JFPC’14),juin 2014.

2013 Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Cédric Piette, Un nouveau cadre diviser pour régner pour SAT distribué in 9ièmes Journées Francophones de Programmation par Contraintes (JFPC’13),pp. 51-58, 2013. [Download]

2013 Saïd Jabbour, Badran Raddaoui, Mesure des incohérences en logique propositionnelle in 7ièmes Journées de l’Intelligence Artificielle Fondamentale (IAF’13),2013.

2013 Long Guo, Saïd Jabbour, Lakhdar Saïs, Stratégies d’élimination des clauses apprises dans les solveurs SAT modernes in 9ièmes Journées Francophones de Programmation par Contraintes (JFPC’13),pp. 147-156, 2013.

2012 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Resolution Etendue par Substitution Dynamique des Fonctions Booleennes in 8eme Journées Francophones de Programmation par Contraintes (JFPC’12),pp. 146-155, mai 2012.

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.

2012 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Intensification Search in Modern SAT Solvers in 8ièmes Journées Francophones de Programmation par Contraintes (JFPC’12),pp. 156-159, mai 2012.

2011 Youssef Hamadi, Saïd Jabbour, Cédric Piette, Lakhdar Saïs, Concilier Parallélisme et Déterminisme dans la Résolution de SAT in 7ièmes Journées Francophones de la Programmation par Contraintes (JFPC’11),pp. 163-172, juin 2011.

2009 Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Réordonnancement dynamique basé sur l’apprentissage in 5ièmes Journées Francophones de la Programmation par Contraintes (JFPC’09),pp. 295-304, juin 2009.

2009 Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Subsumption dirigée par l’analyse de conflits in 5ièmes Journées Francophones de la Programmation par Contraintes (JFPC’09),pp. 105-114, juin 2009.

2008 Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Un cadre général pour l’analyse des conflits in 4ièmes Journées Francophones de Programmation par Contraintes (JFPC’08),pp. 267–276, juin 2008. [Download]

2006 Gilles Audemard, Saïd Jabbour, Lakhdar Saïs, Exploitation des symétries dans les formules booléennes quantifiées in 2ndes Journées Francophones de Programmation par Contraintes (JFPC’06),pp. 257–266, juin 2006.

Chapitre(s) d'ouvrage(s)

2012 Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs, Control-based clause sharing in Parallel SAT in Autonomous Search,chapitre 10, pp. 245-267, Y. Hamadi, E. Monfroy, F. Saubion (Eds.), Springer, 2012.

Rapport(s) technique(s)

2015 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, On SAT Models Enumeration in Itemset Mining in CoRR,ARXIV, 2015. [Download]

2014 Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Saïs, Yakoub Salhi, On the measure of conflicts: A MUS-Decomposition Based Framework in CoRR,ARXIV, 2014. [Download]

2014 Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, Yakoub Salhi, Revisiting the Learned Clauses Database Reduction Strategies in CoRR,ARXIV, 2014. [Download]

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

2013 Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, A Mining-Based Compression Approach for Constraint Satisfaction Problems arxiv, mai 2013. [Download]

2011 Youssef Hamadi, Saïd Jabbour, Cédric Piette, Lakhdar Saïs, Deterministic Parallel (DP)2LL Microsoft Research Cambridge, avril 2011. [Download]