Lakhdar Sais

Orcid: 0000-0003-2879-8627

According to our database1, Lakhdar Sais authored at least 146 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Discovery of Frequent Gradual Patterns: A Symbolic AI-Based Framework.
SN Comput. Sci., October, 2024

Label propagation algorithm for community discovery based on centrality and common neighbours.
J. Supercomput., May, 2024

2023
Breast Cancer Histopathological Images Segmentation Using Deep Learning.
Sensors, September, 2023

A Symbolic Approach to Computing Disjunctive Association Rules from Data.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Classification with Explanation for Human Trafficking Networks.
Proceedings of the 10th IEEE International Conference on Data Science and Advanced Analytics, 2023

Extracting Frequent Gradual Patterns Based on SAT.
Proceedings of the 12th International Conference on Data Science, 2023

2022
Detecting and exploiting symmetries in sequential pattern mining.
Int. J. Data Min. Model. Manag., 2022

Breast Cancer Detection from Histopathology Images Based on YOLOv5.
Proceedings of the 7th International Conference on Frontiers of Signal Processing, 2022

A Declarative Framework for Maximal <i>k</i>-plex Enumeration Problems.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021
A Bayesian Monte Carlo method for computing the Shapley value: Application to weighted voting and bin packing games.
Comput. Oper. Res., 2021

Towards a Compact SAT-Based Encoding of Itemset Mining Tasks.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2021

2020
SAT-based models for overlapping community detection in networks.
Computing, 2020

2019
Solving a Potential Clustering Game.
Int. J. Artif. Intell. Tools, 2019

Extracting Frequent Gradual Patterns Using Constraints Modeling.
CoRR, 2019

Mining Gradual Itemsets Using Sequential Pattern Mining.
Proceedings of the 2019 IEEE International Conference on Fuzzy Systems, 2019

Représentations compactes des graphes et contraintes pseudo booléennes.
Proceedings of the Extraction et Gestion des connaissances, 2019

2018
Revisiting the Learned Clauses Database Reduction Strategies.
Int. J. Artif. Intell. Tools, 2018

SAT-Based Data Mining.
Int. J. Artif. Intell. Tools, 2018

Efficient Encodings of Conditional Cardinality Constraints.
CoRR, 2018

Efficient SAT-Based Encodings of Conditional Cardinality Constraints.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Pushing the Envelope in Overlapping Communities Detection.
Proceedings of the Advances in Intelligent Data Analysis XVII, 2018

On Maximal Frequent Itemsets Mining with Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2018

A Parallel SAT-Based Framework for Closed Frequent Itemsets Mining.
Proceedings of the Principles and Practice of Constraint Programming, 2018

Detecting Highly Overlapping Community Structure by Model-based Maximal Clique Expansion.
Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018

Triangle-Driven Community Detection in Large Graphs Using Propositional Satisfiability.
Proceedings of the 32nd IEEE International Conference on Advanced Information Networking and Applications, 2018

2017
Fuzzy generalized fast marching method for 3D segmentation of brain structures.
Int. J. Imaging Syst. Technol., 2017

Quantifying conflicts in propositional logic through prime implicates.
Int. J. Approx. Reason., 2017

About some UP-based polynomial fragments of SAT.
Ann. Math. Artif. Intell., 2017

Mining Top-k motifs with a SAT-based framework.
Artif. Intell., 2017

On Maximal Frequent Itemsets Enumeration.
Proceedings of the Ninth International Conference on Soft Computing and Pattern Recognition, 2017

A SAT-Based Framework for Overlapping Community Detection in Networks.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2017

Clustering Complex Data Represented as Propositional Formulas.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2017

Enumerating Non-redundant Association Rules Using Satisfiability.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2017

From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes.
Proceedings of the LPAR-21, 2017

Enhancing Pigeon-Hole based Encoding of Boolean Cardinality Constraints.
Proceedings of the 9th International Conference on Agents and Artificial Intelligence, 2017

Une approche logique pour la fouille de règles d'association.
Proceedings of the 17ème Journées Francophones Extraction et Gestion des Connaissances, 2017

Finding Overlapping Communities in Networks Using Propositional Satisfiability.
Proceedings of the Actes des 13èmes journées francophones sur les Entrepôts de Données et l'Analyse en Ligne, 2017

2016
What we can learn from conflicts in propositional satisfiability.
Ann. Oper. Res., 2016

A Comparative Study of SAT-Based Itemsets Mining.
Proceedings of the Research and Development in Intelligent Systems XXXIII, 2016

A MIS Partition Based Framework for Measuring Inconsistency.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Z-Equilibrium For a CSP Game.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

A SAT-Based Approach for Mining Association Rules.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Itemset Mining with Penalties.
Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

A SAT-Based Approach for Enumerating Interesting Patterns from Uncertain Data.
Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

