Theoretical Study of Symmetries in Propositional Calculus and Applications. - Belaid Benhamou; Lakhdar Sais (CADE, 1992)

Two Proof Procedures for a Cardinality Based Language in Propositional Calculus. - Belaid Benhamou; Lakhdar Sais; Pierre Siegel (STACS, 1994)

Tractability Through Symmetries in Propositional Calculus. - Belaid Benhamou; Lakhdar Sais (J. Autom. Reason., 1994)

Tabu Search for SAT. - Bertrand Mazure; Lakhdar Sais; Éric Grégoire (AAAI/IAAI, 1997)

Checking Several Forms of Consistency in Nonmonotonic Knowledge-Bases. - Bertrand Mazure; Lakhdar Sais; Éric Grégoire (ECSQARU-FAPR, 1997)

Local Search for Computing Normal Circumstances Models. - Bertrand Mazure; Lakhdar Sais; Éric Grégoire (Fuzzy Days, 1997)

Tractable Cover Compilations. - Yacine Boufkhad; Éric Grégoire; Pierre Marquis; Bertrand Mazure; Lakhdar Sais (IJCAI (1), 1997)

An Efficient Technique to Ensure the Logical Consistency of Interacting Knowledge Bases. - Bertrand Mazure; Lakhdar Sais; Éric Grégoire (Int. J. Cooperative Inf. Syst., 1997)

Combining Nonmonotonic Reasoning and Belief Revision: A Practical Approach. - Brigitte Bessant; Éric Grégoire; Pierre Marquis; Lakhdar Sais (AIMSA, 1998)

System Description: CRIL Platform for SAT. - Bertrand Mazure; Lakhdar Sais; Éric Grégoire (CADE, 1998)

Validation of Knowledge-Based Systems by Means of Stochastic Search. - Laure Brisoux; Éric Grégoire; Lakhdar Sais (DEXA Workshop, 1998)

Boosting Complete Techniques Thanks to Local Search Methods. - Bertrand Mazure; Lakhdar Sais; Éric Grégoire (Ann. Math. Artif. Intell., 1998)

Improving Backtrack Search for SAT by Means of Redundancy. - Laure Brisoux; Éric Grégoire; Lakhdar Sais (ISMIS, 1999)

About the use of local consistency in solving CSPs. - Assef Chmeiss; Lakhdar Sais (ICTAI, 2000)

Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem. - Christian Bessière; Assef Chmeiss; Lakhdar Sais (CP, 2001)

Checking depth-limited consistency and inconsistency in knowledge-based systems. - Laure Brisoux; Éric Grégoire; Lakhdar Sais (Int. J. Intell. Syst., 2001)

Using Failed Local Search for SAT as an Oracle for Tackling Harder A.I. Problems More Efficiently. - Éric Grégoire; Bertrand Mazure; Lakhdar Sais (AIMSA, 2002)

Recovering and Exploiting Structural Knowledge from CNF Formulas. - Richard Ostrowski; Éric Grégoire; Bertrand Mazure; Lakhdar Sais (CP, 2002)

Eliminating Redundancies in SAT Search Trees. - Richard Ostrowski; Bertrand Mazure; Lakhdar Sais; Éric Grégoire (ICTAI, 2003)

Support Inference for Generic Filtering. - Frédéric Boussemart; Fred Hemery; Christophe Lecoutre; Lakhdar Sais (CP, 2004)

Boosting Systematic Search by Weighting Constraints. - Frédéric Boussemart; Fred Hemery; Christophe Lecoutre; Lakhdar Sais (ECAI, 2004)

SAT Based BDD Solver for Quantified Boolean Formulas. - Gilles Audemard; Lakhdar Sais (ICTAI, 2004)

Constraint Satisfaction Problems: Backtrack Search Revisited. - Assef Chmeiss; Lakhdar Sais (ICTAI, 2004)

Dealing with Symmetries in Quantified Boolean Formulas. - Gilles Audemard; Bertrand Mazure; Lakhdar Sais (SAT, 2004)

