Said Jabbour

Associate Professor (Maître de Conférences - HDR en informatique)
Lens Computer Research Center (CRIL) - Avenue jean souvraz SP 18 F-62307, Lens Cedex 3 - France
  P302
  jabbour[arobas]cril[dot]fr
  (+33) 3 21 79 80 25
 (+33) 3 21 79 17 70

About Me
I am a graduate engineer from ENSEM of Nancy. I'm Associate Professor at University of Artois since 2010. I'm a member of both projects PAJERO and DAG visit the page of our recent works, Penelope, ManySAT and Data Mining and Constraints.

This is a list of the topics of my research.

  • Boolean Satisfiability (SAT)
  • Quantified boolean formulas (QBF).
  • Parallel SAT Data Mining and Constraint programming
  • Modal Logics
  • Knowledge Representation


Graduate Students (Research)
  • Long Guo (PhD) - Parallel SAT
  • Benoit Hoessen (PhD) - Parallel SAT
  • Jerry Lonlac (PhD) - SAT
  • Mehdi Lkhiari - (PostDoc) Constraints and data mining
  • Florian Legendre - (PostDoc) Constraints and data mining


Some Recent Works
  • Compression of SAT instances using Itemset Mining
  • Boolean Satisfiability and Sequence Mining
  • Top-k in Frequent Itemsets Mining using Top-k SAT problem
  • Distributed SAT
  • New encoding of Cardinality Constraints using pigeon-hole problem
  • Symmetries and Frequents Itemsets Mining
  • Measuring Inconsistency using minimal proofs

Recent Projects :

Publications

Conferences :

2019

Saïd Jabbour, Jerry Lonlac, et Lakhdar Saïs, Mining Gradual Itemsets Using Sequential Pattern Mining, (FUZZ-IEEE 2019), 2019.

2018

Ouled Dlala Imen, Saïd Jabbour, Badran Raddaoui, Lakhdar Saïs, A Parallel SAT based Framework for Closed Frequent Pattern Mining, (CP 2018), pages 570-587.

Saïd Jabbour, Mhadhbi Nizar, Badran Raddaoui, et Lakhdar SaïsTriangle-Driven Community Detection in Large Graphs Using Propositional Satisfiability, (IEEE AINA 2018), pages 437--444.

Saïd Jabbour, Fatima Ezzahra Mana, Ouled Dlala Imen, Badran Raddaoui, et Lakhdar SaïsOn Maximal Frequent Itemsets Mining With Constraints, (CP 2018), pages 554--569.

Saïd Jabbour and Nizar Mhadhbi and Badran Raddaoui, et Lakhdar SaïsPushing the Envelope in Overlapping Communities Detection, (IDA 2018), pages 151--163.

Abdelhamid Boudane, Saïd Jabbour, Badran Raddaoui, et Lakhdar SaïsEfficient SAT-based Encodings of Conditional Cardinality Constraints, (LPAR 2018), pages 181--195.

Saïd Jabbour and Nizar Mhadhbi and Badran Raddaoui, et Lakhdar SaïsDetecting Highly Overlapping Community Structure by Model-based Maximal Clique Expansion, (IEEE BigData 2018), pages 1031--1036.

2017

Saïd Jabbour, Nizar Mhadahbi, Badran Raddaoui, Lakhdar Saïs, A SAT-based Framework for Overlapping Community Detection in Networks, (PAKDD 2017), pages 786--798.

Abdelhamid Boudane, Saïd Jabbour, Lakhdar Saïs, and Yakoub Salhi, Clustering Complex Data Represented as propositional formulas, (PAKDD 2017), pages 441-452.

bdelhamid Boudane, Saïd Jabbour, Lakhdar Saïs, and Yakoub Salhi, Enumerating Non-Redundant Association Rules Using Satisfiability, (PAKDD 2017), pages 824-836.

Amel Bouzeghoub, Saïd Jabbour, Yue Ma, et Badran Raddaoui, Handling conflicts in uncertain ontologies using deductive argumentation, (WI 2017), pages 65-72.

Abderrahim Ait Wakrime, Saïd Jabbour, Formal Approach for QoS-Aware Cloud Service Composition, (WETICE 2017), pages 30--35.

Soukaina Hattad, Saïd Jabbour, Lakhdar Saïs, et Yakoub Salhi, Enhancing Pigeon-Hole based Encoding of Boolean Cardinality Constraints, (ICAART 2017), pages 299--307.

Saïd Jabbour, Fatima Zahra Mana, et Lakhdar Saïs, On Maximal Frequent Itemsets Enumeration, (SoCPaR 2017), pages 151--160.

2016

Abdelhamid Boudane, Saïd Jabbour, Lakhdar Saïs, et Yakoub SalhiA SAT-based Approach for Mining Association Rules, (IJCAI 2016), pages 2472--2478.

Saïd Jabbour,Yue Ma, Badran Raddaoui, Lakhdar Saïs, et Yakoub SalhiA MIS Partition Based Framework for Measuring Inconsistency, (KR 2016), pages 84--93.