Knowledge Base Compilation for Inconsistency Measures.
Proceedings of the 8th International Conference on Agents and Artificial Intelligence (ICAART 2016), 2016

Exploiting MUS Structure to Measure Inconsistency of Knowledge Bases.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

On the Computation of Top-k Extensions in Abstract Argumentation Frameworks.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Summarizing big graphs by means of pseudo-boolean constraints.
Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016

2015
On SAT Models Enumeration in Itemset Mining.
CoRR, 2015

Decomposition Based SAT Encodings for Itemset Mining Problems.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2015

Mining to Compress Table Constraints.
Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence, 2015

Inconsistency-based Ranking of Knowledge Bases.
Proceedings of the ICAART 2015, 2015

On Structure-Based Inconsistency Measures and Their Computations via Closed Set Packing.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Parallel SAT based closed frequent itemsets enumeration.
Proceedings of the 12th IEEE/ACS International Conference of Computer Systems and Applications, 2015

2014
Résolution étendue par substitution dynamique des fonctions booléennes.
Rev. d'Intelligence Artif., 2014

On the measure of conflicts: A MUS-Decomposition Based Framework.
CoRR, 2014

Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form.
Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014

About Some UP-Based Polynomial Fragments of SAT.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Extending modern SAT solvers for models enumeration.
Proceedings of the 15th IEEE International Conference on Information Reuse and Integration, 2014

On the Characterization of Inconsistency: A Prime Implicates Based Framework.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Diversification by Clauses Deletion Strategies in Portfolio Parallel SAT Solving.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Extensions and Variants of Dalal's Quad Polynomial Fragments of SAT.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

A Generic and Declarative Method for Symmetry Breaking in Itemset Mining.
Proceedings of the Knowledge Discovery, Knowledge Engineering and Knowledge Management, 2014

Symmetry Breaking in Itemset Mining.
Proceedings of the KDIR 2014 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval, Rome, Italy, 21, 2014

Symétries et Extraction de Motifs Ensemblistes.
Proceedings of the 14èmes Journées Francophones Extraction et Gestion des Connaissances, 2014

Prime Implicates Based Inconsistency Characterization.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

2013
A Pigeon-Hole Based Encoding of Cardinality Constraints.
Theory Pract. Log. Program., 2013

A Mining-Based Compression Approach for Constraint Satisfaction Problems
CoRR, 2013

Mining to Compact CNF Propositional Formulae
CoRR, 2013

Adding New Bi-Asserting Clauses for Faster Search in Modern SAT Solvers.
Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

The Top-k Frequent Closed Itemset Mining Using Top-k SAT Problem.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013

Symmetry-Based Pruning in Itemset Mining.
Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

Mining-based compression approach of propositional formulae.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

Boolean satisfiability for sequence mining.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012
Symétries et QBF.
Rev. d'Intelligence Artif., 2012

On the complexity of computing minimal unsatisfiable LTL formulas.
Electron. Colloquium Comput. Complex., 2012

Learning from conflicts in propositional satisfiability.
4OR, 2012