Automatic Extraction of Functional Dependencies. - Éric Grégoire; Richard Ostrowski; Bertrand Mazure; Lakhdar Sais (SAT (Selected Papers, 2004)

Using Boolean Constraint Propagation for Sub-clauses Deduction. - Sylvain Darras; Gilles Dequen; Laure Devendeville; Bertrand Mazure; Richard Ostrowski; Lakhdar Sais (CP, 2005)

A Symbolic Search Based Approach for Quantified Boolean Formulas. - Gilles Audemard; Lakhdar Sais (SAT, 2005)

Extracting MUCs from Constraint Networks. - Fred Hemery; Christophe Lecoutre; Lakhdar Sais; Frédéric Boussemart (ECAI, 2006)

Last Conflict Based Reasoning. - Christophe Lecoutre; Lakhdar Sais; Sébastien Tabary; Vincent Vidal 001 (ECAI, 2006)

Computing Horn Strong Backdoor Sets Thanks to Local Search. - Lionel Paris; Richard Ostrowski; Pierre Siegel; Lakhdar Sais (ICTAI, 2006)

A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs. - Éric Grégoire; Bertrand Mazure; Cédric Piette; Lakhdar Sais (IRI, 2006)

Transposition Tables for Constraint Satisfaction. - Christophe Lecoutre; Lakhdar Sais; Sébastien Tabary; Vincent Vidal 001 (AAAI, 2007)

Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance. - Christophe Lecoutre; Lakhdar Sais; Sébastien Tabary; Vincent Vidal 001 (CP, 2007)

Eliminating Redundant Clauses in SAT Instances. - Olivier Fourdrinoy; Éric Grégoire; Bertrand Mazure; Lakhdar Sais (CPAIOR, 2007)

Light Integration of Path Consistency for Solving CSPs. - Assef Chmeiss; Vincent Krawczyk; Lakhdar Sais (ICTAI (1), 2007)

Symmetry Breaking in Quantified Boolean Formulae. - Gilles Audemard; Saïd Jabbour; Lakhdar Sais (IJCAI, 2007)

Nogood Recording from Restarts. - Christophe Lecoutre; Lakhdar Sais; Sébastien Tabary; Vincent Vidal 001 (IJCAI, 2007)

Reducing hard SAT instances to polynomial ones. - Olivier Fourdrinoy; Éric Grégoire; Bertrand Mazure; Lakhdar Sais (IRI, 2007)

From Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets. - Lionel Paris; Richard Ostrowski; Pierre Siegel; Lakhdar Sais (MICAI, 2007)

Relaxation of Qualitative Constraint Networks. - Dominique D'Almeida; Jean-François Condotta; Christophe Lecoutre; Lakhdar Sais (SARA, 2007)

Circuit Based Encoding of CNF Formula. - Gilles Audemard; Lakhdar Sais (SAT, 2007)

Recording and Minimizing Nogoods from Restarts. - Christophe Lecoutre; Lakhdar Sais; Sébastien Tabary; Vincent Vidal 001 (J. Satisf. Boolean Model. Comput., 2007)

Using SAT Encodings to Drive CSP Value Ordering Heuristics. - Christophe Lecoutre; Lakhdar Sais; Julien Vion (J. Satisf. Boolean Model. Comput., 2007)

Redundancy in CSPs. - Assef Chmeiss; Vincent Krawczyk; Lakhdar Sais (ECAI, 2008)

Vivifying Propositional Clausal Formulae. - Cédric Piette; Youssef Hamadi; Lakhdar Sais (ECAI, 2008)

A Generalized Framework for Conflict Analysis. - Gilles Audemard; Lucas Bordeaux; Youssef Hamadi; Saïd Jabbour; Lakhdar Sais (SAT, 2008)

SAT graph-based representation: A new perspective. - Gilles Audemard; Saïd Jabbour; Lakhdar Sais (J. Algorithms, 2008)

Efficient Combination of Decision Procedures for MUS Computation. - Cédric Piette; Youssef Hamadi; Lakhdar Sais (FroCoS, 2009)

Learning in Local Search. - Gilles Audemard; Jean-Marie Lagniez; Bertrand Mazure; Lakhdar Sais (ICTAI, 2009)

Enhancing Neighbourhood Substitutability Thanks to Singleton Arc Consistency. - Dominique D'Almeida; Lakhdar Sais (ICTAI, 2009)

Local Autarkies Searching for the Dynamic Partition of CNF Formulae. - Éric Grégoire; Bertrand Mazure; Lakhdar Sais (ICTAI, 2009)

Control-Based Clause Sharing in Parallel SAT Solving. - Youssef Hamadi; Saïd Jabbour; Lakhdar Sais (IJCAI, 2009)

Reasoning from last conflict(s) in constraint programming. - Christophe Lecoutre; Lakhdar Sais; Sébastien Tabary; Vincent Vidal 001 (Artif. Intell., 2009)

Integrating Conflict Driven Clause Learning to Local Search - Gilles Audemard; Jean-Marie Lagniez; Bertrand Mazure; Lakhdar Sais (LSCS, 2009)

ManySAT: a Parallel SAT Solver. - Youssef Hamadi; Saïd Jabbour; Lakhdar Sais (J. Satisf. Boolean Model. Comput., 2009)

Segmentation of 3D Brain Structures Using the Bayesian Generalized Fast Marching Method. - Mohamed Baghdadi; Nacéra Benamrane; Lakhdar Sais (Brain Informatics, 2010)

Diversification and Intensification in Parallel SAT Solving. - Long Guo; Youssef Hamadi; Saïd Jabbour; Lakhdar Sais (CP, 2010)

Portfolio-based Parallel SAT solving. - Lakhdar Sais (HPCS, 2010)

Boosting Local Search Thanks to cdcl. - Gilles Audemard; Jean-Marie Lagniez; Bertrand Mazure; Lakhdar Sais (LPAR (Yogyakarta), 2010)

Learning for Dynamic Subsumption. - Youssef Hamadi; Saïd Jabbour; Lakhdar Sais (Int. J. Artif. Intell. Tools, 2010)

A Constraint Programming Approach for Enumerating Motifs in a Sequence. - Emmanuel Coquery; Saïd Jabbour; Lakhdar Sais (ICDM Workshops, 2011)

On Freezing and Reactivating Learnt Clauses. - Gilles Audemard; Jean-Marie Lagniez; Bertrand Mazure; Lakhdar Sais (SAT, 2011)

Deterministic Parallel DPLL. - Youssef Hamadi; Saïd Jabbour; Cédric Piette; Lakhdar Sais (J. Satisf. Boolean Model. Comput., 2011)

Control-Based Clause Sharing in Parallel SAT Solving. - Youssef Hamadi; Saïd Jabbour; Lakhdar Sais (Autonomous Search, 2012)

A SAT-Based Approach for Discovering Frequent, Closed and Maximal Patterns in a Sequence. - Emmanuel Coquery; Saïd Jabbour; Lakhdar Saïs; Yakoub Salhi (ECAI, 2012)

Symmetries in Itemset Mining. - Saïd Jabbour; Lakhdar Sais; Yakoub Salhi; Karim Tabia (ECAI, 2012)

Extending Resolution by Dynamic Substitution of Boolean Functions. - Saïd Jabbour; Jerry Lonlac; Lakhdar Sais (ICTAI, 2012)

Graded Modal Logic GS5 and Itemset Support Satisfiability. - Yakoub Salhi; Saïd Jabbour; Lakhdar Sais (ISIP, 2012)

Intensification Search in Modern SAT Solvers - (Poster Presentation). - Saïd Jabbour; Jerry Lonlac; Lakhdar Saïs (SAT, 2012)

Learning from conflicts in propositional satisfiability. - Youssef Hamadi; Saïd Jabbour; Lakhdar Sais (4OR, 2012)

On the complexity of computing minimal unsatisfiable LTL formulas. - Lakhdar Saïs; Mohand-Said Hacid; François Hantry (Electron. Colloquium Comput. Complex., 2012)

Symétries et QBF. - Saïd Jabbour; Lakhdar Sais (Rev. d'Intelligence Artif., 2012)

Boolean satisfiability for sequence mining. - Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (CIKM, 2013)

Mining-based compression approach of propositional formulae. - Saïd Jabbour; Lakhdar Sais; Yakoub Salhi; Takeaki Uno (CIKM, 2013)

Symmetry-Based Pruning in Itemset Mining. - Saïd Jabbour; Mehdi Khiari; Lakhdar Sais; Yakoub Salhi; Karim Tabia (ICTAI, 2013)

The Top-k Frequent Closed Itemset Mining Using Top-k SAT Problem. - Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (ECML/PKDD (3), 2013)

Adding New Bi-Asserting Clauses for Faster Search in Modern SAT Solvers. - Saïd Jabbour; Jerry Lonlac; Lakhdar Saïs (SARA, 2013)

Mining to Compact CNF Propositional Formulae - Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (CoRR, 2013)

A Mining-Based Compression Approach for Constraint Satisfaction Problems - Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (CoRR, 2013)

A Pigeon-Hole Based Encoding of Cardinality Constraints. - Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (Theory Pract. Log. Program., 2013)

Prime Implicates Based Inconsistency Characterization. - Saïd Jabbour; Yue Ma 009; Badran Raddaoui; Lakhdar Sais (ECAI, 2014)

Symétries et Extraction de Motifs Ensemblistes. - Saïd Jabbour; Mehdi Khiari; Lakhdar Sais; Yakoub Salhi; Karim Tabia (EGC, 2014)

Symmetry Breaking in Itemset Mining. - Belaïd Benhamou; Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (KDIR, 2014)

A Generic and Declarative Method for Symmetry Breaking in Itemset Mining. - Belaïd Benhamou; Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (IC3K (Selected Papers), 2014)

Extensions and Variants of Dalal's Quad Polynomial Fragments of SAT. - Balasim Al-Saedi; Éric Grégoire; Bertrand Mazure; Lakhdar Sais (ICTAI, 2014)

Diversification by Clauses Deletion Strategies in Portfolio Parallel SAT Solving. - Long Guo; Saïd Jabbour; Jerry Lonlac; Lakhdar Sais (ICTAI, 2014)

On the Characterization of Inconsistency: A Prime Implicates Based Framework. - Saïd Jabbour; Yue Ma 009; Badran Raddaoui; Lakhdar Sais (ICTAI, 2014)

Extending modern SAT solvers for models enumeration. - Saïd Jabbour; Jerry Lonlac; Lakhdar Sais; Yakoub Salhi (IRI, 2014)

About Some UP-Based Polynomial Fragments of SAT. - Mohammad Al-Saedi; Éric Grégoire; Bertrand Mazure; Lakhdar Saïs (ISAIM, 2014)

Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form. - Saïd Jabbour; João Marques-Silva 001; Lakhdar Sais; Yakoub Salhi (JELIA, 2014)

On the measure of conflicts: A MUS-Decomposition Based Framework. - Saïd Jabbour; Yue Ma 009; Badran Raddaoui; Lakhdar Sais; Yakoub Salhi (CoRR, 2014)

Résolution étendue par substitution dynamique des fonctions booléennes. - Saïd Jabbour; Jerry Lonlac; Lakhdar Saïs; Clémentin Tayou Djamégni (Rev. d'Intelligence Artif., 2014)

Parallel SAT based closed frequent itemsets enumeration. - Imen Ouled Dlala; Saïd Jabbour; Lakhdar Sais; Yakoub Salhi; Boutheina Ben Yaghlane (AICCSA, 2015)

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

Inconsistency-based Ranking of Knowledge Bases. - Saïd Jabbour; Badran Raddaoui; Lakhdar Sais (ICAART (2), 2015)

Mining to Compress Table Constraints. - Saïd Jabbour; Stéphanie Roussel 001; Lakhdar Sais; Yakoub Salhi (ICTAI, 2015)

Decomposition Based SAT Encodings for Itemset Mining Problems. - Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (PAKDD (2), 2015)

On SAT Models Enumeration in Itemset Mining. - Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (CoRR, 2015)

Summarizing big graphs by means of pseudo-boolean constraints. - Saïd Jabbour; Nizar Mhadhbi; Abdesattar Mhadhbi; Badran Raddaoui; Lakhdar Sais (IEEE BigData, 2016)

On the Computation of Top-k Extensions in Abstract Argumentation Frameworks. - Saïd Jabbour; Badran Raddaoui; Lakhdar Sais; Yakoub Salhi (ECAI, 2016)

Exploiting MUS Structure to Measure Inconsistency of Knowledge Bases. - Saïd Jabbour; Lakhdar Sais (ECAI, 2016)

Knowledge Base Compilation for Inconsistency Measures. - Saïd Jabbour; Badran Raddaoui; Lakhdar Sais (ICAART (2), 2016)

A SAT-Based Approach for Enumerating Interesting Patterns from Uncertain Data. - Imen Ouled Dlala; Saïd Jabbour; Badran Raddaoui; Lakhdar Sais; Boutheina Ben Yaghlane (ICTAI, 2016)

Itemset Mining with Penalties. - Saïd Jabbour; Souhila Kaci; Lakhdar Sais; Yakoub Salhi (ICTAI, 2016)

A SAT-Based Approach for Mining Association Rules. - Abdelhamid Boudane; Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (IJCAI, 2016)

Z-Equilibrium For a CSP Game. - Kahina Bouchama; Mohammed Said Radjef; Lakhdar Sais (ISAIM, 2016)

A MIS Partition Based Framework for Measuring Inconsistency. - Saïd Jabbour; Yue Ma 009; Badran Raddaoui; Lakhdar Sais; Yakoub Salhi (KR, 2016)

A Comparative Study of SAT-Based Itemsets Mining. - Imen Ouled Dlala; Saïd Jabbour; Lakhdar Saïs; Boutheina Ben Yaghlane (SGAI Conf., 2016)

What we can learn from conflicts in propositional satisfiability. - Youssef Hamadi; Saïd Jabbour; Lakhdar Saïs (Ann. Oper. Res., 2016)

Finding Overlapping Communities in Networks Using Propositional Satisfiability. - Saïd Jabbour; Nizar Mhadhbi; Badran Raddaoui; Lakhdar Sais (EDA, 2017)

Une approche logique pour la fouille de règles d'association. - Abdelhamid Boudane; Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (EGC, 2017)

Enhancing Pigeon-Hole based Encoding of Boolean Cardinality Constraints. - Soukaina Hattad; Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (ICAART (2), 2017)

From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes. - Yazid Boumarafi; Lakhdar Sais; Yakoub Salhi (LPAR, 2017)

Enumerating Non-redundant Association Rules Using Satisfiability. - Abdelhamid Boudane; Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (PAKDD (1), 2017)

Clustering Complex Data Represented as Propositional Formulas. - Abdelhamid Boudane; Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (PAKDD (2), 2017)

A SAT-Based Framework for Overlapping Community Detection in Networks. - Saïd Jabbour; Nizar Mhadhbi; Badran Raddaoui; Lakhdar Sais (PAKDD (2), 2017)

On Maximal Frequent Itemsets Enumeration. - Saïd Jabbour; Fatima Zahra Mana; Lakhdar Sais (SoCPaR, 2017)

Mining Top-k motifs with a SAT-based framework. - Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (Artif. Intell., 2017)

About some UP-based polynomial fragments of SAT. - Balasim Al-Saedi; Olivier Fourdrinoy; Éric Grégoire; Bertrand Mazure; Lakhdar Saïs (Ann. Math. Artif. Intell., 2017)

Quantifying conflicts in propositional logic through prime implicates. - Saïd Jabbour; Yue Ma 009; Badran Raddaoui; Lakhdar Sais (Int. J. Approx. Reason., 2017)

Fuzzy generalized fast marching method for 3D segmentation of brain structures. - Mohamed Baghdadi; Nacéra Benamrane; Lakhdar Sais (Int. J. Imaging Syst. Technol., 2017)

Triangle-Driven Community Detection in Large Graphs Using Propositional Satisfiability. - Saïd Jabbour; Nizar Mhadhbi; Badran Raddaoui; Lakhdar Sais (AINA, 2018)

Detecting Highly Overlapping Community Structure by Model-based Maximal Clique Expansion. - Saïd Jabbour; Nizar Mhadhbi; Badran Raddaoui; Lakhdar Sais (IEEE BigData, 2018)

A Parallel SAT-Based Framework for Closed Frequent Itemsets Mining. - Imen Ouled Dlala; Saïd Jabbour; Badran Raddaoui; Lakhdar Sais (CP, 2018)

On Maximal Frequent Itemsets Mining with Constraints. - Saïd Jabbour; Fatima Ezzahra Mana; Imen Ouled Dlala; Badran Raddaoui; Lakhdar Sais (CP, 2018)

Pushing the Envelope in Overlapping Communities Detection. - Saïd Jabbour; Nizar Mhadhbi; Badran Raddaoui; Lakhdar Sais (IDA, 2018)

Efficient SAT-Based Encodings of Conditional Cardinality Constraints. - Abdelhamid Boudane; Saïd Jabbour; Badran Raddaoui; Lakhdar Sais (LPAR, 2018)

Efficient Encodings of Conditional Cardinality Constraints. - Abdelhamid Boudane; Saïd Jabbour; Badran Raddaoui; Lakhdar Sais (CoRR, 2018)

SAT-Based Data Mining. - Abdelhamid Boudane; Saïd Jabbour; Lakhdar Sais; Yakoub Salhi (Int. J. Artif. Intell. Tools, 2018)

Revisiting the Learned Clauses Database Reduction Strategies. - Saïd Jabbour; Jerry Lonlac; Lakhdar Saïs; Yakoub Salhi (Int. J. Artif. Intell. Tools, 2018)

Représentations compactes des graphes et contraintes pseudo booléennes. - Saïd Jabbour; Nizar Mhadhbi; Badran Raddaoui; Lakhdar Sais (EGC, 2019)

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

Extracting Frequent Gradual Patterns Using Constraints Modeling. - Jerry Lonlac; Saïd Jabbour; Engelbert Mephu Nguifo; Lakhdar Saïs; Badran Raddaoui (CoRR, 2019)

Solving a Potential Clustering Game. - Kahina Bouchama; Arnaud Lallouet; Mohammed Said Radjef; Lakhdar Sais (Int. J. Artif. Intell. Tools, 2019)

SAT-based models for overlapping community detection in networks. - Saïd Jabbour; Nizar Mhadhbi; Badran Raddaoui; Lakhdar Sais (Computing, 2020)

Towards a Compact SAT-Based Encoding of Itemset Mining Tasks. - Ikram Nekkache; Saïd Jabbour; Lakhdar Sais; Nadjet Kamel (CPAIOR, 2021)

A Bayesian Monte Carlo method for computing the Shapley value: Application to weighted voting and bin packing games. - Sofiane Touati; Mohammed Said Radjef; Lakhdar Sais (Comput. Oper. Res., 2021)

A Declarative Framework for Maximal k-plex Enumeration Problems. - Saïd Jabbour; Nizar Mhadhbi; Badran Raddaoui; Lakhdar Sais (AAMAS, 2022)

Breast Cancer Detection from Histopathology Images Based on YOLOv5. - Wafaa Rajaa Drioua; Nacéra Benamrane; Lakhdar Sais (ICFSP, 2022)

Detecting and exploiting symmetries in sequential pattern mining. - Ikram Nekkache; Saïd Jabbour; Nadjet Kamel; Lakhdar Sais (Int. J. Data Min. Model. Manag., 2022)

Extracting Frequent Gradual Patterns Based on SAT. - Jerry Lonlac; Imen Ouled Dlala; Saïd Jabbour; Engelbert Mephu Nguifo; Badran Raddaoui; Lakhdar Sais (DATA, 2023)

Classification with Explanation for Human Trafficking Networks. - David Ing; Fabien Delorme; Saïd Jabbour; Nelly Robin; Lakhdar Sais (DSAA, 2023)

A Symbolic Approach to Computing Disjunctive Association Rules from Data. - Saïd Jabbour; Badran Raddaoui; Lakhdar Sais (IJCAI, 2023)

Breast Cancer Histopathological Images Segmentation Using Deep Learning. - Wafaa Rajaa Drioua; Nacéra Benamrane; Lakhdar Sais (Sensors, 2023)

LAD-based Feature Selection for Optimal Decision Trees and Other Classifiers. - David Ing; Saïd Jabbour; Lakhdar Sais; Fabien Delorme (KR, 2024)

Label propagation algorithm for community discovery based on centrality and common neighbours. - Asma Douadi; Nadjet Kamel; Lakhdar Sais (J. Supercomput., 2024)

On the Discovery of Frequent Gradual Patterns: A Symbolic AI-Based Framework. - Jerry Lonlac; Imen Ouled Dlala; Saïd Jabbour; Engelbert Mephu Nguifo; Badran Raddaoui; Lakhdar Saïs (SN Comput. Sci., 2024)