Saïd Jabbour

IEEE Intell. Syst., 2022

A Parallel Declarative Framework for Mining High Utility Itemsets.

[BibT_eX]

[DOI]

Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2022

Discovering Overlapping Communities Based on Cohesive Subgraph Models over Graph Data.

[BibT_eX]

[DOI]

Mourad Kmimech

Proceedings of the Big Data Analytics and Knowledge Discovery, 2022

On the Enumeration of Frequent High Utility Itemsets: A Symbolic AI Approach.

[BibT_eX]

[DOI]

Amel Hidouri

Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

A Declarative Framework for Maximal <i>k</i>-plex Enumeration Problems.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

A Distributed SAT-Based Framework for Closed Frequent Itemset Mining.

[BibT_eX]

[DOI]

Proceedings of the Advanced Data Mining and Applications - 18th International Conference, 2022

2021

Mining Closed High Utility Itemsets based on Propositional Satisfiability.

[BibT_eX]

[DOI]

Amel Hidouri

Data Knowl. Eng., 2021

A Constraint-based Approach for Enumerating Gradual Itemsets.

[BibT_eX]

[DOI]

Proceedings of the 33rd IEEE International Conference on Tools with Artificial Intelligence, 2021

A Declarative Framework for Mining Top-k High Utility Itemsets.

[BibT_eX]

[DOI]

Proceedings of the Big Data Analytics and Knowledge Discovery, 2021

Towards a Compact SAT-Based Encoding of Itemset Mining Tasks.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2021

On Minimal and Maximal High Utility Itemsets Mining using Propositional Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the 2021 IEEE International Conference on Big Data (Big Data), 2021

2020

A MaxSAT based approach for QoS cloud services.

[BibT_eX]

[DOI]

Nabil Hameurlain

Int. J. Parallel Emergent Distributed Syst., 2020

Cloud service composition using minimal unsatisfiability and genetic algorithm.

[BibT_eX]

[DOI]

Mouna Rekik

Concurr. Comput. Pract. Exp., 2020

SAT-based models for overlapping community detection in networks.

[BibT_eX]

[DOI]

Computing, 2020

On the Enumeration of Association Rules: A Decomposition-based Approach.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

A SAT-Based Approach for Mining High Utility Itemsets from Transaction Databases.

[BibT_eX]

[DOI]

Amel Hidouri

Proceedings of the Big Data Analytics and Knowledge Discovery, 2020

2019

Extracting Frequent Gradual Patterns Using Constraints Modeling.

[BibT_eX]

[DOI]

Engelbert Mephu Nguifo

CoRR, 2019

Handling Disagreement in Ontologies-Based Reasoning via Argumentation.

[BibT_eX]

[DOI]

Proceedings of the Web Information Systems Engineering - WISE 2019, 2019

Mining Gradual Itemsets Using Sequential Pattern Mining.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Fuzzy Systems, 2019

Représentations compactes des graphes et contraintes pseudo booléennes.

[BibT_eX]

[DOI]

Proceedings of the Extraction et Gestion des connaissances, 2019

Towards a Prudent Argumentation Framework for Reasoning with Imperfect Ontologies.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Workshop on Description Logics, 2019

2018

Revisiting the Learned Clauses Database Reduction Strategies.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 2018

SAT-Based Data Mining.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 2018

Efficient Encodings of Conditional Cardinality Constraints.

[BibT_eX]

[DOI]

CoRR, 2018

Efficient SAT-Based Encodings of Conditional Cardinality Constraints.

[BibT_eX]

[DOI]

Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Pushing the Envelope in Overlapping Communities Detection.

[BibT_eX]

[DOI]

Proceedings of the Advances in Intelligent Data Analysis XVII, 2018

On Maximal Frequent Itemsets Mining with Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2018

A Parallel SAT-Based Framework for Closed Frequent Itemsets Mining.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2018

Detecting Highly Overlapping Community Structure by Model-based Maximal Clique Expansion.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018

Triangle-Driven Community Detection in Large Graphs Using Propositional Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE International Conference on Advanced Information Networking and Applications, 2018

Des Données aux Connaissances : Modèles et Algorithmes.

[BibT_eX]

[DOI]

, 2018

2017

Quantifying conflicts in propositional logic through prime implicates.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2017

Mining Top-k motifs with a SAT-based framework.

[BibT_eX]

[DOI]

Artif. Intell., 2017

Formal Approach for QoS-Aware Cloud Service Composition.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises, 2017

Handling conflicts in uncertain ontologies using deductive argumentation.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Web Intelligence, 2017

On Maximal Frequent Itemsets Enumeration.

[BibT_eX]

[DOI]

Fatima Zahra Mana

Proceedings of the Ninth International Conference on Soft Computing and Pattern Recognition, 2017

A SAT-Based Framework for Overlapping Community Detection in Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2017

Clustering Complex Data Represented as Propositional Formulas.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2017

Enumerating Non-redundant Association Rules Using Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2017

Enhancing Pigeon-Hole based Encoding of Boolean Cardinality Constraints.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Agents and Artificial Intelligence, 2017

Une approche logique pour la fouille de règles d'association.

[BibT_eX]

[DOI]

Proceedings of the 17ème Journées Francophones Extraction et Gestion des Connaissances, 2017

Finding Overlapping Communities in Networks Using Propositional Satisfiability.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2016

A Comparative Study of SAT-Based Itemsets Mining.

[BibT_eX]

[DOI]