Saïd JabbourOn inconsistency measuring and Resolving, (ECAI 2016), pages 1676--1677.

Saïd Jabbour, Lakhdar SaïsExploiting MUS Structure to Measure Inconsistency of Knowledge Bases, (ECAI 2016), pages 991--998.

Saïd Jabbour, Badran Raddaoui, Lakhdar Saïs, et Yakoub Salhi, On the Computation of Top-k Extensions in Abstract Argumentation Frameworks, (ECAI 2016), pages 913--920.

Saïd Jabbour, Nizar Mhadhbi, Abdesattar Mhadhbi, Badran Raddaoui, et Lakhdar Saïs, Summarizing big graphs by means of pseudo-boolean constraints, (BigData 2016), pages 889--894.

Imen Ouled Dlala, Saïd Jabbour, Badran Raddaoui, Lakhdar Saïs, et Boutheina Ben Yaghlane, A SAT-based Approach for Enumerating Interesting Patterns from Uncertain Data, (ICTAI 2016) pages 255--262.

Saïd Jabbour, Souhila Kaci, Lakhdar Saïs, et Yakoub SalhiItemset Mining with Penalties, (ICTAI 2016), pages 962--966.

Imen Ouled Dlala, Saïd Jabbour, Lakhdar Saïs, et Boutheina Ben Yaghlane, A Comparative Study of SAT-based Itemsets Mining Algorithms, (SGAI 2016), pages 37--52.

Abderrahim Ait Wakrime, Saïd JabbourOn repairing queries in cloud computing, (AICCSA 2016), pages 1--6.

Saïd Jabbour, Nizar Mhadhbi, Abdesattar Mhadhbi, Badran Raddaoui, et Lakhdar SaïsSummarizing big graphs by means of pseudo-boolean constraints, (IEEE BigData 2016), pages 889--894.

2015

Abderrahim Ait Wakrime, Salima Benbernou, et Saï}d Jabbour : Relaxation based SaaS for Repairing Failed Queries over the Cloud Computing, (ICEBE 2015}), pages 245-250.

Abderrahim Ait Wakrime, Saïd Jabbour : Minimum Unsatisfiability Based QoS Web Service Composition over the Cloud Computing, (ISDA 2015), pages 540-545.

Imen Ouled Dlala, Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi, et Bouteina Ben Yaghlane : Parallel SAT Based Closed Frequent Itemsets Enumeration, (AICCSA 2015), pages 1-8.

Saïd Jabbour, Stéphanie Roussel, Lakhdar Saïs, et Yakoub Salhi : Mining to Compress Table Constraints,(ICTAI 2015), pages 405--412.

Saïd Jabbour, Lakhdar Saïs, et Yakoub Salhi : Decomposition-based SAT Encodings for Itemset Mining Problems. (PAKDD 2015), pages 662--674.

Saïd Jabbour, Yue Ma, Raddaoui Badran, Lakhdar Saïs, et Yakoub Salhi : On Structure-Based Inconsistency Measures and Their Computations via Closed et Packing, (AAMAS 2015), pages 1749--1750.

Saïd Jabbour, Badran Raddaoui, et Lakhdar Saïs : Inconsistency-based Ranking of Knowledge Bases. (ICAART 2015), pages 414--419.

Abderrahim Ait Wakrime, Saïd Jabbour : On QoS web service composition using satisfiability, (ICTA 2015), pages 1--6.

2014

Belaid Benhamou, Saïd Jabbour, Lakhdar Saïs, et Yakoub Salhi : A generic and declarative method for symmetry breaking in itemset mining, (IC3K 2014), pages 143--160.

Saïd Jabbour, Yue Ma, Badran Raddaoui, et Lakhdar Saïs : Prime Implicates Based Inconsistency Characterization, (ECAI 2014), pages 1037--1038.

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

Saïd Jabbour, Yue Ma, Badran Raddaoui, et Lakhdar Saïs. On the Characterization of Inconsistency Measures: A Prime Implicates Based Framework, (ICTAI 2014), pages 146--153.

Long Guo, Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs : Diversification by Clauses Deletion Strategies in Portfolio Parallel SAT Solving, (ICTAI 2014), pages 701--708.

Saïd Jabbour, Yue Ma, Badran Raddaoui, et Lakhdar Saïs : On the Characterization of Inconsistency: A Prime Implicates Based Framework, (ICTAI 2014), pages 146--153.

Belaïd Benhamou, Saïd Jabbour, Lakhdar Saïs, et Yakoub Salhi : Symmetry Breaking in Itemset Mining, (KDIR 2014), pages 86--96.

Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs, et Yakoub Salhi : Extending Modern SAT Solvers for Models Enumeration, (IEEE IRI 2014), pages 803--810.

Saïd Jabbour and Lakhdar Saïs, et Yakoub Salhi : A Pigeon-Hole Based Encoding of Cardinality Constraints, (ISAIM 2014), pages 1--13.

