Presentation

image

Centre de recherche en informatique de lens ( CRIL )
Avenue jean souvraz SP 18
F-62307 Lens cedex
Email: jabbour [arobas] cril[dot]fr
Phone: (+33) 3 21 79 80 25
Fax: (+33) 3 21 79 17 70

New !!

New Paper accepted to AAMAS (see Publications)

I'm a member of both projects PAJERO and DAG
visit the page of our recent works, Penelope, ManySAT and Data Mining and Constraints

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

Research areas

I'm Maître de Conférences at University of Artois since 2010. 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

Publications

2016

2015

Saïd Jabbour, L. Sais and Y. Salhi. Decomposition Based SAT Encodings for Itemset Mining Problems. (PAKDD'15).

Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais and Yakoub Salhi. On Structure-Based Inconsistency Measures and Their Computations via Closed Set Packing, (AAMAS'15).

Saïd Jabbour, Badran Raddaoui, and Lakhdar Sais. Inconsistency-Based Ranking of Knowledge Bases, (ICAART'15).

2014

Saïd Jabbour, Joao Marques-Silva, Lakhdar Saïd and Yakoub Salhi. Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form . In the 14th European Conference on Logic in Artificial Intelligence (JELIA'14), 2014.

Saïd Jabbour, Jerry Lonlac, Lakhdar Sais and Yakoub Salhi. Extending Modern SAT Solvers for Models Enumeration. In 15th IEEE International Conference on Information Reuse and Integration. IRI'14 , 2014.

. Saïd Jabbour, Yue Ma, Badran Raddaoui, and Lakhdar Sais. Prime Implicates Based Inconsistency Characterization. In the 21th international European Conference on Artificial Intelligence (ECAI'14), 2014.

Saïd Jabbour, Yue Ma, and Badran Raddaoui. Inconsistency Measurement Thanks to MUS-Decomposition. In the 13th international conference on autonomus agents and mutliagent systems (AAMAS'14), 2014.

Gilles Audemard, Benoît Hoesen, Saïd Jabbour, and Cédric Piette. An Effective Distributed D&C Approach for the Satisfiability Problem , dans 22nd International Conference on Parallel, Distributed and Network-Based Computing (PDP'14) , 2014.

Saïd Jabbour, Lakhdar Sais and Yakoub Salhi. A Pigeon-Hole Based Encoding of Cardinality Constraints. In International Symposium on Artificial Intelligence and Mathematics, ISAIM'14, 2014.

2013

Saïd Jabbour, Lakhdar Saïs and Yakoub Salhi. Booealean Satisfiability for sequence mining. In Twenty-Second ACM International Conference on Information and Knowledge Management (CIKM) , 2013.

Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi and Takeaki Uno. Mining Based compression approach of propositional formulae. In Twenty-Second ACM International Conference on Information and Knowledge Management (CIKM) , 2013.

Saïd Jabbour, Lakhdar Saïs and Yakoub Salhi. The Top-k Frequent Closed Itemset Mining Using Top-k SAT Problem. In Machine Learning and Knowledge Discovery in Databases - European Conference (ECML/PKDD (3)) , pages 403-418, 2013.

Saïd Jabbour, Lakhdar Saïs and Yakoub Salhi. A pigeon-Hole based encoding of cardinality constraints. In 29th International Conference on Logic Programming (TPLP) , 2013.

Saïd Jabbour, and Badran Raddaoui, Measuring Inconsistency Through Minimal Proofs, in European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU) , pages 290-301, 2013

Saïd Jabbour and Jerry Lonlac and Lakhdar Saïs. Adding New Bi-Asserting Clauses for Faster Search in Modern SAT Solvers. In Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation SARA , 2013.

Yakoub Salhi, Saïd Jabbour, and Lakhdar Saïs. Graded Modal Logic GS5 and Itemset Support Satisfiability, in Information Search, Integration and Personalization (ISIP) , (to appear), 2013

Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi and Karim Tabia. Symmetry-Based Pruning in Itemset Mining. In International Conference on Tools with Artificial Intelligence (ICTAI), 2013.

2012

Youssef Hamadi, Saïd Jabbour, and Lakhdar Saïs, Control-based clause sharing in Parallel SAT, in Autonomous Search , Eds. Y. Hamadi, F. Saubion, and E. Monfroy, Springer (book chapter), 2012

Youssef Hamadi, Saïd Jabbour, and Lakhdar Saïs Learning in SAT , in A Quarterly Journal of Operations Research (4OR), 2012

Emmanuel Coquery, Said Jabbour, Lakhdar Sais, Yakoub Salhi, A SAT-Based Approach for Discovering Frequent, Closed and Maximal Patterns in a Sequence, in the biennial European Conference on Artificial Intelligence (ECAI) , 2012

Said Jabbour, Lakhdar Sais, Yakoub Salhi, Karim Tabia, Symmetries in Itemset Mining, in the biennial European Conference on Artificial Intelligence (ECAI) , 2012

Gilles Audemard, Benoit Hoessen, Saïd Jabbour, Jean-marie Lagniez, Cédric Piette Revisiting Clause Exchange in Parallel SAT Solving , in Fifteenth International Conference on Theory and Applications of Satisfiability Testing, (SAT) , 2012.

Saïd Jabbour, Jerry Lonalc and Lakhdar Saïs Intensification search in modern SAT solvers , in Fifteenth International Conference on Theory and Applications of Satisfiability Testing, (SAT) , poster presentation, 2012.

2011

Emmanuel Coquery and Said Jabbour and Lakhdar Sais A Constraint Programming Approach for Enumerating Motifs in a Sequence in ( ICDM Workshops ), 2011

Youssef Hamadi, Said Jabbour, Cédric Piette, Lakhdar Sais, Deterministic Parallel DPLL: System Description , in Pragmatics of SAT ( POS ), 2011.

Youssef Hamadi, Said Jabbour, Cédric Piette, Lakhdar Sais, Deterministic Parallel DPLL , in Journal on Satisfiability, Boolean Modeling and Computation ( JSAT ), vol. 7, n° 4, pp. 127-132, 2011.

2010

Youssef Hamadi , Saïd Jabbour, and Lakhdar Saïs Learning for Dynamic Subsumption, in International Journal on Artificial Intelligence Tools ( IJAIT ), Volume 19, number 4, pages 511-529, 2010.

Saïd Jabbour Learning from successes, in International Journal on Artificial Intelligence Tools ( IJAIT), Volume 19, number 4, pages 373-391, 2010.

Youssef Hamadi, Saïd Jabbour and Lakhdar Saïs Diversification and Intensification in Parallel SAT Solving, in 16th International Conference on Principles and Practices of Constraint Programming (CP), 2010.

[Saïd Jabbour and Lakhdar Saïs Model-based elimination of symmetries in quantified boolean formulas, in Cinquième Conférence Internationale en Recherche Opérationnelle (CIRO), 2010

2009

Youssef Hamadi, Saïd Jabbour, and Lakhdar Saïs, ManySAT: a new Parallel SAT solver, In Journal of Satisfiability Boolean Modeling and Computation, (JSAT), special issue on Parallel SAT solving, 2009

Youssef Hamadi, Saïd Jabbour, and Lakhdar Saïs Learning for Dynamic Subsumption, in proceedings of the 21th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 328-335, 2009,

Saïd Jabbour Learning for Dynamic Assignments Reordering, in proceedings of the 21th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 336-343, 2009, Youssef Hamadi, Saïd Jabbour, and Lakhdar Saïs Control-based clause sharing in Parallel SAT solving, in twenty-first International Joint Conference on Artificial Intelligence (IJCAI), pages 499-504, 2009

2008

Gilles Audemard, Saïd Jabbour, and Lakhdar Saïs Graph-based SAT representation : a new perspective. In Journal of Algorithms in Logic, Informatics and Cognition (JALIC), 2008

Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, and Lakhdar Saïs, A Generalized Framework for Conflict Analysis, in 11th International Conference on Theory and Applications of Satisfiability Testing (SAT), H. Kleine Büning and X. Zhao (Eds.), LNCS 4996, pages 21-27, 2008

2007

Gilles Audemard, Saïd Jabbour, and Lakhdar Saïs, Symmetry breaking in quantified boolean formulae, in International Joint Conference on Artificial Intelligence (IJCAI), pages 2262-2267, 2007

Gilles Audemard, Saïd Jabbour, Lakhdar Saïs, Using SAT-Graph representation to derive hard SAT instances. In Proceedings of the 14th Intl. Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA), 2007,

National Conferences

2013

Saïd Jabbour, and Badran Raddaoui, Mesure des incohérences en logique propositionnelle, dans 7ème Journ?es de l'Intelligence Artificielle Fondamentale (IAF), (to appear), 2013

Long Guo, Saïd Jabbour, and Lakhdar Saïs, Stratégies d'élimination des clauses apprises dans les solveurs SAT modernes, dans 9ème Journées Francophones de Programmation par Contraintes (JFPC) , (to appear), 2013

Gilles Audemard, Benoît Hoessen, Saïd Jabbour and Cédric Piette Un nouveau cadre "diviser pour régner" pour SAT distribué , dans 9ème Journées Francophones de Programmation par Contraintes (JFPC) , (to appear), 2013

2012

Saïd Jabbour, and Lakhdar Saïs Symétries et QBF , dans Revue d'Intelligence artificielle (RIA) , volume 26, numéro 1-2, pages 103-125, 2012.

Tools & Downloads

ManySAT home page parallel SAT solver based on portfolio architecture
Penelope an extension of ManySat
Sat4Sequence Mining frequent motif in a sequence using a modeling to SAT problem
sbp4Qbf tool to break symmetries in QBF formulas

Awards

Penelope, third place, SAT Competition 2013, Category: Parallel Solvers
Penelope, silver medal, SAT Challenge 2012 (Parallel solvers category)
ManySAT 1.5, silver medal, SAT Race 2010 (Parallel solvers category)
ManySAT 1.1, bronze medal, SAT Race 2010 (Parallel solvers category)
ManySAT , First rank (Jury special price), International SAT 2009 competition (Parallel Track) in Application category, June 30 - July 3, 2009, Swansea, Wales, United Kingdom
LySAT, Two bronze medal, International SAT 2009 competition (Sequential Track) in Application category (SAT-UNSAT and UNSAT), June 30 - July 3, 2009, Swansea, Wales, United Kingdom
ManySAT1.0, gold medal, SAT Race 2008 (Parallel solvers category)

Youssef Hamadi , Saïd Jabbour, and Lakhdar Saïs. Learning for Dynamic Subsumption. Proceedings of the 21th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), 2009, (Best Paper Award)