Intensification Search in Modern SAT Solvers - (Poster Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Graded Modal Logic GS5 and Itemset Support Satisfiability.
Proceedings of the Information Search, Integration and Personalization, 2012

Extending Resolution by Dynamic Substitution of Boolean Functions.
Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

Symmetries in Itemset Mining.
Proceedings of the ECAI 2012, 2012

A SAT-Based Approach for Discovering Frequent, Closed and Maximal Patterns in a Sequence.
Proceedings of the ECAI 2012, 2012

Control-Based Clause Sharing in Parallel SAT Solving.
Proceedings of the Autonomous Search, 2012

2011
Deterministic Parallel DPLL.
J. Satisf. Boolean Model. Comput., 2011

On Freezing and Reactivating Learnt Clauses.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

A Constraint Programming Approach for Enumerating Motifs in a Sequence.
Proceedings of the Data Mining Workshops (ICDMW), 2011

2010
Learning for Dynamic Subsumption.
Int. J. Artif. Intell. Tools, 2010

Boosting Local Search Thanks to cdcl.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Portfolio-based Parallel SAT solving.
Proceedings of the 2010 International Conference on High Performance Computing & Simulation, 2010

Diversification and Intensification in Parallel SAT Solving.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

Segmentation of 3D Brain Structures Using the Bayesian Generalized Fast Marching Method.
Proceedings of the Brain Informatics, International Conference, 2010

2009
ManySAT: a Parallel SAT Solver.
J. Satisf. Boolean Model. Comput., 2009

Integrating Conflict Driven Clause Learning to Local Search
Proceedings of the Proceedings 6th International Workshop on Local Search Techniques in Constraint Satisfaction, 2009

Reasoning from last conflict(s) in constraint programming.
Artif. Intell., 2009

Control-Based Clause Sharing in Parallel SAT Solving.
Proceedings of the IJCAI 2009, 2009

Local Autarkies Searching for the Dynamic Partition of CNF Formulae.
Proceedings of the ICTAI 2009, 2009

Enhancing Neighbourhood Substitutability Thanks to Singleton Arc Consistency.
Proceedings of the ICTAI 2009, 2009

Learning in Local Search.
Proceedings of the ICTAI 2009, 2009

Efficient Combination of Decision Procedures for MUS Computation.
Proceedings of the Frontiers of Combining Systems, 7th International Symposium, 2009

2008
SAT graph-based representation: A new perspective.
J. Algorithms, 2008

A Generalized Framework for Conflict Analysis.
Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Vivifying Propositional Clausal Formulae.
Proceedings of the ECAI 2008, 2008

Redundancy in CSPs.
Proceedings of the ECAI 2008, 2008

2007
Using SAT Encodings to Drive CSP Value Ordering Heuristics.
J. Satisf. Boolean Model. Comput., 2007

Recording and Minimizing Nogoods from Restarts.
J. Satisf. Boolean Model. Comput., 2007

Circuit Based Encoding of CNF Formula.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Relaxation of Qualitative Constraint Networks.
Proceedings of the Abstraction, 2007

From Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets.
Proceedings of the MICAI 2007: Advances in Artificial Intelligence, 2007

Reducing hard SAT instances to polynomial ones.
Proceedings of the IEEE International Conference on Information Reuse and Integration, 2007

Nogood Recording from Restarts.
Proceedings of the IJCAI 2007, 2007

Symmetry Breaking in Quantified Boolean Formulae.
Proceedings of the IJCAI 2007, 2007

Light Integration of Path Consistency for Solving CSPs.
Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007

Eliminating Redundant Clauses in SAT Instances.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance.
Proceedings of the Principles and Practice of Constraint Programming, 2007

Transposition Tables for Constraint Satisfaction.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs.
Proceedings of the 2006 IEEE International Conference on Information Reuse and Integration, 2006

Computing Horn Strong Backdoor Sets Thanks to Local Search.
Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 2006

Last Conflict Based Reasoning.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

Extracting MUCs from Constraint Networks.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

2005
A Symbolic Search Based Approach for Quantified Boolean Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Using Boolean Constraint Propagation for Sub-clauses Deduction.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
Automatic Extraction of Functional Dependencies.
Proceedings of the Theory and Applications of Satisfiability Testing, 2004

Dealing with Symmetries in Quantified Boolean Formulas.
Proceedings of the SAT 2004, 2004

Constraint Satisfaction Problems: Backtrack Search Revisited.
Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004

SAT Based BDD Solver for Quantified Boolean Formulas.
Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004

Boosting Systematic Search by Weighting Constraints.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

Support Inference for Generic Filtering.
Proceedings of the Principles and Practice of Constraint Programming, 2004

2003
Eliminating Redundancies in SAT Search Trees.
Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), 2003

2002
Recovering and Exploiting Structural Knowledge from CNF Formulas.
Proceedings of the Principles and Practice of Constraint Programming, 2002

Using Failed Local Search for SAT as an Oracle for Tackling Harder A.I. Problems More Efficiently.
Proceedings of the Artificial Intelligence: Methodology, 2002

2001
Checking depth-limited consistency and inconsistency in knowledge-based systems.
Int. J. Intell. Syst., 2001

Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2001

2000
About the use of local consistency in solving CSPs.
Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), 2000

1999
Improving Backtrack Search for SAT by Means of Redundancy.
Proceedings of the Foundations of Intelligent Systems, 11th International Symposium, 1999

1998
Boosting Complete Techniques Thanks to Local Search Methods.
Ann. Math. Artif. Intell., 1998

Validation of Knowledge-Based Systems by Means of Stochastic Search.
Proceedings of the Ninth International Workshop on Database and Expert Systems Applications, 1998

System Description: CRIL Platform for SAT.
Proceedings of the Automated Deduction, 1998

Combining Nonmonotonic Reasoning and Belief Revision: A Practical Approach.
Proceedings of the Artificial Intelligence: Methodology, 1998

1997
An Efficient Technique to Ensure the Logical Consistency of Interacting Knowledge Bases.
Int. J. Cooperative Inf. Syst., 1997

Tractable Cover Compilations.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

Local Search for Computing Normal Circumstances Models.
Proceedings of the Computational Intelligence, 1997

Checking Several Forms of Consistency in Nonmonotonic Knowledge-Bases.
Proceedings of the Qualitative and Quantitative Practical Reasoning, 1997

Tabu Search for SAT.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1994
Tractability Through Symmetries in Propositional Calculus.
J. Autom. Reason., 1994

Two Proof Procedures for a Cardinality Based Language in Propositional Calculus.
Proceedings of the STACS 94, 1994

1992
Theoretical Study of Symmetries in Propositional Calculus and Applications.
Proceedings of the Automated Deduction, 1992


  Loading...