Gilles Audemard, Benoit Hoessen, Saïd Jabbour, et Cédric Piette : An Effective Distributed D\&C Approach for the Satisfiability Problem, (PDP 2014), pages 183--187.

Gilles Audemard, Benoit Hoessen, Saïd Jabbour, et Cédric Piette : Dolius: A Distributed Parallel SAT Solving Framework, ( POS-SAT 2014), pages 1--11.

2013

Jabbour Saïd, Saïs Lakhdar, et Salhi Yakoub : Top-k Frequent Closed Itemset Mining Using Top-k SAT Problem, (ECML/PKDD 2013), pages 131--140.

Jabbour Saïd, Saïs Lakhdar, Salhi Yakoub, et Uno Takeaki : Mining-Based Compression Approach of Propositional Formulae, (CIKM 2013), pages 289-298.

Jabbour Saïd, Saïs Lakhdar, et Salhi Yakoub : Boolean Satisfiability for Sequence Mining, (CIKM 2013), pages 649--658.

Jabbour Saïd, Lonlac Jerry, et Saïs Lakhdar : Adding New Bi-Asserting Clauses For Faster Search in Modern SAT Solvers, (SARA 2013), pages 66--72.

Jabbour Saïd, Khiari Mehdi, Saïs Lakhdar, Salhi Yakoub, et Tabia Karim : Symmetry-Based Pruning in Itemset Mining, (ICTAI 2013), pages 483--490.

Salhi Yakoub, Jabbour Saïd, et Saïs Lakhdar : Graded Modal Logic GS5 and Itemset Support Satisfiability, (ISIP 2013), pages 131--140.

-- 2012

Saïd Jabbour,Lakhdar Saïs, Yakoub Salhi, etKarim Tabia. Symmetries in Itemset Mining, (ECAI 2012), pages 432--437.

Emmanuel Coquery,Saïd Jabbour,Lakhdar Saïs, et Yakoub Salhi : A SAT-based Approach for Discovering Frequent, Closed and Maximal Patterns in a Sequence, (ECAI 2012), pages 258--263.

Saïd Jabbour, Jerry Lonlac, et Lakhdar Saïs : Intensification Search in Modern SAT Solvers, (SAT 2012), pages 491-492.

Saïd Jabbour, Jerry Lonlac, et Lakhdar Saïs : Extending Resolution by Dynamic Substitution of Boolean Functions, (ICTAI 2012), pages 1029-1034.

Yakoub Salhi, Saïd Jabbour, et Lakhdar Saïs : Graded Modal Logic GS5 and Itemset Support Satisfiability, (ISIP 2012), pages 131-140.

Gilles Audemard, Benoit Hoessen, Saïd Jabbour, Jean-Marie Lagniez, Cédric Piette : Revisiting Clause Exchange in Parallel SAT Solving, (SAT 2012), pages 200-213.

Guo Long, Hamadi Youssef, Jabbour Saïd, et Saïs Lakhdar : Diversification and Intensification in Parallel SAT Solving, (CP 2010), pages 252-265.

Youssef Hamadi, Saïd Jabbour, et Lakhdar Saïs : Learning for Dynamic Subsumption, (ICTAI 2009), pages 328-335 (Best Paper Award).

Saïd Jabbour : Learning for Dynamic Assignments Reordering, (ICTAI 2009), pages 336-343.

Youssef Hamadi, Saïd Jabbour, et Lakhdar Saïs : Control-based Clause Sharing in Parallel SAT Solving, (IJCAI 2009), pages 499-504.

Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, et Lakhdar Saïs : A Generalized Framework for Conflict Analysis, (SAT 2008), pages 21--27.

Gilles Audemard, Saïd Jabbour and lakhdar Saïs : Dealing with symmetries in quantified boolean formulas, (IJCAI 2007), pages 2262--2267.

Journals

Tools & Downloads

Awards

  • 3rd Place, Penelope, SAT Competition 2013, Category: Parallel Solvers
  • Silver medal, Penelope, SAT Challenge 2012 (Parallel solvers category)
  • Silver medal, ManySAT 1.5, SAT Race 2010 (Parallel solvers category)
  • Bronze medal, ManySAT 1.1, SAT Race 2010 (Parallel solvers category)
  • 1st rank (Jury special price) ManySAT, International SAT 2009 competition (Parallel Track) in Application category, June 30 - July 3, 2009, Swansea, Wales, United Kingdom
  • Two bronze medal, LySAT, International SAT 2009 competition (Sequential Track) in Application category (SAT-UNSAT and UNSAT), June 30 - July 3, 2009, Swansea, Wales, United Kingdom
  • Gold medal, ManySAT1.0, SAT Race 2008 (Parallel solvers category)
  • Best Paper Award, Proceedings of the 21th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), 2009 Youssef Hamadi , Saïd Jabbour, and Lakhdar Saïs. Learning for Dynamic Subsumption.