Imen Ouled Dlala

Proceedings of the Research and Development in Intelligent Systems XXXIII, 2016

A MIS Partition Based Framework for Measuring Inconsistency.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

A SAT-Based Approach for Mining Association Rules.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Itemset Mining with Penalties.

[BibT_eX]

[DOI]

Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

A SAT-Based Approach for Enumerating Interesting Patterns from Uncertain Data.

[BibT_eX]

[DOI]

Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

Knowledge Base Compilation for Inconsistency Measures.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Agents and Artificial Intelligence (ICAART 2016), 2016

Exploiting MUS Structure to Measure Inconsistency of Knowledge Bases.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

On Inconsistency Measuring and Resolving.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016

On repairing queries in cloud computing.

[BibT_eX]

[DOI]

Proceedings of the 13th IEEE/ACS International Conference of Computer Systems and Applications, 2016

2015

On SAT Models Enumeration in Itemset Mining.

[BibT_eX]

[DOI]

CoRR, 2015

Decomposition Based SAT Encodings for Itemset Mining Problems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2015

Minimum Unsatisfiability based QoS Web Service Composition over the Cloud Computing.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on Intelligent Systems Design and Applications, 2015

Mining to Compress Table Constraints.

[BibT_eX]

[DOI]

Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence, 2015

On QoS web service composition using satisfiability.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Information & Communication Technology and Accessibility, 2015

Relaxation Based SaaS for Repairing Failed Queries over the Cloud Computing.

[BibT_eX]

[DOI]

Salima Benbernou

Proceedings of the 12th IEEE International Conference on e-Business Engineering, 2015

Inconsistency-based Ranking of Knowledge Bases.

[BibT_eX]

Proceedings of the ICAART 2015, 2015

On Structure-Based Inconsistency Measures and Their Computations via Closed Set Packing.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Parallel SAT based closed frequent itemsets enumeration.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Clémentin Tayou Djamégni

Rev. d'Intelligence Artif., 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Dolius: A Distributed Parallel SAT Solving Framework.

[BibT_eX]

[DOI]

Proceedings of the POS-14. Fifth Pragmatics of SAT workshop, 2014

An Effective Distributed D&C Approach for the Satisfiability Problem.

[BibT_eX]

[DOI]

Proceedings of the 22nd Euromicro International Conference on Parallel, 2014

Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014

Extending modern SAT solvers for models enumeration.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE International Conference on Information Reuse and Integration, 2014

On the Characterization of Inconsistency: A Prime Implicates Based Framework.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Diversification by Clauses Deletion Strategies in Portfolio Parallel SAT Solving.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

A Generic and Declarative Method for Symmetry Breaking in Itemset Mining.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Discovery, Knowledge Engineering and Knowledge Management, 2014

Symmetry Breaking in Itemset Mining.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 14èmes Journées Francophones Extraction et Gestion des Connaissances, 2014

Prime Implicates Based Inconsistency Characterization.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Inconsistency measurement thanks to mus decomposition.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013

A Pigeon-Hole Based Encoding of Cardinality Constraints.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2013

A Mining-Based Compression Approach for Constraint Satisfaction Problems

[BibT_eX]

[DOI]

CoRR, 2013

Mining to Compact CNF Propositional Formulae

[BibT_eX]

[DOI]

CoRR, 2013

Adding New Bi-Asserting Clauses for Faster Search in Modern SAT Solvers.

[BibT_eX]

[DOI]

Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

The Top-k Frequent Closed Itemset Mining Using Top-k SAT Problem.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013

Symmetry-Based Pruning in Itemset Mining.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

Measuring Inconsistency through Minimal Proofs.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2013

Mining-based compression approach of propositional formulae.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

Boolean satisfiability for sequence mining.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012

Symétries et QBF.

[BibT_eX]

[DOI]

Rev. d'Intelligence Artif., 2012

Learning from conflicts in propositional satisfiability.

[BibT_eX]

[DOI]

4OR, 2012

Intensification Search in Modern SAT Solvers - (Poster Presentation).

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Revisiting Clause Exchange in Parallel SAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Graded Modal Logic GS5 and Itemset Support Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the Information Search, Integration and Personalization, 2012

Extending Resolution by Dynamic Substitution of Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

Symmetries in Itemset Mining.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2012, 2012

A SAT-Based Approach for Discovering Frequent, Closed and Maximal Patterns in a Sequence.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2012, 2012

Control-Based Clause Sharing in Parallel SAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Autonomous Search, 2012

2011

Deterministic Parallel DPLL.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2011

A Constraint Programming Approach for Enumerating Motifs in a Sequence.

[BibT_eX]

[DOI]

Emmanuel Coquery

Proceedings of the Data Mining Workshops (ICDMW), 2011

2010

Learning from successes.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 2010

Learning for Dynamic Subsumption.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 2010

Diversification and Intensification in Parallel SAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

2009

ManySAT: a Parallel SAT Solver.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2009

Control-Based Clause Sharing in Parallel SAT Solving.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

Learning for Dynamic Assignments Reordering.

[BibT_eX]

[DOI]

Proceedings of the ICTAI 2009, 2009

2008

SAT graph-based representation: A new perspective.

[BibT_eX]

[DOI]

Gilles Audemard

J. Algorithms, 2008

A Generalized Framework for Conflict Analysis.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2008

2007

Symmetry Breaking in Quantified Boolean Formulae.

[BibT_eX]

[DOI]

Gilles Audemard